Ideone.com | PWif91 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 n, k = STDIN.gets.chomp.split.map(&:to_i) cal = Array.new(n+1,0) k.times do a, b = STDIN.gets.split.map(&:to_i) cal[a-1] = b end ans={} solve = ->(d,b,c) do return 1 if d==n return ans[[d,b,c]] if ans.key?([d,b,c]) res=0 (1..3).each do |i| next unless cal[d] == 0 || cal[d] == i next if c == 2 && b == i res += solve[d+1, i, b =
