#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> solve_subtask2(int n, int m, vector<int> a, vector<int> b) {
vector<vector<int>> ans(2 * n, vector<int>(2 * n));
for (int i = 0; i < 2 * n; i++) {
if (i & 1) {
for (int j = 0; j < 2 * n; j++) {
if (j >= i / 2) ans[i][j] = min(j + 2, i / 2 == n - 1 ? i / 2 : n);
else ans[i][j] = j + 1;
}
}else {
for (int j = 0; j < 2 * n; j++) ans[i][j] = i / 2 + 1;
}
}
return ans;
}
vector<vector<int>> solve_subtask1(int n, int m, vector<int> a, vector<int> b) {
vector<vector<int>> ans(n, vector<int>(n));
for (int i = 0; i < n; i++) iota(ans[i].begin(), ans[i].end(), 1);
return ans;
}
vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
bool subtask1 = true, subtask2 = (m == n * (n - 1) / 2);
for (int i = 0; i < m; i++) {
if (a[i] != i + 1 or b[i] != i + 2) subtask1 = false;
}
if (subtask1) return solve_subtask1(n, m, a, b);
return solve_subtask2(n, m, a, b);
}
# | 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... |