Submission #838580

# Submission time Handle Problem Language Result Execution time Memory
838580 2023-08-27T12:10:34 Z tch1cherin Gap (APIO16_gap) C++17
77.599 / 100
51 ms 3052 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

long long findGap(int T, int N) {
	if (T == 1) {
		long long Min = -1, Max = 1e18l + 1;
		vector<long long> front, back;
		for (int i = 0; i < (N + 1) / 2; i++) {
			MinMax(Min + 1, Max - 1, &Min, &Max);
			if (Min != Max) {
				front.push_back(Min);
			}
			back.push_back(Max);
		}
		reverse(back.begin(), back.end());
		vector<long long> A;
		for (auto v : front) {
			A.push_back(v);
		}
		for (auto v : back) {
			A.push_back(v);
		}
		long long gap = 0;
		for (int i = 0; i < N - 1; i++) {
			gap = max(gap, A[i + 1] - A[i]);
		}
		return gap;
	} else {
		long long Min, Max;
		MinMax(0, 1e18, &Min, &Max);
		queue<pair<long long, long long>> Q;
		Q.push({Min, Max});
		long long maxConfirmed = (Max - Min + N - 2) / (N - 1);
		uniform_real_distribution<long double> dist(0, 1);
		mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
		while (!Q.empty()) {
			auto [l, r] = Q.front();
			Q.pop();
			if (r - l <= maxConfirmed) {
				continue;
			}
			long long Minl = -1, Maxl = -1, Minr = -1, Maxr = -1;
			int children = max(2, min((N + 1) / 2 + 1, (int)sqrt(N)));
			for (int i = 0; i < children; i++) {
				long long start = min(r, (long long)floorl(l + (r - l + 1) * ((1.0l / children) * i)));
				long long end = min(r, (long long)floorl(l + (r - l + 1) * ((1.0l / children) * (i + 1))) - 1);
				if (start > end) {
					continue;
				}
				MinMax(start, end, &Minr, &Maxr);
				if (Minr != -1) {
					if (Maxl != -1) { 
						maxConfirmed = max(maxConfirmed, Minr - Maxl);
					}
					Minl = Minr;
					Maxl = Maxr;
					Q.push({Minr, Maxr});
				}
			}
		}
		return maxConfirmed;
	}
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:43:14: warning: variable 'Minl' set but not used [-Wunused-but-set-variable]
   43 |    long long Minl = -1, Maxl = -1, Minr = -1, Maxr = -1;
      |              ^~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 8 ms 1168 KB Output is correct
17 Correct 9 ms 1144 KB Output is correct
18 Correct 9 ms 1144 KB Output is correct
19 Correct 9 ms 1132 KB Output is correct
20 Correct 6 ms 1104 KB Output is correct
21 Correct 30 ms 3052 KB Output is correct
22 Correct 30 ms 2980 KB Output is correct
23 Correct 30 ms 2980 KB Output is correct
24 Correct 31 ms 3016 KB Output is correct
25 Correct 26 ms 3052 KB Output is correct
26 Correct 31 ms 2964 KB Output is correct
27 Correct 30 ms 3012 KB Output is correct
28 Correct 34 ms 2972 KB Output is correct
29 Correct 29 ms 3020 KB Output is correct
30 Correct 30 ms 2976 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Partially correct 0 ms 208 KB Partially correct
3 Partially correct 0 ms 208 KB Partially correct
4 Correct 0 ms 208 KB Output is correct
5 Partially correct 0 ms 208 KB Partially correct
6 Partially correct 0 ms 208 KB Partially correct
7 Partially correct 0 ms 208 KB Partially correct
8 Partially correct 0 ms 208 KB Partially correct
9 Partially correct 0 ms 208 KB Partially correct
10 Correct 0 ms 208 KB Output is correct
11 Partially correct 1 ms 336 KB Partially correct
12 Partially correct 1 ms 336 KB Partially correct
13 Partially correct 1 ms 336 KB Partially correct
14 Partially correct 1 ms 336 KB Partially correct
15 Partially correct 1 ms 336 KB Partially correct
16 Partially correct 12 ms 720 KB Partially correct
17 Partially correct 12 ms 848 KB Partially correct
18 Partially correct 14 ms 720 KB Partially correct
19 Partially correct 13 ms 720 KB Partially correct
20 Correct 3 ms 400 KB Output is correct
21 Partially correct 49 ms 2056 KB Partially correct
22 Partially correct 50 ms 2120 KB Partially correct
23 Partially correct 51 ms 2092 KB Partially correct
24 Partially correct 49 ms 2044 KB Partially correct
25 Partially correct 47 ms 2636 KB Partially correct
26 Partially correct 51 ms 2060 KB Partially correct
27 Partially correct 50 ms 2204 KB Partially correct
28 Partially correct 49 ms 2064 KB Partially correct
29 Partially correct 51 ms 2028 KB Partially correct
30 Correct 8 ms 1008 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct