Submission #1251270

#	Time	Username	Problem	Language	Result	Execution time	Memory
1251270		MojoLake	World Map (IOI25_worldmap)	C++20	15 / 100	14 ms	2120 KiB

worldmap

#include "worldmap.h"

#include <bits/stdc++.h>

#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using namespace std;

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {

    // vector<vector<int>> c(N, vector<int>(N));
    // for (int i = 0; i < N; ++i) {
    //     fill(all(c[i]), i + 1);
    // }
    // return c;


    vector<vector<int>> ans(2 * N - 1, vector<int>(2 * N - 1));

    if (M != N - 1) return ans;

    vector<vector<int>> g(N + 1);

    for (int i = 0; i < M; ++i) {
        g[A[i]].push_back(B[i]);
        g[B[i]].push_back(A[i]);
    }

    vector<int> order;

    function<void(int, int)> dfs = [&](int u, int p) {
        order.push_back(u);

        for (int v : g[u]) {
            if (v == p) continue;
            dfs(v, u);
            order.push_back(u);
        }
    };

    dfs(1, 0);

    // cerr << "order:\n";
    // for (int x : order) {
    //     cerr << x << " ";
    // }
    // cerr << "\n";

    assert(sz(order) == 2 * N - 1);

    for (int i = 0; i < 2 * N - 1; ++i) {
        fill(all(ans[i]), order[i]);
    }

    return ans;
}

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