#include <bits/stdc++.h>
#include "worldmap.h"
using namespace std;
vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
vector<vector<int>> g(n + 1);
for (int i = 0; i < m; i++) {
g[a[i]].push_back(b[i]);
g[b[i]].push_back(a[i]);
}
int k = 2 * n;
vector<vector<int>> ans(k, vector<int>(k, 1));
int x = 2;
for (int i = 0; i < k; i += 2) {
int j = 0;
for (auto y : g[x]) {
ans[i][j++] = y;
ans[i][j++] = x;
}
for (; j < k; j++) {
ans[i][j] = x;
}
x++;
if (x > n) break;
}
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... |