Submission #23532

#TimeUsernameProblemLanguageResultExecution timeMemory
23532repeatingGap (APIO16_gap)C++11
30 / 100
2000 ms9120 KiB
#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/10000000; 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 (stderr)

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++){
                      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...