| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1249558 | madamadam3 | 세계 지도 (IOI25_worldmap) | C++20 | 0 ms | 328 KiB |
#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
void dfs(int u, vi &vis, vvi &adj, vi &tour) {
vis[u] = true;
tour.push_back(u);
for (int v : adj[u]) {
if (vis[v]) continue;
dfs(v, vis, adj, tour);
tour.push_back(u);
}
}
vvi create_map(int n, int m, vi a, vi b) {
vvi adj(n+1, vi()); for (int i = 0; i < m; i++) adj[a[i]].push_back(b[i]), adj[b[i]].push_back(a[i]);
int K = 2*n - 1;
vvi ans(K, vi(K, 1));
vi vis(n, 0), tour;
dfs(1, vis, adj,tour);
for (int i = 0; i < K; i++) {
for (int j = 0; j < K; j++) {
ans[i][j] = tour[j];
}
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
