#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
long long findGap(int T, int N)
{
ll l, r, ans = 0, n = N;
MinMax(0, 1e18, &l, &r);
if(T==1){
while(l < r){
if(r==l+1){
ans = max(ans, 1LL);
break;
}
ll nxtl, nxtr;
MinMax(l+1, r-1, &nxtl, &nxtr);
if(nxtl >= 0){
ans = max(ans, nxtl-l);
ans = max(ans, r-nxtr);
}
else{
ans = max(ans, r-l);
}
l = nxtl;
r = nxtr;
}
}
else{
vector<pair<ll, ll>> vec;
ll dist = (r-l-1)/n + !!((r-l-1)%n);
for(ll i = l+1; i < r; i+=dist){
ll rb = min(r-1, i+dist-1);
pair<ll, ll> tmp;
MinMax(i, rb, &tmp.f, &tmp.s);
if(tmp.f >= 0)vec.push_back(tmp);
}
if(vec.empty())ans = r-l;
else{
ans = max(vec[0].f - l, r-vec.back().s);
for(int i = 1; i < vec.size(); i++){
ans = max(ans, vec[i].f - vec[i-1].s);
}
}
}
return ans;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:46:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
46 | for(int i = 1; i < vec.size(); i++){
| ~~^~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Output isn't 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 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 10 |
Correct |
1 ms |
208 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 16 |
Incorrect |
9 ms |
428 KB |
Output isn't correct |
| 17 |
Incorrect |
10 ms |
516 KB |
Output isn't correct |
| 18 |
Incorrect |
11 ms |
464 KB |
Output isn't correct |
| 19 |
Incorrect |
9 ms |
464 KB |
Output isn't correct |
| 20 |
Correct |
7 ms |
420 KB |
Output is correct |
| 21 |
Incorrect |
37 ms |
1056 KB |
Output isn't correct |
| 22 |
Incorrect |
37 ms |
964 KB |
Output isn't correct |
| 23 |
Incorrect |
35 ms |
1056 KB |
Output isn't correct |
| 24 |
Incorrect |
35 ms |
1092 KB |
Output isn't correct |
| 25 |
Incorrect |
33 ms |
1084 KB |
Output isn't correct |
| 26 |
Incorrect |
35 ms |
1064 KB |
Output isn't correct |
| 27 |
Incorrect |
41 ms |
1060 KB |
Output isn't correct |
| 28 |
Incorrect |
35 ms |
1088 KB |
Output isn't correct |
| 29 |
Incorrect |
35 ms |
1032 KB |
Output isn't correct |
| 30 |
Correct |
27 ms |
1096 KB |
Output is correct |
| 31 |
Correct |
1 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 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 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 |
13 ms |
892 KB |
Output is correct |
| 17 |
Correct |
13 ms |
880 KB |
Output is correct |
| 18 |
Correct |
12 ms |
812 KB |
Output is correct |
| 19 |
Correct |
13 ms |
872 KB |
Output is correct |
| 20 |
Correct |
6 ms |
464 KB |
Output is correct |
| 21 |
Correct |
49 ms |
2204 KB |
Output is correct |
| 22 |
Correct |
50 ms |
2160 KB |
Output is correct |
| 23 |
Correct |
51 ms |
2244 KB |
Output is correct |
| 24 |
Correct |
54 ms |
2228 KB |
Output is correct |
| 25 |
Correct |
48 ms |
3228 KB |
Output is correct |
| 26 |
Correct |
54 ms |
2208 KB |
Output is correct |
| 27 |
Correct |
58 ms |
2200 KB |
Output is correct |
| 28 |
Correct |
52 ms |
2208 KB |
Output is correct |
| 29 |
Correct |
54 ms |
2256 KB |
Output is correct |
| 30 |
Correct |
27 ms |
1468 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
1 ms |
208 KB |
Output is correct |
