Submission #421386
Source Code Expand
n,q = gets.split.map(&:to_i) f = Hash[*([*0..(n+1)].map{|x| [x,x]}.flatten)] q.times do p,a,b = gets.split.map(&:to_i) a,b = [a,b].minmax case p when 0 f[b] = f[a] when 1 puts (f[b] == f[a]) ? 'Yes' : 'No' end end
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | satos |
Language | Ruby (1.9.3p550) |
Score | 0 |
Code Size | 258 Byte |
Status | RE |
Exec Time | 1046 ms |
Memory | 15472 KB |
Compile Error
./Main.rb:14: warning: (...) interpreted as grouped expression
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 | 51 ms | 4064 KB |
subtask_01_01.txt | AC | 681 ms | 5500 KB |
subtask_01_02.txt | RE | 158 ms | 15448 KB |
subtask_01_03.txt | AC | 1030 ms | 4072 KB |
subtask_01_04.txt | RE | 159 ms | 15448 KB |
subtask_01_05.txt | AC | 127 ms | 4032 KB |
subtask_01_06.txt | RE | 161 ms | 15448 KB |
subtask_01_07.txt | AC | 1046 ms | 4064 KB |
subtask_01_08.txt | RE | 166 ms | 15464 KB |
subtask_01_09.txt | AC | 53 ms | 4048 KB |
subtask_01_10.txt | RE | 160 ms | 15448 KB |
subtask_01_11.txt | AC | 1044 ms | 4064 KB |
subtask_01_12.txt | RE | 161 ms | 15448 KB |
subtask_01_13.txt | AC | 853 ms | 4440 KB |
subtask_01_14.txt | RE | 159 ms | 15444 KB |
subtask_01_15.txt | AC | 1018 ms | 4064 KB |
subtask_01_16.txt | RE | 163 ms | 15448 KB |
subtask_01_17.txt | RE | 160 ms | 15472 KB |
subtask_01_18.txt | RE | 160 ms | 15444 KB |