#include <bits/stdc++.h>
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define pll pair<ll,ll>
#define SF(x) scanf("%I64d",&x)
using namespace std;
const long long INF = 2e9;
long long MOD = 1e9+7;
void MinMax(ll ,ll ,ll *,ll *);
long long findGap(int ,int );
ll a[300006];
vector<pll> v[3];
vector<ll> arr;
long long findGap(int t,int n){
if(t==1){
ll l=0,r=1e18;
ll res=0;
ll i=0,j=n-1;
W(i<=j){
MinMax(l,r,&l,&r);
a[i]=l;
a[j]=r;
r--,l++;
i++,j--;
}
for(int i=1;i<n;i++)res=max(res,a[i]-a[i-1]);
R res;
}
else{
v[0].pb({0,1e18});
ll cur=0;
W(!v[cur].empty()){
ll sum=0;
for(int i=0;i<v[cur].SI;i++){
sum+=v[cur][i].S-v[cur][i].F+1;
}
ll len=sum/1000000;
ll i;
ll mx,mn;
W(!v[cur].empty()){
i=v[cur].SI-1;
for(ll j=v[cur][i].F;i<=v[cur][i].S;j+=len){
MinMax(j,min(j+len-1,v[cur][i].S),&mn,&mx);
if(mn==-1)C;
arr.pb(mn);
if(mx!=mn)arr.pb(mx);
if(mn!=mx)v[cur^1].pb({mn+1,mx-1});
}
}
cur^=1;
}
ll res=0;
sort(arr.begin(),arr.end());
for(int i=1;i<arr.SI;i++){
res=max(res,arr[i]-arr[i-1]);
}
R res;
}
}
//int main(){
// cout<<findGap(1,4);
//}
//void MinMax(ll s,ll t,ll *mn,ll *mx){
// cout<<s<<" "<<t<<endl;
// cin>>*mn>>*mx;
//}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:43:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<v[cur].SI;i++){
^
gap.cpp:63:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1;i<arr.SI;i++){
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 2 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 3 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 4 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 5 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 6 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 7 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 8 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 9 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 10 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 11 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 12 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 13 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 14 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 15 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 16 |
Correct |
13 ms |
7492 KB |
Output is correct |
| 17 |
Correct |
13 ms |
7492 KB |
Output is correct |
| 18 |
Correct |
13 ms |
7492 KB |
Output is correct |
| 19 |
Correct |
6 ms |
7492 KB |
Output is correct |
| 20 |
Correct |
6 ms |
7492 KB |
Output is correct |
| 21 |
Correct |
53 ms |
7492 KB |
Output is correct |
| 22 |
Correct |
53 ms |
7492 KB |
Output is correct |
| 23 |
Correct |
59 ms |
7492 KB |
Output is correct |
| 24 |
Correct |
69 ms |
7492 KB |
Output is correct |
| 25 |
Correct |
53 ms |
7492 KB |
Output is correct |
| 26 |
Correct |
56 ms |
7492 KB |
Output is correct |
| 27 |
Correct |
63 ms |
7492 KB |
Output is correct |
| 28 |
Correct |
46 ms |
7492 KB |
Output is correct |
| 29 |
Correct |
56 ms |
7492 KB |
Output is correct |
| 30 |
Correct |
39 ms |
7492 KB |
Output is correct |
| 31 |
Correct |
0 ms |
7492 KB |
Output is correct |
| 32 |
Correct |
0 ms |
7492 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
26 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 2 |
Incorrect |
46 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 3 |
Incorrect |
46 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 4 |
Incorrect |
46 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 5 |
Incorrect |
43 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 6 |
Incorrect |
73 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 7 |
Incorrect |
76 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 8 |
Incorrect |
76 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 9 |
Incorrect |
76 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 10 |
Incorrect |
66 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 11 |
Incorrect |
129 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 12 |
Incorrect |
126 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 13 |
Incorrect |
139 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 14 |
Incorrect |
126 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 15 |
Incorrect |
103 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 16 |
Incorrect |
189 ms |
7968 KB |
Unexpected end of file - int64 expected |
| 17 |
Incorrect |
206 ms |
7968 KB |
Unexpected end of file - int64 expected |
| 18 |
Incorrect |
206 ms |
7968 KB |
Unexpected end of file - int64 expected |
| 19 |
Incorrect |
179 ms |
7968 KB |
Unexpected end of file - int64 expected |
| 20 |
Incorrect |
166 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 21 |
Incorrect |
249 ms |
9132 KB |
Unexpected end of file - int64 expected |
| 22 |
Incorrect |
246 ms |
9132 KB |
Unexpected end of file - int64 expected |
| 23 |
Incorrect |
239 ms |
9132 KB |
Unexpected end of file - int64 expected |
| 24 |
Incorrect |
273 ms |
9132 KB |
Unexpected end of file - int64 expected |
| 25 |
Incorrect |
236 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 26 |
Incorrect |
279 ms |
9132 KB |
Unexpected end of file - int64 expected |
| 27 |
Incorrect |
259 ms |
9132 KB |
Unexpected end of file - int64 expected |
| 28 |
Incorrect |
259 ms |
9132 KB |
Unexpected end of file - int64 expected |
| 29 |
Incorrect |
279 ms |
9132 KB |
Unexpected end of file - int64 expected |
| 30 |
Incorrect |
223 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 31 |
Incorrect |
66 ms |
7492 KB |
Unexpected end of file - int64 expected |
| 32 |
Incorrect |
73 ms |
7492 KB |
Unexpected end of file - int64 expected |
