제출 #1144748

#제출 시각아이디문제언어결과실행 시간메모리
1144748AlgorithmWarrior가장 긴 여행 (IOI23_longesttrip)C++20
15 / 100
3 ms404 KiB
#include "longesttrip.h" #include <cassert> #include <cstdio> #include <string> #include <vector> #include <deque> using namespace std; std::vector<int> longest_trip(int N, int D){ if(D==3){ int i; vector<int>path; for(i=0;i<N;++i) path.push_back(i); return path; } else if(D==2){ int i; deque<int>path; int vec0; if(are_connected({0},{1})) vec0=1; else vec0=2; path.push_back(0); path.push_back(vec0); for(i=1;i<N;++i) if(i!=vec0){ if(are_connected({path.front()},{i})) path.push_front(i); else path.push_back(i); } vector<int>ans; for(auto el : path) ans.push_back(el); return ans; } }

컴파일 시 표준 에러 (stderr) 메시지

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
   40 | }
      | ^
#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...