Submission #423659
Source Code Expand
#include<stdio.h> int main(){ int n,m,a,b,c,d[100000]={0}; int p[100000]={0}; scanf("%d %d",&n,&m); while(m--){ scanf("%d %d %d",&c,&a,&b); if(a==b){ if(c)printf("Yes\n"); continue; } for(a++;p[a];a=p[a]); for(b++;p[b];b=p[b]); if(c){ if(b-a)printf("No\n"); else printf("Yes\n"); } else{ if(d[a]< d[b])p[a]=b; if(d[a]>=d[b])p[b]=a; if(d[a]==d[b])d[a]++; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | yuiop |
Language | C (GCC 4.9.2) |
Score | 0 |
Code Size | 487 Byte |
Status | TLE |
Exec Time | 5033 ms |
Memory | 1568 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:5:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&n,&m); ^ ./Main.c:7:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d %d",&c,&a,&b); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
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 | 24 ms | 1552 KB |
subtask_01_01.txt | AC | 85 ms | 1560 KB |
subtask_01_02.txt | AC | 25 ms | 1564 KB |
subtask_01_03.txt | AC | 133 ms | 1564 KB |
subtask_01_04.txt | AC | 134 ms | 1440 KB |
subtask_01_05.txt | AC | 33 ms | 1564 KB |
subtask_01_06.txt | AC | 36 ms | 1560 KB |
subtask_01_07.txt | AC | 138 ms | 1560 KB |
subtask_01_08.txt | AC | 130 ms | 1500 KB |
subtask_01_09.txt | AC | 26 ms | 1440 KB |
subtask_01_10.txt | AC | 25 ms | 1440 KB |
subtask_01_11.txt | AC | 136 ms | 1440 KB |
subtask_01_12.txt | AC | 129 ms | 1444 KB |
subtask_01_13.txt | AC | 105 ms | 1448 KB |
subtask_01_14.txt | AC | 26 ms | 1568 KB |
subtask_01_15.txt | AC | 126 ms | 1448 KB |
subtask_01_16.txt | AC | 132 ms | 1436 KB |
subtask_01_17.txt | TLE | 5033 ms | 1500 KB |
subtask_01_18.txt | TLE | 5032 ms | 1568 KB |