#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i<int(b);++i)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define trav(a,c) for(auto a: c)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
void ask(ll l,ll r, ll *mn,ll *mx){
ll ansMn,ansMx;
MinMax(l,r-1,&ansMn,&ansMx);
(*mn) = ansMn;
(*mx) = ansMx;
}
long long findGap(int T, int N) {
ll t = T;
ll n = N;
if(t==1){
vi a;
ll l = 0;
ll r = 1e18+1;
while(true){
ll mn,mx;
ask(l,r,&mn,&mx);
if(mn==-1) break;
l = mn+1;
r = mx;
a.push_back(mn);
if(mn==mx) break;
a.push_back(mx);
}
sort(all(a));
ll mxGap = 0;
rep(i,0,n-1) mxGap = max(mxGap,a[i+1]-a[i]);
return mxGap;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
248 KB |
Output isn't correct |
2 |
Correct |
2 ms |
356 KB |
Output is correct |
3 |
Correct |
3 ms |
392 KB |
Output is correct |
4 |
Correct |
2 ms |
440 KB |
Output is correct |
5 |
Correct |
2 ms |
444 KB |
Output is correct |
6 |
Incorrect |
3 ms |
516 KB |
Output isn't correct |
7 |
Incorrect |
3 ms |
648 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
648 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
648 KB |
Output isn't correct |
10 |
Runtime error |
2 ms |
648 KB |
Execution failed because the return code was nonzero |
11 |
Incorrect |
3 ms |
648 KB |
Output isn't correct |
12 |
Incorrect |
4 ms |
648 KB |
Output isn't correct |
13 |
Incorrect |
5 ms |
648 KB |
Output isn't correct |
14 |
Incorrect |
5 ms |
748 KB |
Output isn't correct |
15 |
Incorrect |
4 ms |
748 KB |
Output isn't correct |
16 |
Incorrect |
19 ms |
1132 KB |
Output isn't correct |
17 |
Incorrect |
24 ms |
1132 KB |
Output isn't correct |
18 |
Incorrect |
23 ms |
1136 KB |
Output isn't correct |
19 |
Incorrect |
21 ms |
1136 KB |
Output isn't correct |
20 |
Runtime error |
21 ms |
1136 KB |
Execution failed because the return code was nonzero |
21 |
Incorrect |
98 ms |
2532 KB |
Output isn't correct |
22 |
Incorrect |
69 ms |
2532 KB |
Output isn't correct |
23 |
Incorrect |
87 ms |
2532 KB |
Output isn't correct |
24 |
Incorrect |
70 ms |
2532 KB |
Output isn't correct |
25 |
Incorrect |
57 ms |
2532 KB |
Output isn't correct |
26 |
Incorrect |
77 ms |
2532 KB |
Output isn't correct |
27 |
Incorrect |
67 ms |
2580 KB |
Output isn't correct |
28 |
Incorrect |
70 ms |
2580 KB |
Output isn't correct |
29 |
Incorrect |
65 ms |
2580 KB |
Output isn't correct |
30 |
Runtime error |
47 ms |
2580 KB |
Execution failed because the return code was nonzero |
31 |
Incorrect |
2 ms |
2580 KB |
Output isn't correct |
32 |
Correct |
3 ms |
2580 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
2580 KB |
Output isn't correct |
2 |
Incorrect |
4 ms |
2580 KB |
Output isn't correct |
3 |
Incorrect |
3 ms |
2580 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
2580 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
2580 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
2580 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
2580 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
2580 KB |
Output isn't correct |
9 |
Incorrect |
4 ms |
2580 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
2580 KB |
Output isn't correct |
11 |
Incorrect |
2 ms |
2580 KB |
Output isn't correct |
12 |
Incorrect |
3 ms |
2580 KB |
Output isn't correct |
13 |
Incorrect |
3 ms |
2580 KB |
Output isn't correct |
14 |
Incorrect |
3 ms |
2580 KB |
Output isn't correct |
15 |
Incorrect |
3 ms |
2580 KB |
Output isn't correct |
16 |
Incorrect |
11 ms |
2580 KB |
Output isn't correct |
17 |
Incorrect |
10 ms |
2580 KB |
Output isn't correct |
18 |
Incorrect |
11 ms |
2580 KB |
Output isn't correct |
19 |
Incorrect |
10 ms |
2580 KB |
Output isn't correct |
20 |
Incorrect |
7 ms |
2580 KB |
Output isn't correct |
21 |
Incorrect |
33 ms |
2580 KB |
Output isn't correct |
22 |
Incorrect |
44 ms |
2580 KB |
Output isn't correct |
23 |
Incorrect |
37 ms |
2580 KB |
Output isn't correct |
24 |
Incorrect |
42 ms |
2580 KB |
Output isn't correct |
25 |
Incorrect |
27 ms |
2580 KB |
Output isn't correct |
26 |
Incorrect |
47 ms |
2580 KB |
Output isn't correct |
27 |
Incorrect |
38 ms |
2580 KB |
Output isn't correct |
28 |
Incorrect |
40 ms |
2580 KB |
Output isn't correct |
29 |
Incorrect |
34 ms |
2580 KB |
Output isn't correct |
30 |
Incorrect |
18 ms |
2580 KB |
Output isn't correct |
31 |
Incorrect |
3 ms |
2580 KB |
Output isn't correct |
32 |
Incorrect |
3 ms |
2580 KB |
Output isn't correct |