# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1144748 | AlgorithmWarrior | 가장 긴 여행 (IOI23_longesttrip) | C++20 | 3 ms | 404 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) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |