# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
424564 | Pyqe | Simurgh (IOI17_simurgh) | C++14 | 3090 ms | 300 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;
#define mp make_pair
#define fr first
#define sc second
long long m,dsu[569];
pair<long long,long long> ed[569];
long long fd(long long x)
{
if(dsu[x]!=x)
{
dsu[x]=fd(dsu[x]);
}
return dsu[x];
}
vector<int> find_roads(int n,vector<int> ka,vector<int> la)
{
long long i,k,l,mk;
vector<int> v;
m=ka.size();
for(mk=0;mk<1ll<<m;mk++)
{
for(i=1;i<=n;i++)
{
dsu[i]=i;
}
v.clear();
for(i=0;i<m;i++)
{
if(mk>>i&1)
{
k=ka[i]+1;
l=la[i]+1;
if(fd(k)==fd(l))
{
break;
}
dsu[fd(l)]=fd(k);
v.push_back(i);
}
}
if(i>=m&&v.size()==n-1&&count_common_roads(v)==n-1)
{
return v;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |