// Be name khoda //
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
const int maxn5 = 5e2 + 5;
const int maxnb = 1e3 + 10;
const int mod = 1e9 + 7;
vector <ll> have;
long long findGap(int T, int N)
{
ll lo = 0, hi = 1e18;
int rem = N;
while(rem > 0 && hi >= lo){
ll mn, mx;
MinMax(lo, hi, &mn, &mx);
//cout << "asking for " << lo << ' ' << hi << ' ' << mn << ' ' << mx << endl;
have.pb(mn);
if(mx != mn)
have.pb(mx);
lo = mn + 1;
hi = mx - 1;
rem -= 2;
}
sort(all(have));
ll ans = 0;
for(int i = 1; i < N; i++)
ans = max(ans, have[i] - have[i - 1]);
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is 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 |
Correct |
0 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
208 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
0 ms |
208 KB |
Output is correct |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
10 ms |
848 KB |
Output is correct |
| 17 |
Correct |
10 ms |
848 KB |
Output is correct |
| 18 |
Correct |
10 ms |
796 KB |
Output is correct |
| 19 |
Correct |
13 ms |
1012 KB |
Output is correct |
| 20 |
Correct |
9 ms |
848 KB |
Output is correct |
| 21 |
Correct |
41 ms |
2204 KB |
Output is correct |
| 22 |
Correct |
40 ms |
2240 KB |
Output is correct |
| 23 |
Correct |
40 ms |
2240 KB |
Output is correct |
| 24 |
Correct |
40 ms |
2244 KB |
Output is correct |
| 25 |
Correct |
35 ms |
2192 KB |
Output is correct |
| 26 |
Correct |
40 ms |
2240 KB |
Output is correct |
| 27 |
Correct |
43 ms |
2204 KB |
Output is correct |
| 28 |
Correct |
40 ms |
2228 KB |
Output is correct |
| 29 |
Correct |
45 ms |
2212 KB |
Output is correct |
| 30 |
Correct |
33 ms |
2232 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 5 |
Partially correct |
1 ms |
208 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 16 |
Partially correct |
12 ms |
808 KB |
Partially correct |
| 17 |
Partially correct |
10 ms |
876 KB |
Partially correct |
| 18 |
Partially correct |
11 ms |
816 KB |
Partially correct |
| 19 |
Partially correct |
10 ms |
848 KB |
Partially correct |
| 20 |
Partially correct |
9 ms |
848 KB |
Partially correct |
| 21 |
Incorrect |
47 ms |
2236 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
38 ms |
2240 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
40 ms |
2200 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
43 ms |
2264 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
37 ms |
2328 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
39 ms |
2212 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
39 ms |
2188 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
40 ms |
2176 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
40 ms |
2180 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
31 ms |
2204 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 32 |
Partially correct |
1 ms |
208 KB |
Partially correct |
