Submission #3982796


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ma 100010
int n,m,c;
int oya[ma],fukasa[ma];
int p[ma],x[ma],y[ma];
int find(int i){
  if(oya[i]==i){
    return i;
  }else{
    return oya[i]=find(oya[i]);
  }
}
void unite(int i,int j){
  i=find(i);
  j=find(j);
  if(i==j) return;
  if(fukasa[i]<fukasa[j]){
    oya[i]=j;
  }else{
    oya[j]=i;
    if(fukasa[i]==fukasa[j]) fukasa[i]++;
  }
}
int main(){
  cin>>n>>m;
  for(int i=1;i<=n;i++){
    cin>>p[i];
    oya[p[i]]=p[i];
  }
  for(int i=0;i<m;i++){
    cin>>x[i]>>y[i];
    unite(x[i],y[i]);
  }
  for(int i=1;i<=n;i++){
    if(find(i)==find(p[i])) c++;
  }
  cout<<c<<endl;
}

Submission Info

Submission Time
Task D - Equals
User occhan
Language C++14 (GCC 5.4.1)
Score 400
Code Size 676 Byte
Status AC
Exec Time 112 ms
Memory 2176 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 23
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
0_003.txt AC 1 ms 256 KB
1_004.txt AC 53 ms 1024 KB
1_005.txt AC 107 ms 2048 KB
1_006.txt AC 112 ms 2176 KB
1_007.txt AC 1 ms 256 KB
1_008.txt AC 1 ms 256 KB
1_009.txt AC 1 ms 256 KB
1_010.txt AC 1 ms 256 KB
1_011.txt AC 1 ms 256 KB
1_012.txt AC 1 ms 256 KB
1_013.txt AC 2 ms 256 KB
1_014.txt AC 4 ms 256 KB
1_015.txt AC 2 ms 256 KB
1_016.txt AC 2 ms 256 KB
1_017.txt AC 2 ms 256 KB
1_018.txt AC 48 ms 1024 KB
1_019.txt AC 37 ms 1024 KB
1_020.txt AC 37 ms 1280 KB
1_021.txt AC 37 ms 1408 KB
1_022.txt AC 110 ms 2176 KB