# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103474 | figter001 | Simurgh (IOI17_simurgh) | C++17 | 20 ms | 4768 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"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 250;
int dsu[nax];
int m,n;
bool used[nax];
vector<pair<int,int>> g[nax];
vector<int> u,v;
int find(int u){
return u == dsu[u] ? u : dsu[u] = find(dsu[u]);
}
bool good(vector<int> ans){
for(int i=0;i<n;i++)
dsu[i] = i;
for(int i=0;i<ans.size();i++){
int id = ans[i];
int a = u[id];
int b = v[id];
if(find(a) == find(b))
continue;
dsu[find(b)] = find(a);
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... |