#include "gap.h"
#include <algorithm>
using namespace std;
typedef long long llong;
int n;
const llong m = 1e18;
pair<llong, llong> ps[200000];
llong divpro(llong s, llong t) {
if (n == 0) return t - s;
llong ret = 0;
llong q = (t - s - 1) / n;
llong r = (t - s - 1) - q * n;
llong pree = s;
for (int i = 0, j = s; i < n; ++i) {
llong dis = q + (i < r);
MinMax(j + 1, j + dis, &ps[i].first, &ps[i].second);
j += dis;
if (ps[i].first == -1) continue;
ret = max(ret, ps[i].first - pree);
pree = ps[i].second;
}
return max(ret, t - pree);
}
long long findGap(int T, int N)
{
n = N;
llong s, t;
MinMax(0, m, &s, &t);
n -= 2;
if (T == 1) {
llong ret = 0;
llong i = s, j = t;
while (n > 0) {
MinMax(i + 1, j - 1, &i, &j);
n -= 2;
ret = max(ret, max(t - j, i - s));
s = i; t = j;
}
return ret;
}
else {
return divpro(s, t);
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 2 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 3 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 4 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 5 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 6 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 7 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 8 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 9 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 10 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 11 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 12 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 13 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 14 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 15 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 16 |
Correct |
13 ms |
7360 KB |
Output is correct |
| 17 |
Correct |
13 ms |
7360 KB |
Output is correct |
| 18 |
Correct |
16 ms |
7360 KB |
Output is correct |
| 19 |
Correct |
16 ms |
7360 KB |
Output is correct |
| 20 |
Correct |
6 ms |
7360 KB |
Output is correct |
| 21 |
Correct |
56 ms |
7360 KB |
Output is correct |
| 22 |
Correct |
53 ms |
7360 KB |
Output is correct |
| 23 |
Correct |
59 ms |
7360 KB |
Output is correct |
| 24 |
Correct |
59 ms |
7360 KB |
Output is correct |
| 25 |
Correct |
46 ms |
7360 KB |
Output is correct |
| 26 |
Correct |
59 ms |
7360 KB |
Output is correct |
| 27 |
Correct |
66 ms |
7360 KB |
Output is correct |
| 28 |
Correct |
56 ms |
7360 KB |
Output is correct |
| 29 |
Correct |
56 ms |
7360 KB |
Output is correct |
| 30 |
Correct |
43 ms |
7360 KB |
Output is correct |
| 31 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 32 |
Correct |
0 ms |
7360 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 10 |
Correct |
0 ms |
7360 KB |
Output is correct |
| 11 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 12 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 13 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 14 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 15 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 16 |
Incorrect |
13 ms |
7360 KB |
Output isn't correct |
| 17 |
Incorrect |
9 ms |
7360 KB |
Output isn't correct |
| 18 |
Incorrect |
13 ms |
7360 KB |
Output isn't correct |
| 19 |
Incorrect |
13 ms |
7360 KB |
Output isn't correct |
| 20 |
Correct |
9 ms |
7360 KB |
Output is correct |
| 21 |
Incorrect |
59 ms |
7360 KB |
Output isn't correct |
| 22 |
Incorrect |
56 ms |
7360 KB |
Output isn't correct |
| 23 |
Incorrect |
53 ms |
7360 KB |
Output isn't correct |
| 24 |
Incorrect |
69 ms |
7360 KB |
Output isn't correct |
| 25 |
Incorrect |
43 ms |
7360 KB |
Output isn't correct |
| 26 |
Incorrect |
49 ms |
7360 KB |
Output isn't correct |
| 27 |
Incorrect |
49 ms |
7360 KB |
Output isn't correct |
| 28 |
Incorrect |
43 ms |
7360 KB |
Output isn't correct |
| 29 |
Incorrect |
49 ms |
7360 KB |
Output isn't correct |
| 30 |
Correct |
36 ms |
7360 KB |
Output is correct |
| 31 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
7360 KB |
Output isn't correct |
