| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 108933 |
2019-05-03T04:02:02 Z |
autumn_eel |
Gap (APIO16_gap) |
C++14 |
|
69 ms |
2044 KB |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
#include "gap.h"
ll solve1(int n){
deque<ll>f,r;
while(f.size()+r.size()<n){
ll mn,mx;
ll L=0,R=1e18;
if(!f.empty())L=f.back()+1;
if(!r.empty())R=r.front()-1;
MinMax(L,R,&mn,&mx);
f.push_back(mn);
if(mn!=mx)r.push_front(mx);
}
while(!r.empty()){
f.push_back(r.front());
r.pop_front();
}
ll ans=0;
rep(i,n-1)ans=max(ans,f[i+1]-f[i]);
return ans;
}
ll solve2(int n){
return 0;
}
long long findGap(int T, int N){
if(T==1)return solve1(N);
return solve2(N);
}
Compilation message
gap.cpp: In function 'll solve1(int)':
gap.cpp:11:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(f.size()+r.size()<n){
~~~~~~~~~~~~~~~~~^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
356 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
2 ms |
384 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
3 ms |
384 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
2 ms |
384 KB |
Output is correct |
| 10 |
Correct |
2 ms |
384 KB |
Output is correct |
| 11 |
Correct |
3 ms |
256 KB |
Output is correct |
| 12 |
Correct |
3 ms |
384 KB |
Output is correct |
| 13 |
Correct |
3 ms |
384 KB |
Output is correct |
| 14 |
Correct |
4 ms |
384 KB |
Output is correct |
| 15 |
Correct |
3 ms |
384 KB |
Output is correct |
| 16 |
Correct |
14 ms |
768 KB |
Output is correct |
| 17 |
Correct |
14 ms |
768 KB |
Output is correct |
| 18 |
Correct |
18 ms |
768 KB |
Output is correct |
| 19 |
Correct |
14 ms |
768 KB |
Output is correct |
| 20 |
Correct |
10 ms |
768 KB |
Output is correct |
| 21 |
Correct |
52 ms |
1924 KB |
Output is correct |
| 22 |
Correct |
48 ms |
2040 KB |
Output is correct |
| 23 |
Correct |
49 ms |
2040 KB |
Output is correct |
| 24 |
Correct |
49 ms |
1884 KB |
Output is correct |
| 25 |
Correct |
41 ms |
1932 KB |
Output is correct |
| 26 |
Correct |
55 ms |
2040 KB |
Output is correct |
| 27 |
Correct |
48 ms |
1912 KB |
Output is correct |
| 28 |
Correct |
69 ms |
1980 KB |
Output is correct |
| 29 |
Correct |
66 ms |
1932 KB |
Output is correct |
| 30 |
Correct |
46 ms |
2044 KB |
Output is correct |
| 31 |
Correct |
2 ms |
384 KB |
Output is correct |
| 32 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 6 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 7 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 8 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 9 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 11 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 12 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 13 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 14 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 15 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 16 |
Incorrect |
11 ms |
512 KB |
Output isn't correct |
| 17 |
Incorrect |
9 ms |
512 KB |
Output isn't correct |
| 18 |
Incorrect |
10 ms |
512 KB |
Output isn't correct |
| 19 |
Incorrect |
9 ms |
512 KB |
Output isn't correct |
| 20 |
Incorrect |
7 ms |
512 KB |
Output isn't correct |
| 21 |
Incorrect |
28 ms |
1144 KB |
Output isn't correct |
| 22 |
Incorrect |
26 ms |
1144 KB |
Output isn't correct |
| 23 |
Incorrect |
27 ms |
1196 KB |
Output isn't correct |
| 24 |
Incorrect |
42 ms |
1144 KB |
Output isn't correct |
| 25 |
Incorrect |
22 ms |
1152 KB |
Output isn't correct |
| 26 |
Incorrect |
45 ms |
1144 KB |
Output isn't correct |
| 27 |
Incorrect |
26 ms |
1144 KB |
Output isn't correct |
| 28 |
Incorrect |
31 ms |
1144 KB |
Output isn't correct |
| 29 |
Incorrect |
27 ms |
1144 KB |
Output isn't correct |
| 30 |
Incorrect |
15 ms |
1152 KB |
Output isn't correct |
| 31 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 32 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
