제출 #1295297

#제출 시각아이디문제언어결과실행 시간메모리
1295297123123123세계 지도 (IOI25_worldmap)C++20
15 / 100
1173 ms2162688 KiB
#include <bits/stdc++.h> using namespace std; int fix[245]; vector <int> v[245], tr; void DFS(int y, int x) { int j; for(j = 0; j < v[x].size(); j++) { if(v[x][j] != y) { tr.push_back(x); DFS(x, v[x][j]); } } if(x != 1) tr.push_back(x); } vector <vector <int> > create_map(int N, int M, vector<int> A, vector<int> B) { int i, j; if(M == 0) { vector <vector<int> > mymap(1, std::vector<int>(1, 1)); return mymap; } for(i = 1; i <= N; i++) { v[i].clear(); } for(i = 0; i < M; i++) { v[A[i]].push_back(B[i]); v[B[i]].push_back(A[i]); } tr.clear(); DFS(0, 1); vector <vector <int> > mymap(tr.size(), std::vector<int>(tr.size(), 1)); for(i = 0; i < tr.size(); i++) { for(j = 0; j < tr.size(); j++) { mymap[i][j] = tr[j]; } } return mymap; }
#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...