# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43272 | ffresh | 우호 조약 체결 (JOI14_friends) | C++14 | 127 ms | 8156 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>
using namespace std;
const int N = 1e5+15;
int par[N],sz[N],esz[N];
vector<int> adj[N];
int f(int a){
if(a==par[a])return a;
return par[a]= f(par[a]);
}
void merge(int a,int b){
a= f(a),b= f(b);
if(a!=b){
par[b]= a;
sz[a]+=sz[b];
esz[a]+=esz[b];
}
++esz[a];
}
bool vis[N];
void dfs(int root){
vis[root]= 1;
for(int i=0;i<adj[root].size();++i){
int u = adj[root][i];
if(!vis[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... |