제출 #1293199

#제출 시각아이디문제언어결과실행 시간메모리
1293199alexrana2626세계 지도 (IOI25_worldmap)C++20
5 / 100
3 ms1348 KiB
#include "worldmap.h" #include <bits/stdc++.h> using namespace std; vector<int> gr[45]; vector<bool> vis; vector<int> v; void dfs(int x) { vis[x] = true; v.push_back(x); for (int i : gr[x]) { if (!vis[i]) dfs(i); } } vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) { for (int i = 0; i < 45; i++) gr[i].clear(); v.clear(); vis.assign(N + 1, false); for (int i = 0; i < M; i++) { gr[A[i]].push_back(B[i]); gr[B[i]].push_back(A[i]); } dfs(1); int K = v.size(); vector<vector<int>> ans(K, vector<int>(K)); for (int i = 0; i < K; i++) { for (int j = 0; j < K; j++) { ans[i][j] = v[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...