Submission #1339477

#	Time	Username	Problem	Language	Result	Execution time	Memory
1339477		Desh03	World Map (IOI25_worldmap)	C++20	15 / 100	52 ms	7360 KiB

worldmap

#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
    vector<vector<pair<int, int>>> g(n);
    for (int i = 0; i < m; i++) {
        g[--a[i]].push_back({--b[i], i});
        g[b[i]].push_back({a[i], i});
    }
    vector<int> e, id(n);
    vector<bool> vis(n), done(m);
    vector<vector<int>> bk(n);
    int t = 0;
    auto dfs = [&](const auto &dfs, int u) -> void {
        e.push_back(u);
        id[u] = e.size();
        e.push_back(u);
        e.push_back(u);
        vis[u] = 1;
        for (auto [v, i] : g[u]) {
            if (!vis[v]) {
                dfs(dfs, v);
                done[i] = 1;
                e.push_back(u);
            }
        }
    };
    dfs(dfs, 0);
    for (int &x : e) {
        ++x;
    }
    for (int i = 0; i < m; i++) {
        if (!done[i]) {
            bk[a[i]].push_back(b[i]);
            bk[b[i]].push_back(a[i]);
        }
    }
    vector<vector<int>> gg(4 * n - 1, e);
    for (int i = 0; i < n; i++) {
        for (int j = 0, k = 0; k < bk[i].size(); j += 2, k++) {
            gg[id[i]][j] = bk[i][k] + 1;
        }
    }
    return gg;
}

• 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