# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1253283 | daniel920712 | 세계 지도 (IOI25_worldmap) | C++20 | 0 ms | 0 KiB |
#include "worldmap.h"
using namespace std;
vector < int > Next[50];
vector < int > who;
void F(int here,int fa)
{
who.push_back(here);
for(auto i:Next[here])
{
if(i==fa) continue;
F(i,here);
who.push_back(here);
}
}
vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B)
{
int i,j,K;
who.clear();
for(i=1;i<=N;i++) Next[i].clear();
for(i=0;i<M;i++)
{
Next[A[i]].push_back(B[i]);
Next[B[i]].push_back(A[i]);
}
if(M==N-1)
{
F(1,-1);
K=who.size();
vector < vector <int> > ans(K,vector<int>(K,1));
for(i=0;i<K;i++) for(j=0;j<K;j++) ans[i][j]=who[i];
}
/*else
{
K=
}*/
return ans;
}