Submission #1386381


Source Code Expand

#include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>

using namespace std;

#define Set(a, b) memset(a, b, sizeof a)

typedef long long LL;

const LL Inf = LONG_LONG_MAX / 2;
const int N = 1e5 + 10;

int n, e, t;
LL f[N], p[N];

int main() {

	scanf("%d %d %d", &n, &e, &t);
	for (int i = 1; i <= n; ++i) 
		scanf("%lld", &p[i]);
	Set(f, 60);
	f[0] = 0;
	LL mn = Inf;
	for (int i = 1, j = 0; i <= n; ++i) {
		for (; t <= 2 * (p[i] - p[j + 1]); ++j) 
			mn = min(mn, f[j] - 2 * p[j + 1]);
		if (j < i)
			f[i] = min(f[i], f[j] + t);
		f[i] = min(f[i], mn + 2 * p[i]);
	}
	printf("%lld\n", e + f[n]);

	return 0;
}

Submission Info

Submission Time
Task D - Shik and Game
User vjudge1
Language C++14 (GCC 5.4.1)
Score 1200
Code Size 657 Byte
Status AC
Exec Time 14 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &e, &t);
                               ^
./Main.cpp:23:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &p[i]);
                       ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 600 / 600 600 / 600
Status
AC × 3
AC × 23
AC × 64
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 1024 KB
0_01.txt AC 1 ms 1024 KB
0_02.txt AC 1 ms 1024 KB
1_00.txt AC 2 ms 1024 KB
1_01.txt AC 2 ms 1024 KB
1_02.txt AC 2 ms 1024 KB
1_03.txt AC 2 ms 1024 KB
1_04.txt AC 2 ms 1024 KB
1_05.txt AC 2 ms 1024 KB
1_06.txt AC 2 ms 1024 KB
1_07.txt AC 2 ms 1024 KB
1_08.txt AC 2 ms 1024 KB
1_09.txt AC 2 ms 1024 KB
1_10.txt AC 2 ms 1024 KB
1_11.txt AC 2 ms 1024 KB
1_12.txt AC 2 ms 1024 KB
1_13.txt AC 2 ms 1024 KB
1_14.txt AC 2 ms 1024 KB
1_15.txt AC 2 ms 1024 KB
1_16.txt AC 2 ms 1024 KB
1_17.txt AC 2 ms 1024 KB
1_18.txt AC 2 ms 1024 KB
1_19.txt AC 2 ms 1024 KB
2_00.txt AC 12 ms 1792 KB
2_01.txt AC 12 ms 1792 KB
2_02.txt AC 12 ms 1792 KB
2_03.txt AC 12 ms 1792 KB
2_04.txt AC 12 ms 1792 KB
2_05.txt AC 12 ms 1792 KB
2_06.txt AC 12 ms 1792 KB
2_07.txt AC 12 ms 1792 KB
2_08.txt AC 12 ms 1792 KB
2_09.txt AC 12 ms 1792 KB
2_10.txt AC 13 ms 1792 KB
2_11.txt AC 13 ms 1792 KB
2_12.txt AC 13 ms 1792 KB
2_13.txt AC 13 ms 1792 KB
2_14.txt AC 13 ms 1792 KB
2_15.txt AC 13 ms 1792 KB
2_16.txt AC 13 ms 1792 KB
2_17.txt AC 13 ms 1792 KB
2_18.txt AC 13 ms 1792 KB
2_19.txt AC 14 ms 1792 KB
2_20.txt AC 14 ms 1792 KB
2_21.txt AC 14 ms 1792 KB
2_22.txt AC 14 ms 1792 KB
2_23.txt AC 14 ms 1792 KB
2_24.txt AC 14 ms 1792 KB
2_25.txt AC 14 ms 1792 KB
2_26.txt AC 14 ms 1792 KB
2_27.txt AC 14 ms 1792 KB
2_28.txt AC 14 ms 1792 KB
2_29.txt AC 14 ms 1792 KB
2_30.txt AC 14 ms 1792 KB
2_31.txt AC 14 ms 1792 KB
2_32.txt AC 14 ms 1792 KB
2_33.txt AC 14 ms 1792 KB
2_34.txt AC 14 ms 1792 KB
2_35.txt AC 14 ms 1792 KB
2_36.txt AC 14 ms 1792 KB
2_37.txt AC 14 ms 1792 KB
2_38.txt AC 14 ms 1792 KB
2_39.txt AC 14 ms 1792 KB
2_40.txt AC 14 ms 1792 KB