# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423011 | albertolg101 | Simurgh (IOI17_simurgh) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "simurgh.h"
using namespace std;
using pii = pair<int, int>;
void print (vector<int> &ar)
{
for(auto i: ar)
cout << i << ' ' ;
cout << endl ;
}
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
vector<vector<int>> g(n, vector<int> (n, -1));
for(int i = 0 ; i < u.size() ; i++)
{
int a = u[i], b = v[i];
g[a][b] = g[b][a] = i;
}
int nextNod = 0;
vector<int> vans, perm(n);
for(int i = 0 ; i < n ; i++)
perm[i] = i;
function<void(int)> dfs = [&](int nod)
{
nextNod++;
//cout << nod << ' ' << perm[nextNod] << endl ;
while(nextNod < perm.size() and g[nod][perm[nextNod]] != -1)
{
vans.push_back(g[nod][perm[nextNod]]);
dfs(perm[nextNod]);
//cout << nod << ' ' << perm[nextNod] << endl ;
}
};
do
{
vans.clear();
nextNod = 0;
dfs(perm[0]);
//print(perm);
//cout << vans.size() << " - " ;
//print(vans);
if(vans.size() == n - 1 and count_common_roads(vans) == n - 1)
return vans;
} while(next_permutation(perm.begin(), perm.end()));
whille(true);
}