Submission #1339469

#	Time	Username	Problem	Language	Result	Execution time	Memory
1339469		Desh03	세계 지도 (IOI25_worldmap)	C++20	15 / 100	51 ms	7452 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<int>> g(n);
    for (int i = 0; i < m; i++) {
        g[--a[i]].push_back(--b[i]);
        g[b[i]].push_back(a[i]);
    }
    vector<int> e, in(n), id(n);
    vector<bool> vis(n);
    vector<vector<int>> bk(n);
    int t = 0;
    auto dfs = [&](const auto &dfs, int u, int p = -1) -> void {
        e.push_back(u);
        id[u] = e.size();
        e.push_back(u);
        e.push_back(u);
        vis[u] = 1;
        in[u] = t++;
        for (int v : g[u]) {
            if (!vis[v]) {
                dfs(dfs, v, u);
                e.push_back(u);
            } else if (v != p && in[v] < in[u]) {
                bk[u].push_back(v);
            }
        }
    };
    dfs(dfs, 0);
    for (int &x : e) {
        ++x;
    }
    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