Submission #1005795

# Submission time Handle Problem Language Result Execution time Memory
1005795 2024-06-23T05:09:00 Z omsincoconut Gap (APIO16_gap) C++17
30 / 100
36 ms 6988 KB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;
typedef long long ll;

ll findGap1(int N) {
	ll l = 1, r = N;
	ll fl = LLONG_MIN, fr = LLONG_MAX;
	ll arr[N+1];
	while (l <= r) {
		ll *q1 = new ll(0), *q2 = new ll(0);
		MinMax(fl, fr, q1, q2);
		arr[l++] = *q1;
		arr[r--] = *q2;
		fl = *q1+1;
		fr = *q2-1;
	}
	ll ans = 0;
	for (ll i = 1; i < N; i++) ans = max(ans, arr[i+1] - arr[i]);
	return ans;
}

ll findGap2(int N) {
	return 0;
}

ll findGap(int T, int N) {
	return T == 1 ? findGap1(N) : findGap1(N);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 0 ms 2488 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2388 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 7 ms 3416 KB Output is correct
17 Correct 7 ms 3416 KB Output is correct
18 Correct 7 ms 3416 KB Output is correct
19 Correct 7 ms 3416 KB Output is correct
20 Correct 6 ms 3416 KB Output is correct
21 Correct 28 ms 6988 KB Output is correct
22 Correct 34 ms 6684 KB Output is correct
23 Correct 28 ms 6640 KB Output is correct
24 Correct 28 ms 6736 KB Output is correct
25 Correct 24 ms 6744 KB Output is correct
26 Correct 27 ms 6624 KB Output is correct
27 Correct 33 ms 6736 KB Output is correct
28 Correct 25 ms 6736 KB Output is correct
29 Correct 33 ms 6736 KB Output is correct
30 Correct 21 ms 6736 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Partially correct 0 ms 2392 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Partially correct 0 ms 2392 KB Partially correct
5 Partially correct 0 ms 2392 KB Partially correct
6 Partially correct 0 ms 2392 KB Partially correct
7 Partially correct 0 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 0 ms 2392 KB Partially correct
10 Partially correct 0 ms 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2640 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 0 ms 2392 KB Partially correct
15 Partially correct 1 ms 2392 KB Partially correct
16 Partially correct 7 ms 3416 KB Partially correct
17 Partially correct 10 ms 3548 KB Partially correct
18 Partially correct 7 ms 3416 KB Partially correct
19 Partially correct 6 ms 3504 KB Partially correct
20 Partially correct 5 ms 3416 KB Partially correct
21 Incorrect 26 ms 6588 KB Expected int32, but "2500100000" found
22 Incorrect 27 ms 6744 KB Expected int32, but "2500100000" found
23 Incorrect 28 ms 6736 KB Expected int32, but "2500100000" found
24 Incorrect 27 ms 6620 KB Expected int32, but "2500100000" found
25 Incorrect 24 ms 6736 KB Expected int32, but "2500100000" found
26 Incorrect 36 ms 6736 KB Expected int32, but "2500100000" found
27 Incorrect 23 ms 6736 KB Expected int32, but "2500100000" found
28 Incorrect 28 ms 6744 KB Expected int32, but "2500100000" found
29 Incorrect 25 ms 6744 KB Expected int32, but "2500100000" found
30 Incorrect 22 ms 6748 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 2392 KB Partially correct
32 Partially correct 1 ms 2392 KB Partially correct