Submission #23298

#TimeUsernameProblemLanguageResultExecution timeMemory
23298repeatingGap (APIO16_gap)C++11
30 / 100
2000 ms524288 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]; 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{ vector<ll> arr; vector<pll> v[3]; v[0].pb({0,1e18}); ll x,y; ll cur=0; W(arr.SI!=n){ ll sum; for(int i=0;i<v[cur].SI;i++){ sum+=v[cur][i].S-v[cur][i].F+1; } ll len=sum/10000000; ll lef; for(int i=0;i<v[cur].SI;i++){ lef=v[cur][i].F; W(lef<=v[cur][i].S){ MinMax(lef,min(lef+len,v[cur][i].S),&x,&y); if(x==-1)C; arr.pb(x); if(x!=y)arr.pb(y); x++,y--; if(x<=y)v[cur^1].pb({x,y}); } } v[cur].clear(); cur^=1; } sort(arr.begin(),arr.end()); ll res=0; for(int i=1;i<n;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:42:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         W(arr.SI!=n){
                 ^
gap.cpp:44:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0;i<v[cur].SI;i++){
                          ^
gap.cpp:49:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0;i<v[cur].SI;i++){
                          ^
gap.cpp:45:47: warning: 'sum' may be used uninitialized in this function [-Wmaybe-uninitialized]
                 sum+=v[cur][i].S-v[cur][i].F+1;
                                               ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...