Problem:
Score : 300 points

Problem Statement

There are N people numbered 1 to N. Each of them is either an honest person whose testimonies are always correct or an unkind person whose testimonies may be correct or not.

Person i gives A_i testimonies. The j-th testimony by Person i is represented by two integers x_{ij} and y_{ij}. If y_{ij} = 1, the testimony says Person x_{ij} is honest; if y_{ij} = 0, it says Person x_{ij} is unkind.

How many honest persons can be among those N people at most?

Constraints

All values in input are integers.

1 \leq N \leq 15

0 \leq A_i \leq N - 1

1 \leq x_{ij} \leq N

x_{ij} \neq i

x_{ij_1} \neq x_{ij_2} (j_1 \neq j_2)

y_{ij} = 0, 1

Input

Input is given from Standard Input in the following format:

N
A_1
x_{11} y_{11}
x_{12} y_{12}
:
x_{1A_1} y_{1A_1}
A_2
x_{21} y_{21}
x_{22} y_{22}
:
x_{2A_2} y_{2A_2}
:
A_N
x_{N1} y_{N1}
x_{N2} y_{N2}
:
x_{NA_N} y_{NA_N}

Output

Print the maximum possible number of honest persons among the N people.

Sample Input 1

3
1
2 1
1
1 1
1
2 0

Sample Output 1

2

If Person 1 and Person 2 are honest and Person 3 is unkind, we have two honest persons without inconsistencies, which is the maximum possible number of honest persons.

Sample Input 2

3
2
2 1
3 0
2
3 1
1 0
2
1 1
2 0

Sample Output 2

0

Assuming that one or more of them are honest immediately leads to a contradiction.

Sample Input 3

2
1
2 0
1
1 0

Sample Output 3

1

Solution in Ruby (2.7.1) (judge verdict: Accepted)

require 'set'

class Hash
  def push(key, value)
    self[key] = [] if self[key] == nil
    self[key].push(value)
  end
end

class Array
  def lower_bound(value)
    left = -1;
    right = self.length;
    while left + 1 < right
      mid = left + (right - left) / 2;
      if self[mid] >= value
        right = mid
      else
        left = mid
      end
    end
    right
  end

  def unique
    res = [self.first]
    each_cons(2) do |a, b|
      if a != b
        res.push(b)
      end
    end
    res
  end
end

def get_ints
  gets.split.map(&:to_i)
end

def get_ints_minus_one
  get_ints.map { |x| x - 1 }
end

def get_int
  gets.chomp.to_i
end

N = get_int
hash = {}
1.step(N) do |i|
  a = get_int
  hash[i] = {
    honest: [],
    unkind: [],
  }
  a.times do
    x, y = get_ints
    if y == 1
      hash[i][:honest].push(x)
    else
      hash[i][:unkind].push(x)
    end
  end
end

high = N
low = 0

# while high - low > 1
#   mid = low + (high - low) / 2
#   success = false
#   [*1..N].combination(mid).each do |c|
#     honest_set = Set.new
#     unkind_set = Set.new
#     contradiction = false
#
#     c.each do |data|
#       honest_set.merge(hash[data][:honest])
#       unkind_set.merge(hash[data][:unkind])
#     end
#
#     if (c.to_set & honest_set).length != honest_set.length
#       contradiction = true
#     else
#       contradiction = true if (c.to_set & unkind_set).length > 0
#     end
#
#     if !contradiction
#       # 矛盾がない
#       p c
#       success = true
#       break
#     end
#   end
#
#   if success
#     low = mid
#   else
#     high = mid
#   end
# end
#
# puts low

n = N
while n > 0
  mid = n
  success = false
  [*1..N].combination(mid).each do |c|
    honest_set = Set.new
    unkind_set = Set.new
    contradiction = false

    c.each do |data|
      honest_set.merge(hash[data][:honest])
      unkind_set.merge(hash[data][:unkind])
    end

    if (c.to_set & honest_set).length != honest_set.length
      contradiction = true
    else
      contradiction = true if (c.to_set & unkind_set).length > 0
    end

    if !contradiction
      # 矛盾がない
      success = true
      break
    end
  end

  break if success
  n -= 1
end

puts n