#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#include "gap.h"
typedef long long ll;
vector<ll> a;
pair<ll,ll> qu(ll l, ll r){
ll mn = 1, mx = 1;
MinMax(l, r, &mn, &mx);
return {mn, mx};
}
long long findGap(int t, int n)
{
auto [l, r] = qu(0, 1e18);
ll len = (r-l) / (n-1);
ll ans = len;
ll pv = l;
while(r-pv > len){
auto [l_, r_] = qu(l, l+len);
if(l_ != -1){
ans = max(ans, l_ - pv);
pv = r_;
}
l += len+1;
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
476 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
16 |
Incorrect |
11 ms |
600 KB |
Output isn't correct |
17 |
Incorrect |
10 ms |
600 KB |
Output isn't correct |
18 |
Incorrect |
9 ms |
604 KB |
Output isn't correct |
19 |
Incorrect |
12 ms |
852 KB |
Output isn't correct |
20 |
Incorrect |
6 ms |
600 KB |
Output isn't correct |
21 |
Incorrect |
36 ms |
1192 KB |
Output isn't correct |
22 |
Incorrect |
34 ms |
1112 KB |
Output isn't correct |
23 |
Incorrect |
36 ms |
1112 KB |
Output isn't correct |
24 |
Incorrect |
36 ms |
1188 KB |
Output isn't correct |
25 |
Incorrect |
33 ms |
1112 KB |
Output isn't correct |
26 |
Incorrect |
36 ms |
1108 KB |
Output isn't correct |
27 |
Incorrect |
36 ms |
1112 KB |
Output isn't correct |
28 |
Incorrect |
37 ms |
1024 KB |
Output isn't correct |
29 |
Incorrect |
40 ms |
1112 KB |
Output isn't correct |
30 |
Incorrect |
21 ms |
1236 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
32 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
596 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
428 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
1 ms |
344 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
8 ms |
600 KB |
Output is correct |
17 |
Correct |
10 ms |
600 KB |
Output is correct |
18 |
Correct |
9 ms |
600 KB |
Output is correct |
19 |
Correct |
8 ms |
600 KB |
Output is correct |
20 |
Correct |
6 ms |
600 KB |
Output is correct |
21 |
Correct |
35 ms |
1112 KB |
Output is correct |
22 |
Correct |
36 ms |
1116 KB |
Output is correct |
23 |
Correct |
36 ms |
1112 KB |
Output is correct |
24 |
Correct |
38 ms |
1112 KB |
Output is correct |
25 |
Correct |
33 ms |
1108 KB |
Output is correct |
26 |
Correct |
34 ms |
1108 KB |
Output is correct |
27 |
Correct |
40 ms |
1112 KB |
Output is correct |
28 |
Correct |
36 ms |
1032 KB |
Output is correct |
29 |
Correct |
35 ms |
1112 KB |
Output is correct |
30 |
Correct |
25 ms |
1112 KB |
Output is correct |
31 |
Correct |
0 ms |
596 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |