Submission #10091090


Source Code Expand

#include<iostream>
using namespace std;
const int MAXN=10010;
int n,m,z,x,y;
struct unionFind{
    int fa[MAXN];
    unionFind(){
        for(int i=1;i<=MAXN;i++) fa[i]=i;
    }
    int find(int k){
        return fa[k]=fa[k]==k?k:find(fa[k]);
    }
    void uni(int x,int y){
        fa[find(x)]=find(y);
    }
    bool ask(int x,int y){
        return find(x)==find(y);
    }
}U;
int main(){
    cin>>n>>m;
    while(m--){
        cin>>z>>x>>y;
        if(z==0) U.uni(x,y);
        else cout<<(U.ask(x,y)?"Yes":"No")<<endl;
    }
    return 0;
}

Submission Info

Submission Time
Task B - Union Find
User luogu_bot1
Language C++ (GCC 5.4.1)
Score 0
Code Size 574 Byte
Status RE
Exec Time 442 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘(static initializers for ./Main.cpp)’:
./Main.cpp:8:41: warning: iteration 10009u invokes undefined behavior [-Waggressive-loop-optimizations]
         for(int i=1;i<=MAXN;i++) fa[i]=i;
                                         ^
./Main.cpp:8:22: note: containing loop
         for(int i=1;i<=MAXN;i++) fa[i]=i;
                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 1
AC × 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 AC 1 ms 256 KB
subtask_01_01.txt AC 281 ms 640 KB
subtask_01_02.txt RE 96 ms 256 KB
subtask_01_03.txt AC 421 ms 1024 KB
subtask_01_04.txt RE 97 ms 256 KB
subtask_01_05.txt AC 25 ms 256 KB
subtask_01_06.txt RE 98 ms 256 KB
subtask_01_07.txt AC 442 ms 896 KB
subtask_01_08.txt RE 98 ms 256 KB
subtask_01_09.txt AC 1 ms 256 KB
subtask_01_10.txt RE 97 ms 256 KB
subtask_01_11.txt AC 422 ms 896 KB
subtask_01_12.txt RE 96 ms 256 KB
subtask_01_13.txt AC 370 ms 768 KB
subtask_01_14.txt RE 96 ms 256 KB
subtask_01_15.txt AC 438 ms 896 KB
subtask_01_16.txt RE 97 ms 256 KB
subtask_01_17.txt RE 100 ms 256 KB
subtask_01_18.txt RE 98 ms 256 KB