Submission #1283444

#TimeUsernameProblemLanguageResultExecution timeMemory
1283444Luvidi세계 지도 (IOI25_worldmap)C++20
29 / 100
22 ms3276 KiB
#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

vector<int> ad[41],st;
set<pair<int,int>> ss;
bool vs[41];

void dfs(int v){
    vs[v]=1;
    st.pb(v);
    for(int u:ad[v]){
        if(vs[u]){
            if(!ss.count({u,v})){
                ss.insert({u,v});
                ss.insert({v,u});
                st.pb(u);
                st.pb(v);
            }
        }else{
            ss.insert({u,v});
            ss.insert({v,u});
            dfs(u);
            st.pb(v);
        }
    }
}

std::vector<std::vector<int>> create_map(int n, int m, std::vector<int> a, std::vector<int> b) {
    for(int i=1;i<=n;i++){
        ad[i].clear();
        vs[i]=0;
    }
    ss.clear();
    st.clear();
    for(int i=0;i<m;i++){
        ad[a[i]].pb(b[i]);
        ad[b[i]].pb(a[i]);
    }
    dfs(1);
    int sz=st.size();
    vector<vector<int>> ans(sz,vector<int>(sz));
    for(int i=0;i<sz;i++){
        for(int j=0;j<sz;j++)ans[i][j]=st[j];
    }
    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...