제출 #960124

#제출 시각아이디문제언어결과실행 시간메모리
960124tutis가장 긴 여행 (IOI23_longesttrip)C++17
15 / 100
13 ms700 KiB
#include "longesttrip.h" #include <bits/stdc++.h> using namespace std; mt19937_64 rng(0); std::vector<int> longest_trip(int N, int D) { vector<int>x,y; x.push_back(0); for(int i=1;i<N;i++){ if(are_connected({0}, {i})){ x.push_back(i); } else{ y.push_back(i); } } if(y.size()>0 && !are_connected(x,y)){ if(x.size()>y.size()){ return x; } else{ return y; } } if(y.empty()){ vector<int>ans; vector<int>p; ans.push_back({1}); for(int i=2;i<N;i++){ p.push_back(i); } while(!p.empty()){ shuffle(p.begin(),p.end(),rng); bool found=false; for(int i: p){ if(are_connected({ans.back()}, {i})){ ans.push_back(i); p.erase(find(p.begin(),p.end(), i)); found=true; break; } } if(!found){ break; } } ans.push_back(0); for(int i: p){ ans.push_back(i); } return ans; } vector<int>ans=y; vector<int>p; for(int i=1;i<N;i++){ if(find(y.begin(),y.end(),i)==y.end()){ p.push_back(i); } } while(!p.empty()){ shuffle(p.begin(),p.end(),rng); bool found=false; for(int i: p){ if(are_connected({ans.back()}, {i})){ ans.push_back(i); p.erase(find(p.begin(),p.end(), i)); found=true; break; } } if(!found){ break; } } ans.push_back(0); for(int i: p){ ans.push_back(i); } return ans; }
#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...