Submission #1349444

#	Time	Username	Problem	Language	Result	Execution time	Memory
1349444		bangan	World Map (IOI25_worldmap)	C++20	5 / 100	6 ms	1484 KiB

worldmap

#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
    vector<vector<int>> ans(2*N, vector<int>(2*N));

    vector<vector<int>> adj(N);
    for (int i=0; i<M; i++) {
        A[i]--;
        B[i]--;
        adj[A[i]].pb(B[i]);
        adj[B[i]].pb(A[i]);
    }

    vector<bool> seen(N);
    vector<int> ord;
    auto dfs = [&](auto self, int v) -> void {
        seen[v] = true;
        ord.pb(v);
        for (int u : adj[v]) if (!seen[u]) {
            self(self, u);
        }
        ord.pb(v);
    };
    dfs(dfs, 0);

    for (int i=0; i < 2*N; i++) ord[i]++;
    for (int i=0; i < 2*N; i++) ans[i] = ord;
    
    return ans;
}

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