Submission #39755560

Source Code Expand

N,M = gets.split.map(&:to_i)
Ready = [0]*N
M.times{
	x,y = gets.split.map{_1.to_i-1}
	Ready[y] |= 1<<x
}
F = Hash.new{|h,g|
	h[g] = Ready.each_with_index.sum{|r,i|
		g[i]<1 && r&g==r ? F[g|1<<i] : 0
	}
}
F[(1<<N)-1] = 1

p F[0]

Submission Info

Submission Time
Task D - 徒競走
User ds14050
Language Ruby (2.7.1)
Score 100
Code Size 242 Byte
Status AC
Exec Time 237 ms
Memory 16684 KiB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 15
AC × 32
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
Subtask1 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt
Case Name Status Exec Time Memory
0_00.txt AC 57 ms 14032 KiB
0_01.txt AC 58 ms 14140 KiB
0_02.txt AC 237 ms 16684 KiB
1_00.txt AC 59 ms 14064 KiB
1_01.txt AC 57 ms 14124 KiB
1_02.txt AC 57 ms 14108 KiB
1_03.txt AC 57 ms 14180 KiB
1_04.txt AC 55 ms 14108 KiB
1_05.txt AC 58 ms 14104 KiB
1_06.txt AC 50 ms 14112 KiB
1_07.txt AC 56 ms 14152 KiB
1_08.txt AC 53 ms 14068 KiB
1_09.txt AC 55 ms 14076 KiB
1_10.txt AC 61 ms 14064 KiB
1_11.txt AC 57 ms 14068 KiB
1_12.txt AC 55 ms 14184 KiB
2_00.txt AC 230 ms 16516 KiB
2_01.txt AC 54 ms 14212 KiB
2_02.txt AC 61 ms 14080 KiB
2_03.txt AC 56 ms 14192 KiB
2_04.txt AC 54 ms 14112 KiB
2_05.txt AC 56 ms 14236 KiB
2_06.txt AC 57 ms 14188 KiB
2_07.txt AC 58 ms 14080 KiB
2_08.txt AC 61 ms 14212 KiB
2_09.txt AC 58 ms 14184 KiB
2_10.txt AC 54 ms 14184 KiB
2_11.txt AC 57 ms 14172 KiB
2_12.txt AC 71 ms 14408 KiB
2_13.txt AC 65 ms 14228 KiB
2_14.txt AC 65 ms 14308 KiB
2_15.txt AC 86 ms 14772 KiB