#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
#include "gap.h"
using namespace std;
#define ll long long
#define f first
#define endl "\n"
//#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define ll long long
const int mxn=1e5,mod=1000000007,lg=20,root=1000,inf=1e18;
ll v[mxn+10];
ll findGap(int T,int N){
ll mn,mx;
ll ans=1;
ll lmn=1,lmx=1e18;
if(T==1){
ll j=0;
for(ll i=0;i<(N+1)/2;i++){
MinMax(lmn,lmx,&mn,&mx);
if(mn==-1)break;
v[j++]=mn;
v[j++]=mx;
lmn=mn+1;
lmx=mx-1;
}
sort(v,v+N);
for(int i=1;i<N;i++)ans=max(ans,v[i]-v[i-1]);
return ans;
}
MinMax(1,1e18,&mn,&mx);
ans=((mx-mn)/(N-1));//min max gap
ll add=ans+1,cur=mn+1,l,r;
while(cur<mx){
MinMax(cur,(cur+add-1),&l,&r);
if(l!=-1)ans=max(ans,l-cur),cur=r;
cur+=add;
}// 1 2 3 4 5 6 7 8 9 10
return ans;
}
Compilation message
gap.cpp:30:54: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
30 | const int mxn=1e5,mod=1000000007,lg=20,root=1000,inf=1e18;
| ^~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
352 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
8 ms |
648 KB |
Output is correct |
| 17 |
Correct |
8 ms |
644 KB |
Output is correct |
| 18 |
Correct |
8 ms |
652 KB |
Output is correct |
| 19 |
Correct |
8 ms |
1012 KB |
Output is correct |
| 20 |
Correct |
7 ms |
620 KB |
Output is correct |
| 21 |
Correct |
34 ms |
1860 KB |
Output is correct |
| 22 |
Correct |
31 ms |
1984 KB |
Output is correct |
| 23 |
Correct |
31 ms |
1984 KB |
Output is correct |
| 24 |
Correct |
31 ms |
1972 KB |
Output is correct |
| 25 |
Correct |
28 ms |
1956 KB |
Output is correct |
| 26 |
Correct |
30 ms |
1792 KB |
Output is correct |
| 27 |
Correct |
31 ms |
1860 KB |
Output is correct |
| 28 |
Correct |
31 ms |
1980 KB |
Output is correct |
| 29 |
Correct |
37 ms |
1940 KB |
Output is correct |
| 30 |
Correct |
28 ms |
2232 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
592 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
540 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Incorrect |
8 ms |
664 KB |
Output isn't correct |
| 17 |
Incorrect |
8 ms |
644 KB |
Output isn't correct |
| 18 |
Incorrect |
8 ms |
644 KB |
Output isn't correct |
| 19 |
Incorrect |
8 ms |
612 KB |
Output isn't correct |
| 20 |
Incorrect |
5 ms |
620 KB |
Output isn't correct |
| 21 |
Incorrect |
39 ms |
1452 KB |
Output isn't correct |
| 22 |
Incorrect |
33 ms |
1212 KB |
Output isn't correct |
| 23 |
Incorrect |
32 ms |
1236 KB |
Output isn't correct |
| 24 |
Incorrect |
34 ms |
1236 KB |
Output isn't correct |
| 25 |
Correct |
25 ms |
1196 KB |
Output is correct |
| 26 |
Incorrect |
33 ms |
1220 KB |
Output isn't correct |
| 27 |
Incorrect |
37 ms |
1680 KB |
Output isn't correct |
| 28 |
Incorrect |
35 ms |
1204 KB |
Output isn't correct |
| 29 |
Incorrect |
34 ms |
1088 KB |
Output isn't correct |
| 30 |
Incorrect |
19 ms |
1200 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
