Submission #1252704

#TimeUsernameProblemLanguageResultExecution timeMemory
1252704dreamnguyenWorld Map (IOI25_worldmap)C++20
15 / 100
14 ms2116 KiB
#include <bits/stdc++.h>
#include "worldmap.h"
using namespace std;
using ll = long long;

void giai(int u, vector<int> &used, vector<vector<int>> &a, vector<int> &o) {
    o.push_back(u);
    used[u] = 1;
    for (auto v : a[u]) {
        if (used[v] == 0) {
            giai(v, used, a, o);
            o.push_back(u);
        }
    }
}

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
        int SIZE = 41;
        vector<int> used(SIZE, 0);
        vector<vector<int>> a(SIZE);
        for (int i = 0; i < M; i++) {
            a[A[i]].push_back(B[i]);
            a[B[i]].push_back(A[i]);
        }
        vector<int> o;
        giai(1, used, a, o);
        int n = (int)o.size();
        vector<vector<int>> ans(n, vector<int> (n, 0));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                ans[i][j] = o[i];
            }
        }
        return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...