#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
ll ans = 0;
int n;
void solve(ll l, ll r, ll ele){
if(r-l <= ans)return;
ll dist = (r-l+ele)/ele;
vector<pair<ll, ll>> A;
for(ll i = l; i <= r; i+=dist){
pair<ll, ll> tmp;
MinMax(i, min(i+dist-1, r), &tmp.f, &tmp.s);
if(tmp.s > 0){
ele -= 1+(tmp.f != tmp.s);
A.push_back(tmp);
}
}
for(int i = 1; i < A.size(); i++){
if(A[i-1].f != -1 && A[i].f != -1)ans = max(ans, A[i].f - A[i-1].s);
}
for(auto v: A)solve(v.f, v.s, ele+1+(v.f != v.s));
}
long long findGap(int T, int N)
{
solve(0, 1e18, N);
return ans;
}
Compilation message
gap.cpp: In function 'void solve(ll, ll, ll)':
gap.cpp:26:22: 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]
26 | for(int i = 1; i < A.size(); i++){
| ~~^~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
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 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
6 |
Incorrect |
1 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 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
336 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 |
336 KB |
Output isn't correct |
16 |
Incorrect |
12 ms |
884 KB |
Output isn't correct |
17 |
Incorrect |
13 ms |
812 KB |
Output isn't correct |
18 |
Incorrect |
15 ms |
792 KB |
Output isn't correct |
19 |
Incorrect |
13 ms |
848 KB |
Output isn't correct |
20 |
Incorrect |
9 ms |
464 KB |
Output isn't correct |
21 |
Incorrect |
61 ms |
2200 KB |
Output isn't correct |
22 |
Incorrect |
60 ms |
2200 KB |
Output isn't correct |
23 |
Incorrect |
60 ms |
2220 KB |
Output isn't correct |
24 |
Incorrect |
56 ms |
2204 KB |
Output isn't correct |
25 |
Incorrect |
62 ms |
3348 KB |
Output isn't correct |
26 |
Incorrect |
54 ms |
2236 KB |
Output isn't correct |
27 |
Incorrect |
52 ms |
2260 KB |
Output isn't correct |
28 |
Incorrect |
58 ms |
2164 KB |
Output isn't correct |
29 |
Incorrect |
59 ms |
2176 KB |
Output isn't correct |
30 |
Incorrect |
42 ms |
1352 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
32 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 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 |
Partially correct |
0 ms |
208 KB |
Partially correct |
6 |
Correct |
0 ms |
208 KB |
Output is correct |
7 |
Correct |
1 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 |
Partially correct |
0 ms |
208 KB |
Partially 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 |
Partially correct |
1 ms |
336 KB |
Partially correct |
16 |
Correct |
14 ms |
880 KB |
Output is correct |
17 |
Correct |
13 ms |
896 KB |
Output is correct |
18 |
Correct |
14 ms |
904 KB |
Output is correct |
19 |
Correct |
12 ms |
824 KB |
Output is correct |
20 |
Partially correct |
9 ms |
464 KB |
Partially correct |
21 |
Correct |
58 ms |
2184 KB |
Output is correct |
22 |
Correct |
51 ms |
2204 KB |
Output is correct |
23 |
Correct |
52 ms |
2224 KB |
Output is correct |
24 |
Correct |
59 ms |
2156 KB |
Output is correct |
25 |
Partially correct |
63 ms |
3188 KB |
Partially correct |
26 |
Correct |
52 ms |
2224 KB |
Output is correct |
27 |
Correct |
51 ms |
2172 KB |
Output is correct |
28 |
Correct |
52 ms |
2204 KB |
Output is correct |
29 |
Correct |
51 ms |
2200 KB |
Output is correct |
30 |
Partially correct |
42 ms |
1468 KB |
Partially correct |
31 |
Correct |
0 ms |
208 KB |
Output is correct |
32 |
Correct |
1 ms |
208 KB |
Output is correct |