| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 101637 |
2019-03-19T05:46:34 Z |
asifthegreat |
Gap (APIO16_gap) |
C++14 |
|
92 ms |
2456 KB |
#include <bits/stdc++.h>
#include "gap.h"
#define int long long
#define all(a) a.begin(),a.end()
using namespace std;
vector<int>v;
long long findGap(int32_t T,int32_t n)
{
v.clear();
if(T == 1){
//subtask_num = 1;
int s = 0,t = 1000000000000000001,mn,mx,sz = 0;
while(1){
if(sz >= n)break;
MinMax(s,t,&mn,&mx);
v.push_back(mn);
if(mn != mx){v.push_back(mx);sz++;}
s = mn+1;
t = mx-1;
sz++;
}
sort(all(v));
int ans = -1;
for(int i = 1; i < n;i++){
ans = max(ans,v[i]-v[i-1]);
}
return ans;
}
else if(T == 2){
//subtask_num = 2;
int s = 0,t = 1000000000000000001,mn,mx,sz = 0;
while(1){
if(sz >= n)break;
MinMax(s,t,&mn,&mx);
v.push_back(mn);
if(mn != mx){v.push_back(mx);sz++;}
s = mn+1;
t = mx-1;
sz++;
}
sort(all(v));
int ans = -1;
for(int i = 1; i < n;i++){
ans = max(ans,v[i]-v[i-1]);
}
return ans;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
3 ms |
384 KB |
Output is correct |
| 5 |
Correct |
3 ms |
384 KB |
Output is correct |
| 6 |
Correct |
3 ms |
384 KB |
Output is correct |
| 7 |
Correct |
3 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
3 ms |
384 KB |
Output is correct |
| 10 |
Correct |
3 ms |
384 KB |
Output is correct |
| 11 |
Correct |
4 ms |
384 KB |
Output is correct |
| 12 |
Correct |
3 ms |
384 KB |
Output is correct |
| 13 |
Correct |
4 ms |
384 KB |
Output is correct |
| 14 |
Correct |
4 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
512 KB |
Output is correct |
| 16 |
Correct |
19 ms |
896 KB |
Output is correct |
| 17 |
Correct |
16 ms |
896 KB |
Output is correct |
| 18 |
Correct |
15 ms |
996 KB |
Output is correct |
| 19 |
Correct |
17 ms |
896 KB |
Output is correct |
| 20 |
Correct |
12 ms |
896 KB |
Output is correct |
| 21 |
Correct |
55 ms |
2288 KB |
Output is correct |
| 22 |
Correct |
57 ms |
2292 KB |
Output is correct |
| 23 |
Correct |
56 ms |
2324 KB |
Output is correct |
| 24 |
Correct |
61 ms |
2436 KB |
Output is correct |
| 25 |
Correct |
63 ms |
2292 KB |
Output is correct |
| 26 |
Correct |
70 ms |
2456 KB |
Output is correct |
| 27 |
Correct |
57 ms |
2288 KB |
Output is correct |
| 28 |
Correct |
58 ms |
2304 KB |
Output is correct |
| 29 |
Correct |
63 ms |
2416 KB |
Output is correct |
| 30 |
Correct |
51 ms |
2424 KB |
Output is correct |
| 31 |
Correct |
3 ms |
384 KB |
Output is correct |
| 32 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 4 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 5 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 6 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 7 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 8 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 9 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 10 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 11 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 12 |
Partially correct |
4 ms |
384 KB |
Partially correct |
| 13 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 14 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 15 |
Partially correct |
2 ms |
384 KB |
Partially correct |
| 16 |
Partially correct |
14 ms |
896 KB |
Partially correct |
| 17 |
Partially correct |
17 ms |
896 KB |
Partially correct |
| 18 |
Partially correct |
22 ms |
896 KB |
Partially correct |
| 19 |
Partially correct |
17 ms |
944 KB |
Partially correct |
| 20 |
Partially correct |
12 ms |
896 KB |
Partially correct |
| 21 |
Incorrect |
55 ms |
2288 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
57 ms |
2288 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
57 ms |
2384 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
92 ms |
2288 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
52 ms |
2296 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
58 ms |
2364 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
56 ms |
2288 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
56 ms |
2292 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
69 ms |
2416 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
47 ms |
2288 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
3 ms |
384 KB |
Partially correct |
| 32 |
Partially correct |
2 ms |
384 KB |
Partially correct |
