Submission #495023

#TimeUsernameProblemLanguageResultExecution timeMemory
495023jamezzzGap (APIO16_gap)C++17
89.04 / 100
59 ms3216 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll a[100005]; vector<ll> v; ll findGap(int T,int N){ if(T==1){ int l=0,r=N-1;ll cl=0,cr=1e18,mn,mx; while(l<=r){ MinMax(cl,cr,&mn,&mx); a[l]=mn,a[r]=mx,cl=mn+1,cr=mx-1,++l,--r; } ll ans=0; for(int i=1;i<N;++i)ans=max(ans,a[i]-a[i-1]); return ans; } else{ ll mn,mx,x,y; MinMax(0,1e18,&mn,&mx); x=mn+1,y=mx-1; ll l=(y-x+1)/(N-1); v.push_back(x-1); for(ll i=x;i<=y;i+=l){ MinMax(i,min(y,i+l-1),&mn,&mx); if(mn!=-1)v.push_back(mn); if(mx!=-1)v.push_back(mx); } v.push_back(y+1); ll ans=0; for(int i=1;i<v.size();++i)ans=max(ans,v[i]-v[i-1]); return ans; } }

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:37:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for(int i=1;i<v.size();++i)ans=max(ans,v[i]-v[i-1]);
      |              ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...