# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
834598 | NemanjaSo2005 | Making Friends on Joitter is Fun (JOI20_joitter2) | C++17 | 1061 ms | 87948 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 ll long long
using namespace std;
const int maxn=1e5+5;
int N,M;
ll rod[maxn],vel[maxn];
ll res;
set<int> cukomp[maxn],kompuc[maxn],compout[maxn],compin[maxn];
vector<int> koji[maxn];
queue<pair<int,int>> Q;
int getpar(int x){
if(rod[x]==x)
return x;
rod[x]=getpar(rod[x]);
return rod[x];
}
void pretvori(int a,int b){
for(auto it=kompuc[a].begin();it!=kompuc[a].end();it++){
cukomp[*it].erase(a);
if(getpar(*it)!=b)
cukomp[*it].insert(b);
}
// cout<<"A"<<endl;
for(auto it=compout[a].begin();it!=compout[a].end();it++){
compin[*it].erase(a);
compin[*it].insert(b);
}
//cout<<"B"<<endl;
for(auto it=compin[a].begin();it!=compin[a].end();it++){
compout[*it].erase(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... |