Submission #568648

#TimeUsernameProblemLanguageResultExecution timeMemory
568648DeepessonGap (APIO16_gap)C++17
0 / 100
70 ms8512 KiB
#include <bits/stdc++.h> #include "gap.h" void MinMax(long long, long long, long long*, long long*); using ll = long long; long long findGap(int T, int N) { if(T==2) return 0; else { std::map<ll,bool> mapa; ll l=-1,r=1e18+1; while(l+1<=r-1){ ll a,b; MinMax(l+1,r-1,&a,&b); if(a!=-1){ mapa[a]=true; l=a; } if(b!=-1){ mapa[b]=true; r=b; } if(a==b&&a==-1)break; } ll max=0; std::vector<ll> vec; for(auto&x:mapa)vec.push_back(x.first); for(int i=1;i!=vec.size();++i)max=std::max(max,vec[i]-vec[i-1]); return max; } }

Compilation message (stderr)

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