Submission #1690730


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define mkp make_pair
#define fst first
#define snd second
typedef long long ll;
typedef pair<ll, int> pli;
const int MAXN = 100010;
const ll INF = 1LL<<50;

inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	for(; !isdigit(ch); ch = getchar()) if(ch=='-') f=-1;
	for(; isdigit(ch); ch = getchar()) x = (x*10)+(ch^48);
	return x * f;
}

int n, e, T, d[MAXN], l, r;
ll dp[MAXN], pre;
pli q[MAXN*20];

int main() {
	n = read();
	e = read(), T = read();
	for(int i = 1; i <= n; i++) d[i] = read();
	dp[0] = 0;
	l = r = 0;
	q[++r] = mkp(0, d[1]);
	pre = INF;
	int j = 0;
	for(int i = 1; i <= n; i++) {
		dp[i] = INF;
		pli u = q[l+1];
		while(2*(d[i]-u.snd) > T) {
			l++;
			if(l != r) u = q[l+1];
			else break;
		}
		while(2*(d[i]-d[j+1]) >= T) {
			pre = min(pre, dp[j]-(d[j+1]<<1));
			j++;
		}
		if(l != r) dp[i] = min(dp[i], u.fst+T);
		dp[i] = min(dp[i], pre+(d[i]<<1));
		while(l != r && dp[i] > q[r].fst) r--;
		q[++r] = mkp(dp[i], d[i+1]);
		//printf("%lld %lld\n", dp[i], pre);
	}
	printf("%lld\n", dp[n]+e);
	return 0;
}

Submission Info

Submission Time
Task D - Shik and Game
User Sunshine_cfbsl
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1140 Byte
Status WA
Exec Time 11 ms
Memory 1536 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 600 0 / 600
Status
AC × 3
AC × 6
WA × 17
AC × 17
WA × 47
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
Subtask1 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt, 2_23.txt, 2_24.txt, 2_25.txt, 2_26.txt, 2_27.txt, 2_28.txt, 2_29.txt, 2_30.txt, 2_31.txt, 2_32.txt, 2_33.txt, 2_34.txt, 2_35.txt, 2_36.txt, 2_37.txt, 2_38.txt, 2_39.txt, 2_40.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt WA 1 ms 256 KB
1_01.txt WA 1 ms 256 KB
1_02.txt WA 1 ms 256 KB
1_03.txt WA 1 ms 256 KB
1_04.txt WA 1 ms 256 KB
1_05.txt WA 1 ms 256 KB
1_06.txt WA 1 ms 256 KB
1_07.txt WA 1 ms 256 KB
1_08.txt WA 1 ms 256 KB
1_09.txt WA 1 ms 256 KB
1_10.txt WA 2 ms 256 KB
1_11.txt WA 1 ms 256 KB
1_12.txt WA 1 ms 256 KB
1_13.txt WA 1 ms 256 KB
1_14.txt WA 1 ms 256 KB
1_15.txt AC 1 ms 256 KB
1_16.txt WA 1 ms 256 KB
1_17.txt WA 1 ms 256 KB
1_18.txt AC 1 ms 256 KB
1_19.txt AC 1 ms 256 KB
2_00.txt AC 9 ms 1408 KB
2_01.txt AC 9 ms 1536 KB
2_02.txt WA 9 ms 1408 KB
2_03.txt WA 8 ms 1536 KB
2_04.txt WA 9 ms 1408 KB
2_05.txt WA 8 ms 1536 KB
2_06.txt WA 9 ms 1408 KB
2_07.txt WA 8 ms 1536 KB
2_08.txt WA 8 ms 1408 KB
2_09.txt WA 8 ms 1536 KB
2_10.txt WA 10 ms 1408 KB
2_11.txt WA 10 ms 1408 KB
2_12.txt WA 10 ms 1408 KB
2_13.txt WA 10 ms 1408 KB
2_14.txt WA 10 ms 1408 KB
2_15.txt WA 10 ms 1408 KB
2_16.txt WA 10 ms 1408 KB
2_17.txt WA 10 ms 1408 KB
2_18.txt WA 11 ms 1408 KB
2_19.txt WA 11 ms 1536 KB
2_20.txt WA 11 ms 1536 KB
2_21.txt WA 11 ms 1536 KB
2_22.txt WA 11 ms 1408 KB
2_23.txt WA 11 ms 1408 KB
2_24.txt WA 11 ms 1408 KB
2_25.txt WA 11 ms 1408 KB
2_26.txt WA 11 ms 1408 KB
2_27.txt WA 11 ms 1408 KB
2_28.txt WA 11 ms 1408 KB
2_29.txt WA 11 ms 1408 KB
2_30.txt WA 11 ms 1408 KB
2_31.txt AC 11 ms 1408 KB
2_32.txt AC 11 ms 1408 KB
2_33.txt AC 11 ms 1408 KB
2_34.txt WA 11 ms 1408 KB
2_35.txt AC 11 ms 1408 KB
2_36.txt AC 11 ms 1408 KB
2_37.txt AC 11 ms 1408 KB
2_38.txt AC 10 ms 1408 KB
2_39.txt AC 10 ms 1408 KB
2_40.txt AC 10 ms 1408 KB