Submission #1018811

# Submission time Handle Problem Language Result Execution time Memory
1018811 2024-07-10T09:57:54 Z coolboy19521 Gap (APIO16_gap) C++17
30 / 100
27 ms 1916 KB
#include "bits/stdc++.h"
#include "gap.h"

using namespace std;

const int sz = 1e5 + 5;

long long a[sz];

long long findGap(int T, int N)
{
	if (1 == T) {
		long long mn, mx;
		MinMax(0, 1e18, &mn, &mx);

		a[1] = mn;
		a[N] = mx;

		for (int i = 1; i <= (N+1)/2-1; i ++) {
			MinMax(mn+1, mx-1, &mn, &mx);
			a[i+1] = mn;
			a[N - i] = mx;
		}

		long long gp = 0;

		for (int i = 1; i <= N-1; i ++)
			gp = max(gp, a[i+1] - a[i]);

		return gp;
	}

	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 6 ms 600 KB Output is correct
17 Correct 7 ms 600 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 7 ms 856 KB Output is correct
20 Correct 9 ms 856 KB Output is correct
21 Correct 27 ms 1872 KB Output is correct
22 Correct 26 ms 1916 KB Output is correct
23 Correct 25 ms 1824 KB Output is correct
24 Correct 26 ms 1880 KB Output is correct
25 Correct 23 ms 1880 KB Output is correct
26 Correct 27 ms 1872 KB Output is correct
27 Correct 27 ms 1872 KB Output is correct
28 Correct 26 ms 1872 KB Output is correct
29 Correct 27 ms 1880 KB Output is correct
30 Correct 23 ms 1908 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Incorrect 0 ms 344 KB Output isn't correct
6 Incorrect 1 ms 344 KB Output isn't correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Incorrect 0 ms 344 KB Output isn't correct
13 Incorrect 0 ms 344 KB Output isn't correct
14 Incorrect 0 ms 596 KB Output isn't correct
15 Incorrect 1 ms 344 KB Output isn't correct
16 Incorrect 3 ms 600 KB Output isn't correct
17 Incorrect 3 ms 600 KB Output isn't correct
18 Incorrect 5 ms 852 KB Output isn't correct
19 Incorrect 3 ms 600 KB Output isn't correct
20 Incorrect 3 ms 600 KB Output isn't correct
21 Incorrect 12 ms 1112 KB Output isn't correct
22 Incorrect 12 ms 1112 KB Output isn't correct
23 Incorrect 14 ms 1032 KB Output isn't correct
24 Incorrect 12 ms 1112 KB Output isn't correct
25 Incorrect 11 ms 1112 KB Output isn't correct
26 Incorrect 12 ms 1112 KB Output isn't correct
27 Incorrect 12 ms 1112 KB Output isn't correct
28 Incorrect 12 ms 1112 KB Output isn't correct
29 Incorrect 14 ms 1112 KB Output isn't correct
30 Incorrect 7 ms 1112 KB Output isn't correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Incorrect 0 ms 344 KB Output isn't correct