| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 95601 |
2019-02-02T06:28:52 Z |
lyc |
Gap (APIO16_gap) |
C++14 |
|
70 ms |
5112 KB |
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll* solve(ll s, ll t, ll* ptr) {
//cout << s << " " << t << endl;
ll mn, mx;
MinMax(s, t, &mn, &mx);
if (mn != -1) {
ll p = rand()%(mx-mn+1) + mn;
//cout << mn << " " << p << " " << mx << endl;
*ptr = mn;
++ptr;
if (mn+1 <= p) {
ptr = solve(mn+1, p, ptr);
}
if (p <= mx-1) {
ptr = solve(p, mx-1, ptr);
}
if (mx != mn) {
*ptr = mx;
++ptr;
}
}
return ptr;
}
long long findGap(int T, int N)
{
ll ans = 0;
ll s, t, mn, mx;
if (T == 1) {
s = 0, t = (ll)1e18;
ll arr[N];
for (int i = 0; i < (N+1)/2; ++i) {
MinMax(s, t, &mn, &mx);
arr[i] = mn;
arr[N-1-i] = mx;
s = mn+1;
t = mx-1;
//cout << "FOUND " << mn << " " << mx << '\n';
}
//for (int i = 0; i < N; ++i) cout << arr[i] << ' ' ;cout << endl;
for (int i = 1; i < N; ++i) {
ans = max(ans, arr[i]-arr[i-1]);
}
}
else {
ll arr[N];
s = 0, t = (ll)1e18;
srand(381257742);
solve(s, t, arr);
for (int i = 1; i < N; ++i) {
ans = max(ans, arr[i]-arr[i-1]);
}
}
return ans;
}
| # |
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 |
376 KB |
Output is correct |
| 4 |
Correct |
3 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
3 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
376 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
2 ms |
376 KB |
Output is correct |
| 16 |
Correct |
13 ms |
764 KB |
Output is correct |
| 17 |
Correct |
12 ms |
732 KB |
Output is correct |
| 18 |
Correct |
12 ms |
760 KB |
Output is correct |
| 19 |
Correct |
12 ms |
732 KB |
Output is correct |
| 20 |
Correct |
9 ms |
760 KB |
Output is correct |
| 21 |
Correct |
47 ms |
1912 KB |
Output is correct |
| 22 |
Correct |
46 ms |
2040 KB |
Output is correct |
| 23 |
Correct |
45 ms |
1912 KB |
Output is correct |
| 24 |
Correct |
47 ms |
1912 KB |
Output is correct |
| 25 |
Correct |
40 ms |
1912 KB |
Output is correct |
| 26 |
Correct |
45 ms |
1912 KB |
Output is correct |
| 27 |
Correct |
46 ms |
1884 KB |
Output is correct |
| 28 |
Correct |
47 ms |
1912 KB |
Output is correct |
| 29 |
Correct |
45 ms |
1912 KB |
Output is correct |
| 30 |
Correct |
34 ms |
1836 KB |
Output is correct |
| 31 |
Correct |
2 ms |
376 KB |
Output is correct |
| 32 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 4 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 5 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 6 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 7 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 8 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 9 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 10 |
Runtime error |
3 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 11 |
Partially correct |
3 ms |
504 KB |
Partially correct |
| 12 |
Partially correct |
3 ms |
376 KB |
Partially correct |
| 13 |
Partially correct |
3 ms |
376 KB |
Partially correct |
| 14 |
Partially correct |
3 ms |
376 KB |
Partially correct |
| 15 |
Partially correct |
3 ms |
376 KB |
Partially correct |
| 16 |
Partially correct |
18 ms |
1528 KB |
Partially correct |
| 17 |
Partially correct |
18 ms |
1528 KB |
Partially correct |
| 18 |
Partially correct |
18 ms |
1528 KB |
Partially correct |
| 19 |
Partially correct |
18 ms |
1528 KB |
Partially correct |
| 20 |
Runtime error |
12 ms |
1272 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 21 |
Incorrect |
68 ms |
4960 KB |
Expected int32, but "2499935465" found |
| 22 |
Incorrect |
66 ms |
5064 KB |
Expected int32, but "2499958296" found |
| 23 |
Incorrect |
67 ms |
5048 KB |
Expected int32, but "2500066148" found |
| 24 |
Incorrect |
70 ms |
5060 KB |
Expected int32, but "2500063177" found |
| 25 |
Partially correct |
55 ms |
1912 KB |
Partially correct |
| 26 |
Incorrect |
69 ms |
5112 KB |
Expected int32, but "2499987327" found |
| 27 |
Incorrect |
66 ms |
5104 KB |
Expected int32, but "2500059154" found |
| 28 |
Incorrect |
68 ms |
5112 KB |
Expected int32, but "2500022685" found |
| 29 |
Incorrect |
67 ms |
5112 KB |
Expected int32, but "2500062048" found |
| 30 |
Runtime error |
41 ms |
3704 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 31 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 32 |
Runtime error |
3 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
