제출 #1252917

#제출 시각아이디문제언어결과실행 시간메모리
1252917nickolasarapidis세계 지도 (IOI25_worldmap)C++20
0 / 100
6 ms3144 KiB
#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> adj[45];

vector<int> et;
vector<bool> visited(45, false);

void dfs(int s){
    et.push_back(s);
    if(visited[s]) return;
    visited[s] = true;
    for(auto u : adj[s]){
        dfs(u);
        et.push_back(s);
    }
}

vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B){
    vector<vector<int>> ans;
    for(int i = 0; i < M; i++){
        adj[A[i]].push_back(B[i]);
        adj[B[i]].push_back(B[i]);
    }
    dfs(1);
    for(int i = 0; i < et.size(); i++){
        ans.push_back(et);
    }
    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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...