Submission #107324

#TimeUsernameProblemLanguageResultExecution timeMemory
107324maruiiGap (APIO16_gap)C++14
0 / 100
93 ms4332 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int T, int N){ long long mn, mx, s=0, e=1e18, ans = 0; if(T==1){ int i=0, j=N-1; vector<long long> vec(N); while(i<j){ MinMax(s, e, &mn, &mx); vec[i++] = mn, vec[j--] = mx; s = mn+1, e = mx-1; } for(int i=1; i<N; ++i) ans = max(ans, abs(vec[i]-vec[i-1])); return ans; } MinMax(0, 1e18, &mn, &mx); s = mn, e = mx; long long d = (e-s)/(N-1)+1; vector<pair<long long, long long> > vec; bool flag = 0; for(int i=1; i<N; ++i){ MinMax(s+(i-1)*d, s+i*d-1, &mn, &mx); if(mn != -1) vec.emplace_back(mn, mx); } if(!flag) return d; for(int i=1; i<vec.size(); ++i) ans = max(ans, vec[i].first - vec[i-1].second); return ans; }

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:28:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i<vec.size(); ++i) ans = max(ans, vec[i].first - vec[i-1].second);
               ~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...