Submission #1083350

# Submission time Handle Problem Language Result Execution time Memory
1083350 2024-09-03T02:38:00 Z djs100201 Gap (APIO16_gap) C++17
0 / 100
36 ms 1880 KB
#include "gap.h"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ = 2e5 + 10, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353;
ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k;
ll findGap(int T, int N) {
	vector<ll> res(N);
	ll l = 0, r = 1e18, mn, mx;
	ll lidx = 0, ridx = N - 1;
	while (lidx <= ridx) {

		if (lidx == ridx) {
			MinMax(l + 1, (ll)1e18, &mn, &mx);
			res[lidx] = mn;
			break;
		}

		MinMax(l + 1, r - 1, &mn, &mx);
		res[lidx++] = mn, res[ridx--] = mx;
		l = res[lidx - 1], r = res[ridx + 1];
	}

	ll ret = 0;
	for (int i = 1; i < N; i++)
		ret = max(ret, res[i] - res[i - 1]);
	return ret;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 388 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 1 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 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 7 ms 708 KB Output is correct
17 Correct 7 ms 660 KB Output is correct
18 Correct 6 ms 660 KB Output is correct
19 Correct 9 ms 856 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 25 ms 1804 KB Output is correct
22 Correct 36 ms 1880 KB Output is correct
23 Correct 26 ms 1880 KB Output is correct
24 Correct 26 ms 1880 KB Output is correct
25 Correct 29 ms 1880 KB Output is correct
26 Correct 28 ms 1880 KB Output is correct
27 Correct 26 ms 1880 KB Output is correct
28 Correct 25 ms 1880 KB Output is correct
29 Correct 25 ms 1880 KB Output is correct
30 Correct 21 ms 1880 KB Output is correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 356 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 0 ms 344 KB Partially correct
9 Partially correct 0 ms 344 KB Partially correct
10 Partially correct 0 ms 344 KB Partially correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 0 ms 344 KB Partially correct
16 Partially correct 8 ms 660 KB Partially correct
17 Partially correct 9 ms 660 KB Partially correct
18 Partially correct 8 ms 796 KB Partially correct
19 Partially correct 7 ms 660 KB Partially correct
20 Partially correct 5 ms 736 KB Partially correct
21 Incorrect 26 ms 1880 KB Expected int32, but "2500100000" found
22 Incorrect 26 ms 1880 KB Expected int32, but "2500100000" found
23 Incorrect 31 ms 1880 KB Expected int32, but "2500100000" found
24 Incorrect 27 ms 1880 KB Expected int32, but "2500100000" found
25 Incorrect 23 ms 1880 KB Expected int32, but "2500100000" found
26 Incorrect 25 ms 1880 KB Expected int32, but "2500100000" found
27 Incorrect 27 ms 1880 KB Expected int32, but "2500100000" found
28 Incorrect 34 ms 1872 KB Expected int32, but "2500100000" found
29 Incorrect 25 ms 1880 KB Expected int32, but "2500100000" found
30 Incorrect 21 ms 1876 KB Expected int32, but "2500100000" found
31 Incorrect 0 ms 344 KB Output isn't correct
32 Partially correct 0 ms 344 KB Partially correct