# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
594002 | AlperenT | Simurgh (IOI17_simurgh) | C++17 | 3038 ms | 340 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;
const int N = 7;
struct DSU{
int par[N], setsize[N], setcnt;
void reset(int n){
for(int i = 0; i < n; i++) par[i] = i, setsize[i] = 1;
setcnt = n;
}
int setfind(int a){
if(par[a] == a) return a;
else return par[a] = setfind(par[a]);
}
void setunion(int a, int b){
a = setfind(a), b = setfind(b);
if(a != b){
if(setsize[b] > setsize[a]) swap(a, b);
par[b] = par[a];
setsize[a] += setsize[b];
setcnt--;
}
}
};
DSU dsu;
vector<int> find_roads(int n, vector<int> u, vector<int> v) {
int m = u.size();
for(int msk = 0; msk < (1 << m); msk++){
if(__builtin_popcount(msk) == n - 1){
dsu.reset(n);
vector<int> vec;
for(int i = 0; i < m; i++){
if(msk & (1 << i)){
vec.push_back(i);
dsu.setunion(u[i], v[i]);
}
}
if(dsu.setcnt == 1){
if(count_common_roads(vec) == n - 1) return vec;
}
}
}
}
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... |