| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1357857 | maya_s | 가장 긴 여행 (IOI23_longesttrip) | C++20 | 2 ms | 412 KiB |
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
vector<int> longest_trip(int n, int d)
{
vector<ll> ans;
ll node = 0;
vector<bool> vis(n);
while(ans.size() < n){
vis[node] = 1; ans.push_back(node);
for(ll i = 0; i < n; i++) if(!vis[i] && are_connected({node}, {i})){
node = i;
break;
}
}
return ans;
}
| # | 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... | ||||
