Submission #28019725

Source Code Expand

N,M = gets.split.map(&:to_i)
AB = Array.new(N){[]}
M.times{
	a,b = gets.split.map{_1.to_i-1}
	AB[a]<<b
	AB[b]<<a
}
CD = Array.new(N){[]}
M.times{
	c,d = gets.split.map{_1.to_i-1}
	CD[c]<<d
	CD[d]<<c
}

puts [*0...N].permutation.any?{|i2p|
	N.times.all?{|i|
		AB[i].map{|j| i2p[j] }.sort == CD[i2p[i]].sort
	}
}?'Yes':'No'

Submission Info

Submission Time
Task C - Graph Isomorphism
User ds14050
Language Ruby (2.7.1)
Score 300
Code Size 341 Byte
Status AC
Exec Time 121 ms
Memory 14252 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 22
Set Name Test Cases
Sample example_00.txt, example_01.txt, example_02.txt
All example_00.txt, example_01.txt, example_02.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt
Case Name Status Exec Time Memory
example_00.txt AC 69 ms 14020 KiB
example_01.txt AC 62 ms 14252 KiB
example_02.txt AC 62 ms 14108 KiB
test_00.txt AC 74 ms 14168 KiB
test_01.txt AC 60 ms 14176 KiB
test_02.txt AC 58 ms 14188 KiB
test_03.txt AC 76 ms 14180 KiB
test_04.txt AC 57 ms 13932 KiB
test_05.txt AC 75 ms 14148 KiB
test_06.txt AC 67 ms 14108 KiB
test_07.txt AC 57 ms 14124 KiB
test_08.txt AC 63 ms 14208 KiB
test_09.txt AC 106 ms 14144 KiB
test_10.txt AC 63 ms 14188 KiB
test_11.txt AC 59 ms 14060 KiB
test_12.txt AC 60 ms 14140 KiB
test_13.txt AC 65 ms 14068 KiB
test_14.txt AC 57 ms 13980 KiB
test_15.txt AC 60 ms 13980 KiB
test_16.txt AC 121 ms 14196 KiB
test_17.txt AC 63 ms 13916 KiB
test_18.txt AC 65 ms 14160 KiB