Submission #1252235

#	Time	Username	Problem	Language	Result	Execution time	Memory
1252235		EJIC_B_KEDAX	World Map (IOI25_worldmap)	C++20	7 / 100	30 ms	4164 KiB

worldmap

#include "worldmap.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
    vector<vector<int>> g(n);
    for (int i = 0; i < m; i++) {
        a[i]--; b[i]--;
        g[a[i]].push_back(b[i]);
        g[b[i]].push_back(a[i]);
    }
    vector<vector<int>> ans(4 * n, vector<int>(4 * n, -1));
    vector<int> used(n, 0);
    int cur = 0;
    auto dfs = [&](auto dfs, int s) -> void {
        used[s] = 1;
        for (int i = 0; i < 4 * n; i++) {
            ans[cur][i] = s + 1;
        }
        for (int i = 0; i < 4 * n; i++) {
            if (g[s].size() > i) {
                ans[cur + 1][i] = g[s][i] + 1;
            } else {
                ans[cur + 1][i] = s + 1;
            }
        }
        for (int i = 0; i < 4 * n; i++) {
            ans[cur + 2][i] = s + 1;
        }
        cur += 3;
        for (int i : g[s]) {
            if (!used[i]) {
                dfs(dfs, i);
            }
        }
        for (int i = 0; i < 4 * n; i++) {
            ans[cur][i] = s + 1;
        }
        cur++;
    };
    dfs(dfs, 0);
    for (; cur < 4 * n; cur++) {
        ans[cur] = ans[cur - 1];
    }
    return ans;
}

• 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