# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
580176 | wdjpng | Stranded Far From Home (BOI22_island) | C++17 | 1097 ms | 38360 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>
#define int long long
#define double long double
#define rep(i,n) for(int i =0; i<n; i++)
#define all(a) a.begin(),a.end()
using namespace std;
int n,m;
vector<int>s;
vector<vector<int>>E;
vector<int>chef(2e5+1);
struct uni
{
int sum=0;
set<int>bord;
};
vector<uni>unis(2e5+1);
int find(int a)
{
if(a==chef[a]) return a;
return chef[a]=find(chef[a]);
}
void unite(int a, int b) {
a=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... |