# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
283958 | hank55663 | Simurgh (IOI17_simurgh) | C++14 | 352 ms | 2296 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 "simurgh.h"
#define x first
#define y second
#define pb push_back
#include<bits/stdc++.h>
using namespace std;
int f[505];
int f2[505];
int Find(int x){
if(f[x]==x)return x;
return f[x]=Find(f[x]);
}
int Find2(int x){
if(f2[x]==x)return x;
return f2[x]=Find2(f2[x]);
}
int check[250500];
int ok[250500];
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
vector<int> ans;
int m=u.size();
for(int i = 0;i<n;i++)f2[i]=i;
for(int i = 0;i<n;i++){
for(int j=0;j<n;j++)f[j]=Find2(j);
vector<int> road;
vector<int> road2;
vector<int> candidate;
for(int j = 0;j<m;j++){
if(Find2(u[j])!=Find2(i)&&Find2(v[j])!=Find2(i)){
if(Find(u[j])!=Find(v[j])&&Find2(u[j])!=Find2(v[j])){
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... |