# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
219101 | alexandra_udristoiu | Making Friends on Joitter is Fun (JOI20_joitter2) | C++14 | 1760 ms | 56084 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<iostream>
#include<set>
#include<vector>
#define DIM 100005
using namespace std;
int n, q, i, j, x, y, r1, r2, ry;
long long sol;
int r[DIM], num[DIM], nv[DIM];
vector<int> v[DIM], vr[DIM];
set<int> s[DIM], sr[DIM];
int rad(int x){
while(r[x] > 0){
x = r[x];
}
return x;
}
void uneste(int r1, int r2){
int i, j, x, y, rx, ry;
if(q == 1){
int abc = 0;
}
if(r[r1] > 0 || r[r2] > 0){
return;
}
if(r[r1] > r[r2]){
swap(r1, r2);
}
sol -= num[r1] * 1LL * (num[r1] - 1) + num[r1] * 1LL * nv[r1];
sol -= num[r2] * 1LL * (num[r2] - 1) + num[r2] * 1LL * nv[r2];
for(i = 0; i < vr[r2].size(); i++){
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... |