Submission #1495725


Source Code Expand

#include<functional>
#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define pf push_front
#define pb push_back
#define int long long
using namespace std;
const int INF=1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};


int tree[100005];
int root(int x){
  return tree[x]==x?x:tree[x]=root(tree[x]);
}
int unite(int a,int b){
  tree[root(a)]=root(b);
  return 0;
}

signed main(){
  int n,q;
  cin>>n>>q;
  rep(i,n)tree[i]=i;
  while(q--){
    int a,b,c;
    cin>>a>>b>>c;
    b--;c--;
    if(a){
      cout<<(root(b)==root(c)?"YES":"NO")<<endl;
    }else{
      unite(b,c);
    }
  }
  return 0;
}

Submission Info

Submission Time
Task B - Union Find
User fuu32
Language C++14 (GCC 5.4.1)
Score 100
Code Size 853 Byte
Status AC
Exec Time 155 ms
Memory 1920 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 60
Set Name Test Cases
Sample 0-sample-1, 0-sample-2
All 0-sample-1, 0-sample-2, 1-random-00, 1-random-01, 1-random-02, 1-random-03, 1-random-04, 1-random-05, 1-random-06, 1-random-07, 1-random-08, 1-random-09, 1-random-10, 1-random-11, 1-random-12, 1-random-13, 1-random-14, 1-random-15, 1-random-16, 1-random-17, 1-random-18, 1-random-19, 1-random-20, 1-random-21, 1-random-22, 1-random-23, 1-random-24, 1-random-25, 1-random-26, 1-random-27, 1-random-28, 1-random-29, 2-killer-00, 2-killer-01, 2-killer-02, 2-killer-03, 2-killer-04, 2-killer-05, 2-killer-06, 2-killer-07, 2-killer-08, 2-killer-09, 2-killer-10, 2-killer-11, 3-killer-00, 3-killer-01, 3-killer-02, 3-killer-03, 3-killer-04, 3-killer-05, 3-killer-06, 3-killer-07, 3-killer-08, 3-killer-09, 3-killer-10, 3-killer-11, 3-killer-12, 3-killer-13, 3-killer-14, 3-killer-15
Case Name Status Exec Time Memory
0-sample-1 AC 1 ms 256 KB
0-sample-2 AC 1 ms 256 KB
1-random-00 AC 24 ms 768 KB
1-random-01 AC 58 ms 896 KB
1-random-02 AC 144 ms 640 KB
1-random-03 AC 124 ms 768 KB
1-random-04 AC 92 ms 1024 KB
1-random-05 AC 35 ms 640 KB
1-random-06 AC 44 ms 768 KB
1-random-07 AC 110 ms 384 KB
1-random-08 AC 74 ms 640 KB
1-random-09 AC 19 ms 640 KB
1-random-10 AC 145 ms 1152 KB
1-random-11 AC 63 ms 384 KB
1-random-12 AC 3 ms 512 KB
1-random-13 AC 113 ms 640 KB
1-random-14 AC 5 ms 256 KB
1-random-15 AC 146 ms 1152 KB
1-random-16 AC 118 ms 768 KB
1-random-17 AC 116 ms 1024 KB
1-random-18 AC 20 ms 896 KB
1-random-19 AC 46 ms 896 KB
1-random-20 AC 141 ms 768 KB
1-random-21 AC 70 ms 768 KB
1-random-22 AC 25 ms 896 KB
1-random-23 AC 59 ms 384 KB
1-random-24 AC 146 ms 640 KB
1-random-25 AC 74 ms 640 KB
1-random-26 AC 47 ms 384 KB
1-random-27 AC 29 ms 512 KB
1-random-28 AC 64 ms 640 KB
1-random-29 AC 139 ms 640 KB
2-killer-00 AC 154 ms 1280 KB
2-killer-01 AC 151 ms 1152 KB
2-killer-02 AC 152 ms 1280 KB
2-killer-03 AC 152 ms 1152 KB
2-killer-04 AC 152 ms 1152 KB
2-killer-05 AC 76 ms 1024 KB
2-killer-06 AC 76 ms 1024 KB
2-killer-07 AC 79 ms 1024 KB
2-killer-08 AC 76 ms 1024 KB
2-killer-09 AC 76 ms 1024 KB
2-killer-10 AC 64 ms 1024 KB
2-killer-11 AC 63 ms 1024 KB
3-killer-00 AC 155 ms 1920 KB
3-killer-01 AC 152 ms 1920 KB
3-killer-02 AC 153 ms 1920 KB
3-killer-03 AC 153 ms 1920 KB
3-killer-04 AC 153 ms 1920 KB
3-killer-05 AC 151 ms 1920 KB
3-killer-06 AC 154 ms 1920 KB
3-killer-07 AC 155 ms 1920 KB
3-killer-08 AC 151 ms 1152 KB
3-killer-09 AC 152 ms 1152 KB
3-killer-10 AC 152 ms 1152 KB
3-killer-11 AC 154 ms 1152 KB
3-killer-12 AC 154 ms 1152 KB
3-killer-13 AC 151 ms 1152 KB
3-killer-14 AC 153 ms 1152 KB
3-killer-15 AC 153 ms 1152 KB