# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1253174 | dreamnguyen | World Map (IOI25_worldmap) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = a; i<b; i++)
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
if(M=N*(N-1)/2){
int K = 2 * N;
std::vector<std::vector<int>> grid(K, std::vector<int>(K, 0));
int color = 1;
for (int i = 0; i < N; ++i) {
grid[i][i] = i + 1;
}
int x = 0, y = N;
for (int i = 0; i < M; ++i) {
if (x + 1 >= K) {
x = 0;
++y;
if (y + 1 >= K) break;
}
grid[x][y] = A[i];
grid[x + 1][y] = B[i];
x += 2;
}
return grid;
}
else{
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
std::vector<std::vector<int>> ans(N, std::vector<int>(N));
FOR(i,0,N) {
FOR(j,0,N) {
ans[i][j] = i+1;
}
}
return ans;
}
}
}