제출 #1294663

#제출 시각아이디문제언어결과실행 시간메모리
1294663theiuliusWorld Map (IOI25_worldmap)C++17
0 / 100
3 ms3644 KiB
#include "worldmap.h" #include <bits/stdc++.h> #define pb push_back using namespace std; vector<int> v[102]; const int K = 102; int j = 0; vector<std::vector<int>> ans(K, vector<int> (K, 1)); void dfs(int x, int last){ ans[0][j] = x; for (auto h : v[x]){ if (last != h){ j++; dfs(h, x); } } ans[0][j] = x; if (j >= K){ j--; return; } j++; } std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> a, std::vector<int> b) { for (int k = 0; k < M; k++){ v[a[k]].pb(b[k]); v[b[k]].pb(a[k]); } dfs(1, 0); for (int k = 1; k < K; k++){ for (int j = 0; j < K; j++){ ans[k][j] = ans[0][j]; } } 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...