| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1290823 | ecen30 | World Map (IOI25_worldmap) | C++20 | 0 ms | 0 KiB |
//testing AI Code
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {
int K = N; // Simple approach: K=N
vector<vector<int>> res(K, vector<int>(K, 1));
// 1. Place each country on the main diagonal
for (int i = 0; i < N; ++i)
res[i][i] = i+1;
// 2. For each adjacency, fill adjacent cells off the diagonal
// Just a simple fill: place A[i] and B[i] in (row,col) and (row+1, col) as needed
int idx = 0;
for (int i = 0; i < M; ++i) {
int x = idx % K, y = (idx / K) % K;
res[x][y] = A[i];
if (x+1 < K) res[x+1][y] = B[i];
else if (y+1 < K) res[x][y+1] = B[i];
idx++;
}
return res;
}
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {
int K = N; // Simple approach: K=N
vector<vector<int>> res(K, vector<int>(K, 1));
// 1. Place each country on the main diagonal
for (int i = 0; i < N; ++i)
res[i][i] = i+1;
// 2. For each adjacency, fill adjacent cells off the diagonal
// Just a simple fill: place A[i] and B[i] in (row,col) and (row+1, col) as needed
int idx = 0;
for (int i = 0; i < M; ++i) {
int x = idx % K, y = (idx / K) % K;
res[x][y] = A[i];
if (x+1 < K) res[x+1][y] = B[i];
else if (y+1 < K) res[x][y+1] = B[i];
idx++;
}
return res;
}
