제출 #1289154

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289154		ecen30	세계 지도 (IOI25_worldmap)	C++20	7 / 100	8 ms	1848 KiB

worldmap

//testing AI Code
#include <bits/stdc++.h>
using namespace std;

vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {
    int K = min(2 * N, 240);
    vector<vector<int>> C(K, vector<int>(K, 1));

    // Step 1: each country appears at least once
    for (int i = 0; i < N; i++) {
        C[i][i] = i + 1;
    }

    // Step 2: place adjacency pairs as 2x2 tiles
    int r = 0, c = 0;
    for (int i = 0; i < M; i++) {
        int a = A[i], b = B[i];
        C[r][c] = a;
        if (c + 1 < K) C[r][c + 1] = b;
        else if (r + 1 < K) C[r + 1][c] = b;
        c += 2;
        if (c >= K) { c = 0; r += 2; }
        if (r >= K) break;  // we have plenty of space
    }

    // Step 3: fill remaining empty cells with country 1
    for (int i = 0; i < K; i++)
        for (int j = 0; j < K; j++)
            if (C[i][j] < 1 || C[i][j] > N)
                C[i][j] = 1;

    return C;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 7 / 7
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 56