Submission #1287218

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287218		ecen30	World Map (IOI25_worldmap)	C++20	0 / 100	1 ms	572 KiB

worldmap

//testing AI code
#include "worldmap.h"
#include <vector>
#include <set>
using namespace std;

vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {
    // Step 1: Build adjacency sets
    vector<set<int>> adj(N + 1);
    for (int i = 0; i < M; i++) {
        adj[A[i]].insert(B[i]);
        adj[B[i]].insert(A[i]);
    }

    // Step 2: Decide grid size K
    int K = N * 2; // simple safe choice: 2N x 2N grid

    // Step 3: Initialize empty grid
    vector<vector<int>> grid(K, vector<int>(K, 0));

    // Step 4: Place each country in a diagonal stripe
    for (int c = 1; c <= N; c++) {
        for (int i = 0; i < K; i++) {
            int x = (i + c - 1) % K;
            int y = i;
            grid[x][y] = c;
        }
    }

    // Step 5: Make sure adjacent countries are next to each other
    int placed = 0;
    for (int i = 0; i < M; i++) {
        int u = A[i], v = B[i];
        int x = placed % K;
        int y = (placed + 1) % K;
        grid[x][y] = u;
        grid[x][(y + 1) % K] = v;
        placed++;
    }

    return grid;
}

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