| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 47660 |
2018-05-06T07:50:08 Z |
E869120 |
Gap (APIO16_gap) |
C++14 |
|
172 ms |
2300 KB |
#include "gap.h"
#include <algorithm>
#include <iostream>
using namespace std;
long long a[100009]; int res = 0;
void saiki(long long L, long long R) {
if (L >= R) return;
long long s, t;
MinMax(L, R - 1, &s, &t);
if (s == -1) return;
if (s == t) { res++; a[res] = s; return; }
res++; a[res] = s;
s++; t++;
long long B[31], LL = t - s, V = 8;
for (int i = 0; i <= V; i++) {
long double E = 1.0L*LL*i / (1.0L*V);
B[i] = (long long)(1.0L*E);
}
B[V] = LL;
for (int i = 0; i < V; i++) saiki(s + B[i], s + B[i + 1]);
}
long long findGap(int T, int N)
{
if (T == 1) {
long long L = 0, R = 1000000000000000000LL, s, t, cnt = 0;
while (cnt < (N + 1) / 2) {
MinMax(L, R, &s, &t);
L = s; R = t;
if (L != -1) { a[cnt + 1] = L; a[N - cnt] = R; }
cnt++; L++; R--;
}
long long maxn = 0;
for (int i = 1; i <= N - 1; i++) maxn = max(maxn, a[i + 1] - a[i]);
return maxn;
}
if (T == 2) {
saiki(0LL, 1000000000000000001LL);
long long maxn = 0;
for (int i = 1; i <= N - 1; i++) maxn = max(maxn, a[i + 1] - a[i]);
return maxn;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
428 KB |
Output is correct |
| 4 |
Correct |
2 ms |
428 KB |
Output is correct |
| 5 |
Correct |
2 ms |
480 KB |
Output is correct |
| 6 |
Correct |
2 ms |
484 KB |
Output is correct |
| 7 |
Correct |
2 ms |
484 KB |
Output is correct |
| 8 |
Correct |
2 ms |
484 KB |
Output is correct |
| 9 |
Correct |
2 ms |
484 KB |
Output is correct |
| 10 |
Correct |
2 ms |
512 KB |
Output is correct |
| 11 |
Correct |
3 ms |
512 KB |
Output is correct |
| 12 |
Correct |
2 ms |
512 KB |
Output is correct |
| 13 |
Correct |
2 ms |
512 KB |
Output is correct |
| 14 |
Correct |
3 ms |
512 KB |
Output is correct |
| 15 |
Correct |
2 ms |
564 KB |
Output is correct |
| 16 |
Correct |
15 ms |
1076 KB |
Output is correct |
| 17 |
Correct |
15 ms |
1076 KB |
Output is correct |
| 18 |
Correct |
15 ms |
1076 KB |
Output is correct |
| 19 |
Correct |
15 ms |
1076 KB |
Output is correct |
| 20 |
Correct |
12 ms |
1076 KB |
Output is correct |
| 21 |
Correct |
57 ms |
2108 KB |
Output is correct |
| 22 |
Correct |
59 ms |
2108 KB |
Output is correct |
| 23 |
Correct |
57 ms |
2112 KB |
Output is correct |
| 24 |
Correct |
58 ms |
2112 KB |
Output is correct |
| 25 |
Correct |
50 ms |
2112 KB |
Output is correct |
| 26 |
Correct |
58 ms |
2112 KB |
Output is correct |
| 27 |
Correct |
59 ms |
2112 KB |
Output is correct |
| 28 |
Correct |
58 ms |
2112 KB |
Output is correct |
| 29 |
Correct |
56 ms |
2112 KB |
Output is correct |
| 30 |
Correct |
44 ms |
2136 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2136 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2136 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 2 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 4 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 5 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 6 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 7 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 8 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 9 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 10 |
Partially correct |
2 ms |
2136 KB |
Partially correct |
| 11 |
Partially correct |
4 ms |
2136 KB |
Partially correct |
| 12 |
Partially correct |
3 ms |
2136 KB |
Partially correct |
| 13 |
Partially correct |
5 ms |
2136 KB |
Partially correct |
| 14 |
Partially correct |
3 ms |
2136 KB |
Partially correct |
| 15 |
Partially correct |
4 ms |
2136 KB |
Partially correct |
| 16 |
Partially correct |
34 ms |
2136 KB |
Partially correct |
| 17 |
Partially correct |
32 ms |
2136 KB |
Partially correct |
| 18 |
Partially correct |
41 ms |
2136 KB |
Partially correct |
| 19 |
Partially correct |
45 ms |
2136 KB |
Partially correct |
| 20 |
Partially correct |
25 ms |
2136 KB |
Partially correct |
| 21 |
Partially correct |
172 ms |
2172 KB |
Partially correct |
| 22 |
Partially correct |
135 ms |
2172 KB |
Partially correct |
| 23 |
Partially correct |
138 ms |
2172 KB |
Partially correct |
| 24 |
Partially correct |
146 ms |
2172 KB |
Partially correct |
| 25 |
Partially correct |
126 ms |
2172 KB |
Partially correct |
| 26 |
Partially correct |
138 ms |
2300 KB |
Partially correct |
| 27 |
Partially correct |
139 ms |
2300 KB |
Partially correct |
| 28 |
Partially correct |
134 ms |
2300 KB |
Partially correct |
| 29 |
Partially correct |
141 ms |
2300 KB |
Partially correct |
| 30 |
Partially correct |
70 ms |
2300 KB |
Partially correct |
| 31 |
Partially correct |
2 ms |
2300 KB |
Partially correct |
| 32 |
Partially correct |
2 ms |
2300 KB |
Partially correct |
