Submission #1083395

# Submission time Handle Problem Language Result Execution time Memory
1083395 2024-09-03T04:26:09 Z djs100201 Gap (APIO16_gap) C++17
30 / 100
32 ms 2000 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) {
	if (T == 1) {
		vector<ll> res(N);
		ll l = 0, r = 1e18, mn, mx, lidx = 0, ridx = N - 1;
		for (int i = 0; i < (N + 1) / 2; i++) {
			MinMax(l, r, &mn, &mx);
			res[lidx++] = mn, res[ridx--] = mx;
			l = mn + 1, r = mx - 1;
		}

		ll ret = 0;
		for (int i = 1; i < N; i++)
			ret = max(ret, res[i] - res[i - 1]);
		return ret;
	} else {
		ll l = 0, r = 1e18, ret = 0, mn, mx;
		MinMax(l, r, &mn, &mx);
		r = mx;
		ll gap = mx - mn, new_gap = gap / N;
		ll x = mn;
		while (1) {
			MinMax(x + 1, x + new_gap, &mn, &mx);
			if (mn == -1)
				break;
			if (mx == -1) {
				ret = max(ret, mn - x);
				x = mn;
			} else {
				ret = max(ret, mn - x);
				x = mx;
			}
		}
		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 344 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 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 1 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 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 7 ms 856 KB Output is correct
17 Correct 10 ms 660 KB Output is correct
18 Correct 9 ms 660 KB Output is correct
19 Correct 10 ms 856 KB Output is correct
20 Correct 8 ms 600 KB Output is correct
21 Correct 29 ms 1880 KB Output is correct
22 Correct 30 ms 1880 KB Output is correct
23 Correct 32 ms 1972 KB Output is correct
24 Correct 29 ms 1880 KB Output is correct
25 Correct 29 ms 2000 KB Output is correct
26 Correct 29 ms 1880 KB Output is correct
27 Correct 31 ms 1880 KB Output is correct
28 Correct 27 ms 1880 KB Output is correct
29 Correct 30 ms 1880 KB Output is correct
30 Correct 28 ms 1880 KB Output is correct
31 Correct 1 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 356 KB Output isn't correct
3 Incorrect 0 ms 356 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Incorrect 0 ms 340 KB Output isn't correct
6 Incorrect 0 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 0 ms 460 KB Output isn't correct
12 Incorrect 1 ms 344 KB Output isn't correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Incorrect 0 ms 344 KB Output isn't correct
15 Incorrect 0 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 6 ms 520 KB Output isn't correct
19 Incorrect 4 ms 600 KB Output isn't correct
20 Incorrect 2 ms 600 KB Output isn't correct
21 Incorrect 14 ms 1196 KB Output isn't correct
22 Incorrect 14 ms 1112 KB Output isn't correct
23 Incorrect 19 ms 1192 KB Output isn't correct
24 Incorrect 14 ms 1064 KB Output isn't correct
25 Incorrect 14 ms 1216 KB Output isn't correct
26 Incorrect 13 ms 1112 KB Output isn't correct
27 Incorrect 13 ms 1112 KB Output isn't correct
28 Incorrect 24 ms 1112 KB Output isn't correct
29 Incorrect 15 ms 1112 KB Output isn't correct
30 Incorrect 10 ms 1112 KB Output isn't correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Incorrect 1 ms 344 KB Output isn't correct