# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
632260 | jasmin | Love Polygon (BOI18_polygon) | C++14 | 292 ms | 48728 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>
using namespace std;
#define int long long
struct unionfind{
vector<int> chef;
vector<int> cnt;
unionfind(int n){
chef.resize(n);
iota(chef.begin(), chef.end(), 0);
cnt.resize(n, 1);
}
int find(int a){
if(chef[a]==a) return a;
return chef[a]=find(chef[a]);
}
void unite(int a, int b){
if(find(a)==find(b)) return;
cnt[find(b)]+=cnt[find(a)];
chef[find(a)]=find(b);
}
};
void dfs(int v, vector<vector<int> >& adi, vector<bool>& vis, unionfind& ufind, vector<int>& postorder, bool first){
assert(!vis[v]);
vis[v]=true;
for(auto u: adi[v]){
# | 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... |