| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 598337 |
2022-07-18T05:45:02 Z |
8e7 |
Gap (APIO16_gap) |
C++17 |
|
51 ms |
2260 KB |
//Challenge: Accepted
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
while (l != r) cout << *l << " ", l++;
cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 50005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
ll findGap(int T, int N) {
ll ret = 0;
if (T == 1) {
vector<ll> a;
ll low = 0, up = 1e18, vl, vr;
while (low < up) {
MinMax(low, up, &vl, &vr);
if (vl == -1) break;
a.push_back(vl);
a.push_back(vr);
low = vl+1, up = vr-1;
}
sort(a.begin(), a.end());
a.resize(int(unique(a.begin(), a.end()) - a.begin()));
for (int i = 1;i < N;i++) ret = max(ret, a[i] - a[i-1]);
} else {
}
return ret;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
0 ms |
208 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 10 |
Correct |
0 ms |
208 KB |
Output is 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 |
10 ms |
808 KB |
Output isn't correct |
| 17 |
Incorrect |
13 ms |
848 KB |
Output isn't correct |
| 18 |
Incorrect |
11 ms |
832 KB |
Output isn't correct |
| 19 |
Incorrect |
11 ms |
876 KB |
Output isn't correct |
| 20 |
Correct |
10 ms |
848 KB |
Output is correct |
| 21 |
Incorrect |
41 ms |
2212 KB |
Output isn't correct |
| 22 |
Incorrect |
39 ms |
2204 KB |
Output isn't correct |
| 23 |
Incorrect |
43 ms |
2188 KB |
Output isn't correct |
| 24 |
Incorrect |
51 ms |
2260 KB |
Output isn't correct |
| 25 |
Incorrect |
40 ms |
2236 KB |
Output isn't correct |
| 26 |
Incorrect |
40 ms |
2240 KB |
Output isn't correct |
| 27 |
Incorrect |
41 ms |
2212 KB |
Output isn't correct |
| 28 |
Incorrect |
40 ms |
2232 KB |
Output isn't correct |
| 29 |
Incorrect |
47 ms |
2164 KB |
Output isn't correct |
| 30 |
Correct |
35 ms |
2224 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 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
208 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 |
5 ms |
448 KB |
Output isn't correct |
| 17 |
Incorrect |
5 ms |
464 KB |
Output isn't correct |
| 18 |
Incorrect |
5 ms |
464 KB |
Output isn't correct |
| 19 |
Incorrect |
5 ms |
464 KB |
Output isn't correct |
| 20 |
Incorrect |
3 ms |
464 KB |
Output isn't correct |
| 21 |
Incorrect |
24 ms |
980 KB |
Output isn't correct |
| 22 |
Incorrect |
27 ms |
1052 KB |
Output isn't correct |
| 23 |
Incorrect |
27 ms |
1056 KB |
Output isn't correct |
| 24 |
Incorrect |
20 ms |
988 KB |
Output isn't correct |
| 25 |
Incorrect |
13 ms |
1076 KB |
Output isn't correct |
| 26 |
Incorrect |
18 ms |
1044 KB |
Output isn't correct |
| 27 |
Incorrect |
17 ms |
968 KB |
Output isn't correct |
| 28 |
Incorrect |
25 ms |
988 KB |
Output isn't correct |
| 29 |
Incorrect |
19 ms |
968 KB |
Output isn't correct |
| 30 |
Incorrect |
16 ms |
1068 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
