Submission #962674

#TimeUsernameProblemLanguageResultExecution timeMemory
962674WarinchaiLongest Trip (IOI23_longesttrip)C++17
15 / 100
43 ms696 KiB
#include "longesttrip.h" #include<bits/stdc++.h> using namespace std; vector<int>longest_trip_3(int N){ vector<int>ans; for(int i=0;i<N;i++)ans.push_back(i); return ans; } vector<int>longest_trip_2(int N){ vector<int>ans; vector<int>tans; tans.push_back(0); for(int i=1;i<N;i++){ if(are_connected({i-1},{i}))tans.push_back(i); else if(i!=N-1)tans.push_back(i+1),tans.push_back(i),i++; else ans.push_back(i); } for(auto x:tans)ans.push_back(x); return ans; } int vis[256]; int fnext(int x,int sz){ if(sz==0)return -1; //cerr<<"fnext:"<<x<<" "<<sz<<"\n"; int st=1,en=sz,ans=0; int id=-1; vector<int>ask; while(st<=en){ int m=(st+en)/2; ask.clear(); int cur=0; while(ask.size()<m){ if(!vis[cur])ask.push_back(cur); cur++; } //cerr<<m<<" ask:"; //for(auto x:ask)cerr<<x<<" "; //cerr<<"\n"; if(are_connected({x},ask)){ en=m-1; ans=m; id=cur-1; }else{ st=m+1; } } return id; } pair<int,int> fincom(int x,vector<int>ans){ int sz=ans.size(); //cerr<<"fnext:"<<x<<" "<<sz<<"\n"; int st=0,en=sz-1; int id=-1,pos=-1; vector<int>ask; while(st<=en){ int m=(st+en)/2; ask.clear(); for(int i=0;i<=m;i++)ask.push_back(ans[i]); if(are_connected({x},ask)){ en=m-1; id=ans[m]; pos=m; }else{ st=m+1; } } return {id,pos}; } vector<int>longest_trip_1(int N){ for(int i=0;i<256;i++)vis[i]=0; vector<int>ans; vector<int>rans; ans.push_back(0); vis[0]=1; int cur=0,left=N-1; while(1){ //cerr<<cur<<"\n"; int x=fnext(cur,left); if(x!=-1){ cur=x; left--; ans.push_back(cur); vis[cur]++; }else{ break; } } if(ans.size()>=(N+1)/2){ if(ans.size()==N)return ans; int outcom=-1; for(int i=0;i<N;i++){ if(!vis[i]){ outcom=i; break; } } auto x=fincom(outcom,ans); if(x.first==-1)return ans; for(int i=0;i<=x.second;i++)rans.push_back(ans[i]); for(int i=0;i<N;i++)if(!vis[i])rans.push_back(i); for(int i=x.second+1;i<ans.size();i++)rans.push_back(ans[i]); return rans; } else{ int outcom=-1; for(int i=0;i<N;i++){ if(!vis[i]){ outcom=i; break; } } auto x=fincom(outcom,ans); if(x.first==-1){ for(int i=0;i<N;i++)if(!vis[i])rans.push_back(i); return rans; } for(int i=0;i<=x.second;i++)rans.push_back(ans[i]); for(int i=0;i<N;i++)if(!vis[i])rans.push_back(i); for(int i=x.second+1;i<ans.size();i++)rans.push_back(ans[i]); return rans; } return ans; } vector<int> longest_trip(int N, int D) { if(D==1)return longest_trip_1(N); else if(D==2)return longest_trip_2(N); else return longest_trip_3(N); //cerr<<"end of query\n"; return {}; }

Compilation message (stderr)

longesttrip.cpp: In function 'int fnext(int, int)':
longesttrip.cpp:32:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   32 |         while(ask.size()<m){
      |               ~~~~~~~~~~^~
longesttrip.cpp:25:20: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
   25 |     int st=1,en=sz,ans=0;
      |                    ^~~
longesttrip.cpp: In function 'std::vector<int> longest_trip_1(int)':
longesttrip.cpp:88:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   88 |     if(ans.size()>=(N+1)/2){
      |        ~~~~~~~~~~^~~~~~~~~
longesttrip.cpp:89:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   89 |         if(ans.size()==N)return ans;
      |            ~~~~~~~~~~^~~
longesttrip.cpp:101:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for(int i=x.second+1;i<ans.size();i++)rans.push_back(ans[i]);
      |                              ~^~~~~~~~~~~
longesttrip.cpp:119:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |         for(int i=x.second+1;i<ans.size();i++)rans.push_back(ans[i]);
      |                              ~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...