Submission #1262950

#TimeUsernameProblemLanguageResultExecution timeMemory
1262950vtnooWorld Map (IOI25_worldmap)C++20
0 / 100
1 ms836 KiB
#include <bits/stdc++.h>

using namespace std;

const int K=239;
vector<vector<int>> adj, g;
int j=0;

void dfs(int u, int p){
    for(int i=0;i<K;i++){
        g[i][j]=u;
    }
    j++;
    for(auto v:adj[u]){
        if(v==p)continue;
        dfs(v, u);
        for(int i=0;i<K;i++){
            g[i][j]=u;
        }
        j++;
    }
}

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B){
    g.resize(K, vector<int> (K, -1));
    adj.resize(N+1);
    for(int i=0;i<M;i++){
        adj[A[i]].push_back(B[i]);
        adj[B[i]].push_back(A[i]);
    }
    dfs(1, 1);
    return g;
}
#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...