| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 565074 |
2022-05-20T08:41:44 Z |
Spade1 |
Gap (APIO16_gap) |
C++14 |
|
64 ms |
3436 KB |
#include<bits/stdc++.h>
#include "gap.h"
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;
const int NN = 1e5 + 10;
ll mx[NN];
ll mn[NN];
pii ed[NN];
ll findGap(int T, int N) {
ll l, r;
MinMax(0, 1e18, &l, &r);
ll range = r-l+1;
ll sz = ceil(1.0*range/(N+1));
MinMax(l+1, l+sz-1, &mn[1], &mx[1]);
mn[1] = l;
ed[1] = {l, l+sz-1};
if (mx[1] == -1) mx[1] = mn[1];
l += sz;
for (int i = 2; i <= N; ++i) {
MinMax(l, l+sz-1, &mn[i], &mx[i]);
ed[i] = {l, l+sz-1};
l += sz;
}
if (r-1 >= l) {
MinMax(l, r-1, &mn[N+1], &mx[N+1]);
mx[N+1] = r;
if (mn[N+1] == -1) mn[N+1] = mx[N+1];
ed[N+1] = {l, r};
}
ll ans = 0;
for (int i = 2; i <= N; ++i) {
if (mn[i] != 1) continue;
ll cur = ed[i-1].nd - mx[i-1];
while (mn[i] == -1) {
i++;
cur += sz;
}
cur += mn[i+1] - ed[i+1].st;
ans = max(ans, cur);
i--;
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
448 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 16 |
Incorrect |
17 ms |
1044 KB |
Output isn't correct |
| 17 |
Incorrect |
13 ms |
1016 KB |
Output isn't correct |
| 18 |
Incorrect |
17 ms |
972 KB |
Output isn't correct |
| 19 |
Incorrect |
14 ms |
1080 KB |
Output isn't correct |
| 20 |
Incorrect |
7 ms |
1104 KB |
Output isn't correct |
| 21 |
Incorrect |
52 ms |
3408 KB |
Output isn't correct |
| 22 |
Incorrect |
56 ms |
3436 KB |
Output isn't correct |
| 23 |
Incorrect |
57 ms |
3384 KB |
Output isn't correct |
| 24 |
Incorrect |
55 ms |
3304 KB |
Output isn't correct |
| 25 |
Incorrect |
49 ms |
3332 KB |
Output isn't correct |
| 26 |
Incorrect |
54 ms |
3356 KB |
Output isn't correct |
| 27 |
Incorrect |
54 ms |
3412 KB |
Output isn't correct |
| 28 |
Incorrect |
57 ms |
3372 KB |
Output isn't correct |
| 29 |
Incorrect |
64 ms |
3320 KB |
Output isn't correct |
| 30 |
Incorrect |
37 ms |
3376 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
336 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 16 |
Incorrect |
14 ms |
1044 KB |
Output isn't correct |
| 17 |
Incorrect |
16 ms |
1084 KB |
Output isn't correct |
| 18 |
Incorrect |
15 ms |
1032 KB |
Output isn't correct |
| 19 |
Incorrect |
15 ms |
1064 KB |
Output isn't correct |
| 20 |
Incorrect |
7 ms |
1104 KB |
Output isn't correct |
| 21 |
Incorrect |
55 ms |
3336 KB |
Output isn't correct |
| 22 |
Incorrect |
55 ms |
3400 KB |
Output isn't correct |
| 23 |
Incorrect |
52 ms |
3316 KB |
Output isn't correct |
| 24 |
Incorrect |
58 ms |
3348 KB |
Output isn't correct |
| 25 |
Incorrect |
53 ms |
3384 KB |
Output isn't correct |
| 26 |
Incorrect |
57 ms |
3364 KB |
Output isn't correct |
| 27 |
Incorrect |
53 ms |
3372 KB |
Output isn't correct |
| 28 |
Incorrect |
55 ms |
3316 KB |
Output isn't correct |
| 29 |
Incorrect |
58 ms |
3408 KB |
Output isn't correct |
| 30 |
Incorrect |
35 ms |
3328 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
