# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128824 | Rainmaker2627 | Port Facility (JOI17_port_facility) | C++20 | 513 ms | 110808 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
struct dsu {
int n, cc;
vector<int> r, s, d;
dsu(int n) {
this->n=n; cc=n;
r.reserve(n+1);
for (int i = 1; i <= n; ++i) r[i]=i;
s.assign(n+1, 1);
d.assign(n+1, 0);
}
int find(int a) {
if (a==r[a]) return a;
int p=find(r[a]);
d[a]^=d[r[a]];
return r[a]=p;
}
bool unite(int a, int b) {
int ra=find(a), rb=find(b);
if (ra==rb) return d[a]^d[b]==1;
if (s[ra]<s[rb]) swap(ra, rb);
d[rb]=1^d[a]^d[b];
r[rb]=ra; s[ra]+=s[rb]; cc--;
return true;
# | 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... |