Submission #1296974

#TimeUsernameProblemLanguageResultExecution timeMemory
1296974nataliaaWorld Map (IOI25_worldmap)C++20
0 / 100
1209 ms2134116 KiB
#include<bits/stdc++.h>
using namespace std;
vector<int> ans;
vector<int> v[41];
void rec(int u, int w) {
    ans.push_back(w);
    for(int i = 0; i < v[w].size(); i++) {
        if(v[w][i]!=u){
            rec(w, v[w][i]);
            ans.push_back(v[w][i]);
        }
    }
}
vector<vector<int>> create_map(int N, int M,
vector<int> A, vector<int> B){
    if(M==0) {
        vector<vector<int>> v1(1, vector<int>(1,1));
        return v1;
    }
    for(int i = 0; i<=40; i++) v[i].clear();
    for(int i = 0; i < M; i++) {
        v[A[i]].push_back(B[i]);
        v[B[i]].push_back(A[i]);
    }
    rec(0, 1);
    ans.clear();
    int n = ans.size();
     vector<vector<int>> ans1(n, vector<int>(n));
     for(int i = 0; i < ans.size(); i++) {
         for(int j = 0; j < ans.size(); j++){
             ans1[i][j] = ans[j];
         }
     }
     return ans1;
}
#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...