| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 579911 |
2022-06-20T08:57:21 Z |
stevancv |
Gap (APIO16_gap) |
C++14 |
|
48 ms |
1884 KB |
#include <bits/stdc++.h>
#include "gap.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e5 + 2;
ll findGap(int t, int n) {
if (t == 1 || t == 2) {
vector<ll> a(n);
ll mn = 0; ll mx = 1e18;
for (int i = 0; i < n; i++) {
if (i > n - i - 1) break;
MinMax(mn, mx, &a[i], &a[n - i - 1]);
mn = a[i] + 1;
mx = a[n - i - 1] - 1;
}
ll ans = 0;
for (int i = 1; i < n; i++) smax(ans, a[i] - a[i - 1]);
return ans;
}
ll mn = 0; ll mx = 1e18;
MinMax(0, 1e18, &mn, &mx);
ll gap = (mx - mn + n - 2) / (n - 1);
while (mn <= mx) {
ll p, q, r, s;
p = q = r = s = 0;
if (mn + gap + 1 > mx - gap - 1) break;
MinMax(mn + gap + 1, mx - gap - 1, &p, &q);
if (p != -1) {
if (mn + 1 <= p - gap - 1) MinMax(mn + 1, p - gap - 1, &r, &s);
if (r != -1) smax(gap, p - r);
else smax(gap, p - mn);
s = -1;
if (q + gap + 1 <= mx - 1) MinMax(q + gap + 1, mx - 1, &r, &s);
if (s != -1) smax(gap, s - q);
else smax(gap, mx - q);
mn = p;
mx = q;
}
else {
MinMax(mn + 1, mn + gap, &p, &q);
MinMax(mx - gap, mx - 1, &r, &s);
if (q != -1) smax(mn, q);
if (r != -1) smin(mx, r);
smax(gap, mx - mn);
break;
}
}
return gap;
}
| # |
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 |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Correct |
1 ms |
208 KB |
Output is correct |
| 6 |
Correct |
1 ms |
208 KB |
Output is correct |
| 7 |
Correct |
1 ms |
208 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
0 ms |
208 KB |
Output is correct |
| 10 |
Correct |
1 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 |
10 ms |
680 KB |
Output is correct |
| 17 |
Correct |
14 ms |
692 KB |
Output is correct |
| 18 |
Correct |
10 ms |
720 KB |
Output is correct |
| 19 |
Correct |
9 ms |
720 KB |
Output is correct |
| 20 |
Correct |
8 ms |
720 KB |
Output is correct |
| 21 |
Correct |
45 ms |
1772 KB |
Output is correct |
| 22 |
Correct |
36 ms |
1828 KB |
Output is correct |
| 23 |
Correct |
42 ms |
1760 KB |
Output is correct |
| 24 |
Correct |
40 ms |
1824 KB |
Output is correct |
| 25 |
Correct |
35 ms |
1828 KB |
Output is correct |
| 26 |
Correct |
38 ms |
1832 KB |
Output is correct |
| 27 |
Correct |
38 ms |
1812 KB |
Output is correct |
| 28 |
Correct |
37 ms |
1864 KB |
Output is correct |
| 29 |
Correct |
48 ms |
1884 KB |
Output is correct |
| 30 |
Correct |
33 ms |
1820 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 |
1 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 |
Partially correct |
1 ms |
208 KB |
Partially correct |
| 5 |
Partially correct |
1 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 |
1 ms |
208 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
208 KB |
Partially 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 |
9 ms |
632 KB |
Partially correct |
| 17 |
Partially correct |
10 ms |
720 KB |
Partially correct |
| 18 |
Partially correct |
10 ms |
720 KB |
Partially correct |
| 19 |
Partially correct |
10 ms |
592 KB |
Partially correct |
| 20 |
Partially correct |
8 ms |
720 KB |
Partially correct |
| 21 |
Incorrect |
41 ms |
1820 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
37 ms |
1864 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
39 ms |
1824 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
40 ms |
1828 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
36 ms |
1828 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
38 ms |
1776 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
44 ms |
1824 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
43 ms |
1824 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
39 ms |
1880 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
33 ms |
1864 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 32 |
Partially correct |
1 ms |
208 KB |
Partially correct |
