Submission #1298274

#TimeUsernameProblemLanguageResultExecution timeMemory
1298274georgeckitoWorld Map (IOI25_worldmap)C++20
15 / 100
1183 ms2077504 KiB
#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;

vector<vector<int>> adj(41);
vector<int> vc;
void dfs(int u, int v) {
	for(int w : adj[v]) {
		if(w != u) {
			vc.push_back(v);
			dfs(v,w);
		}
	}
	if(v != 1)
	vc.push_back(v);
}

vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {
  for(int i = 0; i < 41; i++) adj[i].clear();
  vc.clear();
  if(M == 0) {
       vector<vector<int> > v(1, vector<int>(1,1));
       return v;     
  }
  for(int i = 0; i < M; i++) {
  	adj[A[i]].push_back(B[i]);
  	adj[B[i]].push_back(A[i]);
  }
  dfs(0, 1);

  vector<vector<int> > ans(vc.size(), vector<int>(vc.size(), 1));
  for(int i = 0; i < vc.size(); i++) {
  	for(int j = 0; j < vc.size(); j++) {
  		ans[i][j]=vc[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...