Submission #14088806
Source Code Expand
N = gets.to_i
P = [nil,*N.times.map{ gets.to_i }]
D = [nil]*(N+1)
D[P.index(-1)] = 0
F = lambda{|a|
b = P[a]
next 1+(D[b]||F[b])
}
1.upto(N){|a|
D[a] = F[a] unless D[a]
}
Q = gets.to_i
Q.times{
a,b = gets.split.map(&:to_i)
(D[a]-D[b]).times{
a = P[a]
}
puts(a==b ? 'Yes' : 'No')
}
Submission Info
| Submission Time | |
|---|---|
| Task | K - Conglomerate |
| User | ds14050 |
| Language | Ruby (2.3.3) |
| Score | 0 |
| Code Size | 313 Byte |
| Status | RE |
| Exec Time | 2108 ms |
| Memory | 29876 KiB |
Judge Result
| Set Name | Sample | All | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 6 | ||||||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | example_01.txt, example_02.txt |
| All | example_01.txt, example_02.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, subtask_01_19.txt, subtask_01_20.txt, subtask_01_21.txt, subtask_01_22.txt, subtask_01_23.txt, subtask_01_24.txt, subtask_01_25.txt, subtask_01_26.txt, subtask_01_27.txt, subtask_01_28.txt, subtask_01_29.txt, subtask_01_30.txt, subtask_01_31.txt, subtask_01_32.txt, subtask_01_33.txt, subtask_01_34.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| example_01.txt | AC | 7 ms | 1788 KiB |
| example_02.txt | AC | 7 ms | 1788 KiB |
| subtask_01_01.txt | AC | 350 ms | 5500 KiB |
| subtask_01_02.txt | AC | 170 ms | 5428 KiB |
| subtask_01_03.txt | AC | 336 ms | 5684 KiB |
| subtask_01_04.txt | AC | 185 ms | 2684 KiB |
| subtask_01_05.txt | AC | 220 ms | 2428 KiB |
| subtask_01_06.txt | AC | 65 ms | 3380 KiB |
| subtask_01_07.txt | AC | 303 ms | 6068 KiB |
| subtask_01_08.txt | AC | 300 ms | 6068 KiB |
| subtask_01_09.txt | AC | 373 ms | 6068 KiB |
| subtask_01_10.txt | AC | 370 ms | 6068 KiB |
| subtask_01_11.txt | RE | 96 ms | 29876 KiB |
| subtask_01_12.txt | TLE | 2108 ms | 5812 KiB |
| subtask_01_13.txt | RE | 98 ms | 29108 KiB |
| subtask_01_14.txt | RE | 97 ms | 28724 KiB |
| subtask_01_15.txt | TLE | 2108 ms | 6396 KiB |
| subtask_01_16.txt | TLE | 2108 ms | 5812 KiB |
| subtask_01_17.txt | RE | 98 ms | 29876 KiB |
| subtask_01_18.txt | RE | 102 ms | 27772 KiB |
| subtask_01_19.txt | RE | 99 ms | 28540 KiB |
| subtask_01_20.txt | TLE | 2108 ms | 5812 KiB |
| subtask_01_21.txt | RE | 97 ms | 29876 KiB |
| subtask_01_22.txt | RE | 98 ms | 29108 KiB |
| subtask_01_23.txt | RE | 96 ms | 29748 KiB |
| subtask_01_24.txt | TLE | 2108 ms | 5372 KiB |
| subtask_01_25.txt | RE | 101 ms | 27644 KiB |
| subtask_01_26.txt | RE | 97 ms | 29236 KiB |
| subtask_01_27.txt | TLE | 2108 ms | 18100 KiB |
| subtask_01_28.txt | TLE | 2108 ms | 5812 KiB |
| subtask_01_29.txt | RE | 98 ms | 29364 KiB |
| subtask_01_30.txt | RE | 97 ms | 29748 KiB |
| subtask_01_31.txt | TLE | 2108 ms | 20148 KiB |
| subtask_01_32.txt | TLE | 2108 ms | 5812 KiB |
| subtask_01_33.txt | RE | 101 ms | 28852 KiB |
| subtask_01_34.txt | RE | 97 ms | 28724 KiB |