Submission #8121130

Source Code Expand

require 'set'
(N, M), P, *E = $<.map{|ln|ln.split.map(&:to_i)}

P.unshift(0)
IP = [0]*(N+1)
P.each_with_index{|p,i| IP[p]=i }

G = [nil]*(N+1)
E.each{|x,y|
	(G[x] ||= Set.new) << P[x] << P[y]
	G[y].each{|p|
		G[IP[p]] = G[x] << p
	} if G[y]
	G[y] = G[x]
}

p (1..N).count{|i|
	P[i] == i or G[i] && G[i].include?(i)
}

Submission Info

Submission Time
Task D - Equals
User ds14050
Language Ruby (2.3.3)
Score 0
Code Size 336 Byte
Status TLE
Exec Time 2115 ms
Memory 131988 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 4
AC × 19
TLE × 4
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt
Case Name Status Exec Time Memory
0_000.txt AC 10 ms 2044 KiB
0_001.txt AC 9 ms 1916 KiB
0_002.txt AC 9 ms 1916 KiB
0_003.txt AC 9 ms 1916 KiB
1_004.txt TLE 2108 ms 14972 KiB
1_005.txt TLE 2109 ms 24484 KiB
1_006.txt AC 753 ms 95892 KiB
1_007.txt AC 9 ms 1916 KiB
1_008.txt AC 9 ms 1916 KiB
1_009.txt AC 9 ms 1916 KiB
1_010.txt AC 9 ms 1916 KiB
1_011.txt AC 9 ms 1916 KiB
1_012.txt AC 10 ms 1916 KiB
1_013.txt AC 28 ms 2172 KiB
1_014.txt AC 123 ms 2812 KiB
1_015.txt AC 10 ms 2044 KiB
1_016.txt AC 10 ms 2044 KiB
1_017.txt AC 51 ms 6268 KiB
1_018.txt TLE 2109 ms 20348 KiB
1_019.txt AC 69 ms 10532 KiB
1_020.txt AC 70 ms 10532 KiB
1_021.txt AC 72 ms 11044 KiB
1_022.txt TLE 2115 ms 131988 KiB