Submission #1292029

#TimeUsernameProblemLanguageResultExecution timeMemory
1292029dimitri.shengeliaWorld Map (IOI25_worldmap)C++20
0 / 100
417 ms181136 KiB
//#include "worldmap.h"
#include <bits/stdc++.h>

using namespace std;

vector <int> v;

void dfs ( int u, int v1, vector <vector<int>> adj ) {

	v.push_back( v1 );

	for ( auto x : adj[v1] ) {

		if ( x != u ) {

			dfs( v1, x, adj );

			v.push_back( v1 );

		}

	}

	return;

}

vector < vector <int> > create_map(int N, int M, vector<int> A, vector<int> B) {

	vector< vector <int> > answer( N );
	vector< vector <int> > adj( N + 1 );

	for ( int i = 0; i < M; i++ ) {

		adj[A[i]].push_back( B[i] );

	}

	dfs( 0, 1, adj );

	for ( int i = 0; i < N; i++ ) {

		answer[i] = v;

	}

	return answer;

}
#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...