# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
580075 | jasmin | Stranded Far From Home (BOI22_island) | C++17 | 514 ms | 82752 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 graph{
int n;
vector<vector<int> > adi;
vector<int> chef;
vector<int> s;
vector<set<int> > part;
graph(int a, vector<int>& size){
n=a;
adi.resize(n);
chef.resize(n);
iota(chef.begin(), chef.end(), 0);
s.resize(n);
part.resize(n);
for(int i=0; i<n; i++){
s[i]=size[i];
part[i].insert(i);
}
}
int find(int a){
if(chef[a]==a) return a;
return chef[a]=find(chef[a]);
}
bool unite(int a, int b){
if(find(a)==find(b)){
# | 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... |