| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1292027 | dimitri.shengelia | World Map (IOI25_worldmap) | C++20 | 0 ms | 0 KiB |
//#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> v;
void dfs ( int u, int v, vector <vector<int>> adj ) {
v.push_back( v );
for ( auto x : adj[v] ) {
if ( x != u ) {
dfs( v, x, adj );
v.push_back( v );
}
}
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;
}
