Submission #1005794

# Submission time Handle Problem Language Result Execution time Memory
1005794 2024-06-23T05:08:38 Z omsincoconut Gap (APIO16_gap) C++17
30 / 100
37 ms 6744 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) : findGap2(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 1 ms 2392 KB Output is correct
10 Correct 0 ms 2392 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 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 7 ms 3508 KB Output is correct
17 Correct 9 ms 3416 KB Output is correct
18 Correct 7 ms 3416 KB Output is correct
19 Correct 7 ms 3412 KB Output is correct
20 Correct 6 ms 3420 KB Output is correct
21 Correct 27 ms 6628 KB Output is correct
22 Correct 30 ms 6508 KB Output is correct
23 Correct 34 ms 6736 KB Output is correct
24 Correct 27 ms 6744 KB Output is correct
25 Correct 25 ms 6668 KB Output is correct
26 Correct 27 ms 6744 KB Output is correct
27 Correct 37 ms 6744 KB Output is correct
28 Correct 37 ms 6580 KB Output is correct
29 Correct 27 ms 6744 KB Output is correct
30 Correct 23 ms 6744 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2392 KB Output isn't correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Incorrect 0 ms 2392 KB Output isn't correct
4 Incorrect 0 ms 2392 KB Output isn't correct
5 Incorrect 0 ms 2392 KB Output isn't correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Incorrect 0 ms 2392 KB Output isn't correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Incorrect 0 ms 2392 KB Output isn't correct
10 Incorrect 1 ms 2392 KB Output isn't correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Incorrect 1 ms 2392 KB Output isn't correct
13 Incorrect 0 ms 2392 KB Output isn't correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Incorrect 0 ms 2392 KB Output isn't correct
16 Incorrect 3 ms 2388 KB Output isn't correct
17 Incorrect 4 ms 2392 KB Output isn't correct
18 Incorrect 3 ms 2392 KB Output isn't correct
19 Incorrect 3 ms 2392 KB Output isn't correct
20 Incorrect 2 ms 2392 KB Output isn't correct
21 Incorrect 14 ms 2804 KB Output isn't correct
22 Incorrect 12 ms 2648 KB Output isn't correct
23 Incorrect 12 ms 2648 KB Output isn't correct
24 Incorrect 13 ms 2648 KB Output isn't correct
25 Incorrect 10 ms 2648 KB Output isn't correct
26 Incorrect 12 ms 2648 KB Output isn't correct
27 Incorrect 22 ms 2648 KB Output isn't correct
28 Incorrect 17 ms 2740 KB Output isn't correct
29 Incorrect 14 ms 2648 KB Output isn't correct
30 Incorrect 11 ms 2648 KB Output isn't correct
31 Incorrect 0 ms 2392 KB Output isn't correct
32 Incorrect 0 ms 2392 KB Output isn't correct