제출 #1252598

#제출 시각아이디문제언어결과실행 시간메모리
1252598bzzzzzzzzzzWorld Map (IOI25_worldmap)C++20
15 / 100
14 ms2116 KiB
#include <bits/stdc++.h> #include "worldmap.h" using namespace std; using ll = long long; void dfs(int v, vector<int> &used, vector<vector<int>> &g, vector<int> &o) { o.push_back(v); used[v] = 1; for (auto i : g[v]) { if (used[i] == 0) { dfs(i, used, g, o); o.push_back(v); } } } std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) { int SIZE = 41; vector<int> used(SIZE, 0); vector<vector<int>> g(SIZE); for (int i = 0; i < M; i++) { g[A[i]].push_back(B[i]); g[B[i]].push_back(A[i]); } vector<int> o; dfs(1, used, g, o); int n = (int)o.size(); vector<vector<int>> ans(n, vector<int> (n, 0)); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ans[i][j] = o[i]; } } 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...