#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long B[100005];
long long findGap(int T, int N)
{
if(T == 1){
long long ans = 0, mini, maxi;
B[N+1] = (long long)1e18 + 5, B[0] = -1;
int j = N;
for(int i=1;i<=j;i++){
//cout << B[i-1] << " " << B[j+1] << '\n';
MinMax(B[i-1]+1, B[j+1]-1, &mini, &maxi);
//cout << mini << '\n';
B[i] = mini, B[j] = maxi;
//cout << *mini << " " << *maxi << '\n';
j--;
}
for(int i=1;i<N;i++)ans = max(ans, B[i+1] - B[i]);
return ans;
}
else{
long long ans = 0, mini, maxi;
B[N+1] = (long long)1e18 +1;
queue<pair<long long, long long > > q;
q.push({0ll, B[N+1]});
vector<long long>v;
while(!q.empty()){
long long y = q.front().first, z = q.front().second;
q.pop();
if(y > z)continue;
//cout << y << " " << z << '\n';
long long m = (y + z)/2;
MinMax(y, m, &mini, &maxi);
if(mini != -1){
if(mini == maxi)v.push_back(mini);
else q.push({mini-1, maxi-1}), v.push_back(mini), v.push_back(maxi);
}
if(m == z)continue;
MinMax(m+1, z, &mini, &maxi);
if(mini != -1){
if(mini == maxi)v.push_back(mini);
else q.push({mini+1,maxi-1}), v.push_back(mini), v.push_back(maxi);
}
}
sort(v.begin(), v.end());
for(int i=0;i<v.size()-1;i++)ans = max(ans, v[i+1] - v[i]);
return ans;
}
return 0;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:47:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
47 | for(int i=0;i<v.size()-1;i++)ans = max(ans, v[i+1] - v[i]);
| ~^~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
0 ms |
208 KB |
Output is correct |
| 4 |
Correct |
1 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 |
1 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 |
14 ms |
700 KB |
Output is correct |
| 17 |
Correct |
10 ms |
720 KB |
Output is correct |
| 18 |
Correct |
12 ms |
592 KB |
Output is correct |
| 19 |
Correct |
9 ms |
592 KB |
Output is correct |
| 20 |
Correct |
7 ms |
592 KB |
Output is correct |
| 21 |
Correct |
45 ms |
1760 KB |
Output is correct |
| 22 |
Correct |
53 ms |
1836 KB |
Output is correct |
| 23 |
Correct |
45 ms |
1768 KB |
Output is correct |
| 24 |
Correct |
42 ms |
1828 KB |
Output is correct |
| 25 |
Correct |
49 ms |
1832 KB |
Output is correct |
| 26 |
Correct |
40 ms |
1748 KB |
Output is correct |
| 27 |
Correct |
40 ms |
1856 KB |
Output is correct |
| 28 |
Correct |
36 ms |
1792 KB |
Output is correct |
| 29 |
Correct |
59 ms |
1848 KB |
Output is correct |
| 30 |
Correct |
30 ms |
1756 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 |
1 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 |
1 ms |
208 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
336 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 9 |
Partially correct |
1 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 |
18 ms |
844 KB |
Partially correct |
| 17 |
Partially correct |
17 ms |
848 KB |
Partially correct |
| 18 |
Partially correct |
19 ms |
860 KB |
Partially correct |
| 19 |
Partially correct |
17 ms |
848 KB |
Partially correct |
| 20 |
Partially correct |
15 ms |
1100 KB |
Partially correct |
| 21 |
Partially correct |
71 ms |
2300 KB |
Partially correct |
| 22 |
Partially correct |
70 ms |
2320 KB |
Partially correct |
| 23 |
Partially correct |
72 ms |
2348 KB |
Partially correct |
| 24 |
Partially correct |
72 ms |
2336 KB |
Partially correct |
| 25 |
Partially correct |
63 ms |
2368 KB |
Partially correct |
| 26 |
Partially correct |
72 ms |
2332 KB |
Partially correct |
| 27 |
Partially correct |
69 ms |
2332 KB |
Partially correct |
| 28 |
Partially correct |
70 ms |
2332 KB |
Partially correct |
| 29 |
Partially correct |
72 ms |
2364 KB |
Partially correct |
| 30 |
Partially correct |
70 ms |
3444 KB |
Partially correct |
| 31 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 32 |
Partially correct |
0 ms |
336 KB |
Partially correct |
