| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1293203 | tschav_ | World Map (IOI25_worldmap) | C++20 | 0 ms | 0 KiB |
#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
vector<vector<int>> create_map(int n,
int m, vector<int> A, vector<int> B) {
adj.resize(n+1);
for(int i = 0; i < n; ++i) {
adj[a[i]].emplace_back(b[i]);
adj[b[i]].emplace_back(a[i]);
}
vector<vector<int>> ans(2*n);
for(int i = 0; i < 2 * n; ++i) {
if(i & 1) {
int u = (i+1)/2;
queue<int> Q;
for(auto &v : adj[u]) Q.push(v);
for(int j = 0; j < 2 * n; ++j) {
if(j & 1) {
if(Q.empty()) {
ans[i][j] = u;
continue;
}
ans[i][j] = Q.front();
Q.pop();
} else {
ans[i][j] = u;
}
}
} else {
for(int j = 0; j < 2 * n; ++j) {
ans[i][j] = 1;
}
}
}
return ans;
}
