#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long findGap(int T, int N) //probably again different solution for different test cases :(
{
if(T == 1) {
// cerr << "entered?" << endl;
vector<ll> v(N);
ll mini = -1, maksi = ll(1e18) + 1;
for(int i = 0; i < N; ++i) {
if(i > N - i - 1) break;
++mini, --maksi;
MinMax(mini, maksi, &mini, &maksi);
// cerr << mini << " " << maksi << '\n';
v[i] = mini;
v[N - i - 1] = maksi;
}
ll ans = 0;
for(int i = 1; i < N; ++i) {
ans = max(ans, v[i] - v[i - 1]);
}
return ans;
} else {
ll mini = 0, maksi = ll(1e18);
MinMax(mini, maksi, &mini, &maksi);
ll korak = (maksi - mini + N - 2) / (N - 1);
ll prosli = mini;
ll ans = 0;
ll naj = maksi;
for(ll i = mini + 1; i + korak < naj; i += korak) {
MinMax(i, i + korak, &mini, &maksi);
// cerr << "----------" << endl;
// cerr << i << " " << i + korak << endl;
// cerr << mini << " " << maksi << endl;
// cerr << "----------" << endl;
if(mini != -1) {
ans = max(ans, mini - prosli);
prosli = mini;
}
}
MinMax(maksi-korak, maksi, &mini, &maksi);
if(mini != -1) {
ans = max(ans, mini - prosli);
}
return ans;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 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 |
11 ms |
720 KB |
Output is correct |
| 17 |
Correct |
9 ms |
684 KB |
Output is correct |
| 18 |
Correct |
9 ms |
720 KB |
Output is correct |
| 19 |
Correct |
10 ms |
688 KB |
Output is correct |
| 20 |
Correct |
8 ms |
720 KB |
Output is correct |
| 21 |
Correct |
38 ms |
1864 KB |
Output is correct |
| 22 |
Correct |
40 ms |
1864 KB |
Output is correct |
| 23 |
Correct |
38 ms |
1772 KB |
Output is correct |
| 24 |
Correct |
46 ms |
1836 KB |
Output is correct |
| 25 |
Correct |
35 ms |
1780 KB |
Output is correct |
| 26 |
Correct |
36 ms |
1860 KB |
Output is correct |
| 27 |
Correct |
38 ms |
1872 KB |
Output is correct |
| 28 |
Correct |
36 ms |
1816 KB |
Output is correct |
| 29 |
Correct |
38 ms |
1780 KB |
Output is correct |
| 30 |
Correct |
30 ms |
1872 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 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 4 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Correct |
0 ms |
208 KB |
Output is correct |
| 7 |
Correct |
1 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 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 11 |
Correct |
1 ms |
208 KB |
Output is correct |
| 12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 13 |
Correct |
1 ms |
208 KB |
Output is correct |
| 14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 15 |
Correct |
1 ms |
208 KB |
Output is correct |
| 16 |
Correct |
12 ms |
464 KB |
Output is correct |
| 17 |
Incorrect |
12 ms |
464 KB |
Output isn't correct |
| 18 |
Partially correct |
13 ms |
428 KB |
Partially correct |
| 19 |
Correct |
12 ms |
428 KB |
Output is correct |
| 20 |
Incorrect |
6 ms |
464 KB |
Output isn't correct |
| 21 |
Correct |
58 ms |
1072 KB |
Output is correct |
| 22 |
Correct |
53 ms |
1060 KB |
Output is correct |
| 23 |
Correct |
50 ms |
1064 KB |
Output is correct |
| 24 |
Correct |
50 ms |
1080 KB |
Output is correct |
| 25 |
Correct |
51 ms |
1068 KB |
Output is correct |
| 26 |
Correct |
57 ms |
1064 KB |
Output is correct |
| 27 |
Incorrect |
53 ms |
1028 KB |
Output isn't correct |
| 28 |
Incorrect |
59 ms |
1056 KB |
Output isn't correct |
| 29 |
Correct |
54 ms |
1084 KB |
Output is correct |
| 30 |
Incorrect |
29 ms |
1068 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
