Submission #1293813

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293813		SabaKharebava	World Map (IOI25_worldmap)	C++20	29 / 100	22 ms	3276 KiB

worldmap

#include<bits/stdc++.h>

using namespace std;

#define pb push_back

vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
    vector<vector<int>> graph(n+1);

    for (int i = 0; i < m; i++) {
        graph[a[i]].pb(b[i]);
        graph[b[i]].pb(a[i]);
    }

    vector<int> subans;
    vector<vector<bool>> conn(n+1, vector<bool> (n+1, false));
    auto dfs = [&](auto &dfs, int u) -> void {
        subans.pb(u);
        for (int e : graph[u]) {
            if (!conn[u][e]) {
                conn[u][e] = true;
                conn[e][u] = true;
                dfs(dfs, e);
                subans.pb(u);
            }
        }
    };
    dfs(dfs, 1);
    vector<vector<int>> ans(subans.size(), subans);

    return ans;
}

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