# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
766875 | onjo0127 | Making Friends on Joitter is Fun (JOI20_joitter2) | C++17 | 1287 ms | 160660 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 sz(V) ((int)V.size())
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int P[100009];
set<int> I[100009], A[100009], II[100009], OO[100009];
ll ans;
int root(int x) {
if(P[x] == x) return x;
return P[x] = root(P[x]);
}
ll f(int x) {
return 1LL * sz(A[x]) * (sz(I[x]) + sz(A[x]) - 1);
}
void merg(int u, int v) {
u = root(u); v = root(v);
if(u == v) return;
if(sz(A[u]) + sz(I[u]) + sz(II[u]) + sz(OO[u]) > sz(A[v]) + sz(I[v]) + sz(II[v]) + sz(OO[v])) swap(u, v);
ans -= f(u) + f(v);
for(auto& it: A[u]) if(I[v].find(it) != I[v].end()) I[v].erase(it);
for(auto& it: I[u]) if(A[v].find(it) == A[v].end()) I[v].insert(it);
for(auto& it: A[u]) A[v].insert(it);
set<int> Q;
for(auto& it: II[u]) if(it != u && it != v) {
OO[it].erase(u);
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... |