Submission #4022533


Source Code Expand

#include <iostream>
using namespace std;
typedef long long ll;
ll n,m,s[100000],x,y,r[100001],fa[1000001],ans;
ll find(ll x){
    if(fa[x]==x)return x;
    return fa[x]=find(fa[x]);
}
void uni(ll x,ll y){
    x=find(x);
    y=find(y);
    if(x==y)return ;
    if(r[x]<r[y])fa[x]=y;
    else fa[y]=x;
    if(r[x]==r[y])r[x]++;
}
int main(void){
    cin>>n>>m;
    for(int i=0;i<n;i++){
        fa[i+1]=i+1;
        cin>>s[i];
    }
    for(int i=0;i<m;i++){
        cin>>x>>y;
        uni(x,y);
    }
    for(int i=0;i<n;i++){
        if(find(i+1)==find(fa[s[i]]))ans++;
    }
    cout<<ans<<endl;
}

Submission Info

Submission Time
Task D - Equals
User alorie
Language C++14 (GCC 5.4.1)
Score 400
Code Size 630 Byte
Status AC
Exec Time 90 ms
Memory 4224 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 2 ms 2304 KB
0_001.txt AC 2 ms 2304 KB
0_002.txt AC 2 ms 2304 KB
0_003.txt AC 2 ms 2304 KB
1_004.txt AC 43 ms 2304 KB
1_005.txt AC 85 ms 4096 KB
1_006.txt AC 90 ms 4224 KB
1_007.txt AC 2 ms 2304 KB
1_008.txt AC 2 ms 2304 KB
1_009.txt AC 2 ms 2304 KB
1_010.txt AC 2 ms 2304 KB
1_011.txt AC 2 ms 2304 KB
1_012.txt AC 2 ms 2304 KB
1_013.txt AC 2 ms 2304 KB
1_014.txt AC 4 ms 2304 KB
1_015.txt AC 2 ms 2304 KB
1_016.txt AC 2 ms 2304 KB
1_017.txt AC 3 ms 2304 KB
1_018.txt AC 40 ms 2304 KB
1_019.txt AC 31 ms 3840 KB
1_020.txt AC 30 ms 3968 KB
1_021.txt AC 31 ms 4224 KB
1_022.txt AC 89 ms 4224 KB