Submission #10988505


Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int fa[10010];//fa[i]表示i的父亲,祖先的父亲即为自己
void init(){//初始化
    for(int i=0;i<10000;i++) {
        fa[i]=i;//每一个人都是他家族的祖先
    }
}
int find(int x){//找祖先 
    return fa[x]=fa[x]==x?x:find(fa[x]);
}
bool ask(int x,int y){//查询 
    return find(x)==find(y);//如果x的祖先也是y的祖先,那么他们就是亲戚 
}
void uni(int x,int y){//合并两个家族 
    fa[find(x)]=find(y);//让x的祖先当y的祖先的孩子,就完成了x,y两家族的合并 
}
int main(){
    int n,m,x,y,z;
    init();
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&z,&x,&y);
        if(z==1) uni(x,y);
        else puts(ask(x,y)?"Y":"N");
    }
    return 0;
}

Submission Info

Submission Time
Task B - Union Find
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 0
Code Size 884 Byte
Status RE
Exec Time 99 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
./Main.cpp:27:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&z,&x,&y);
                                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 1
WA × 9
RE × 10
Set Name Test Cases
Sample 00_sample_01.txt
All 00_sample_01.txt, subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_01_18.txt
Case Name Status Exec Time Memory
00_sample_01.txt WA 1 ms 256 KB
subtask_01_01.txt WA 26 ms 256 KB
subtask_01_02.txt RE 97 ms 256 KB
subtask_01_03.txt WA 35 ms 256 KB
subtask_01_04.txt RE 97 ms 256 KB
subtask_01_05.txt WA 4 ms 256 KB
subtask_01_06.txt RE 97 ms 256 KB
subtask_01_07.txt WA 40 ms 256 KB
subtask_01_08.txt RE 98 ms 256 KB
subtask_01_09.txt WA 1 ms 256 KB
subtask_01_10.txt RE 97 ms 256 KB
subtask_01_11.txt WA 36 ms 256 KB
subtask_01_12.txt RE 98 ms 256 KB
subtask_01_13.txt WA 33 ms 256 KB
subtask_01_14.txt RE 98 ms 256 KB
subtask_01_15.txt WA 38 ms 256 KB
subtask_01_16.txt RE 98 ms 256 KB
subtask_01_17.txt RE 99 ms 256 KB
subtask_01_18.txt RE 97 ms 256 KB