# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
359662 | Nima_Naderi | Making Friends on Joitter is Fun (JOI20_joitter2) | C++14 | 1438 ms | 129644 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.
///In the name of GOD
//#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 4e5 + 10;
ll n, m, ans, pnt;
ll Par[MXN], Sz[MXN];
set<ll> In[MXN], Out[MXN], To[MXN], Comp[MXN];
vector<pair<ll, ll>> Q;
ll Find(ll x){
return (x == Par[x] ? x : Par[x] = Find(Par[x]));
}
void add(ll u, ll v){
if(u == v) return;
Out[u].insert(v), In[v].insert(u);
if(In[u].find(v) != In[u].end()) Q.push_back({u, v});
}
void Union(ll x, ll y){
x = Find(x), y = Find(y);
if(x == y) return;
if(Sz[x] < Sz[y]) swap(x, y);
/*
cout << "====================\n";
cout << x << ' ' << y << '\n';
cout << ans << '\n';
cout << To[x].size() << '\n';
cout << To[y].size() << '\n';
cout << "====================\n";
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... |