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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.ArrayList;
import java.util.List;
import java.util.Set;
import java.util.HashMap;
import java.util.Scanner;
import java.util.Map;

public class Main {

    private static final String HONEST = "honesty";
    private static final String LIER = "lier";

    public static void main(String[] args) {
        Map<Integer, String> stateMap = new HashMap<>();
        Map<Integer, Map<Integer, String>> tesinomyMap = new HashMap<>();
        int peopleCount = 1;
        int honestyMax = 0;

        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        int N = Integer.parseInt(S);
        int[] peoples = new int[N];

        for (int i = 1; i <= N; i++) {
            stateMap.put(i, "");
            peoples[i - 1] = i;
        }

        while (sc.hasNext()) {
            int m = Integer.parseInt(sc.nextLine());
            Map<Integer, String> tesinomy = new HashMap<>();
            String division = LIER;
            // System.out.println("people " + peopleCount + " said....");
            for (int i = 0; i < m; i++) {
                String[] said = sc.nextLine().split(" ");
                if (said[1].equals("1")) {
                    division = HONEST;
                } else {
                    division = LIER;
                }

                // System.out.println("said: " + said[0] + ", division : " + division);
                tesinomy.put(Integer.parseInt(said[0]), division);
            }
            tesinomyMap.put(peopleCount, tesinomy);
            peopleCount++;
            if (peopleCount >= N + 1) {
                break;
            }

        }
        sc.close();

        // bit全探索
        for (int i = 0; i < 1 << N/** Math.pow(N, 2) */
        ; i++) {
            List<Integer> honesties = new ArrayList<>();
            for (Integer integer : stateMap.keySet()) {
                stateMap.put(integer, LIER);
            }
            for (int j = 0; j < N; j++) {
                if ((1 & i >> j) == 1) {
                    honesties.add(peoples[j]);
                }
            }
            if (honesties.size() == 0) {
                continue;
            }

            for (Integer honestaMan : honesties) {
                stateMap.put(honestaMan, HONEST);
            }

            boolean isOK = true;
            for (Integer honesty : honesties) {
                // boolean isHonesty = false;
                // if (honesties.contains(honesty)) {
                // isHonesty = true;
                // }
                Map<Integer, String> tesinomy = tesinomyMap.get(honesty);
                Set<Integer> ps = tesinomy.keySet();
                // String own = stateMap.get(honesty);
                // String ownstate = isHonesty ? HONEST : LIER;
                // if (own.equals("")) {
                // stateMap.put(k, ownstate);
                // } else {
                // if (!own.equals(ownstate)) {
                // isOK = false;
                // break;
                // }
                // }
                for (Integer judger : ps) {
                    String state = stateMap.get(judger);
                    String saidState = tesinomy.get(judger);
                    // if (!isHonesty) {
                    // if (saidState.equals(HONEST)) {
                    // saidState = LIER;
                    // } else {
                    // saidState = HONEST;
                    // }
                    // }
                    // if (state.equals("")) {
                    // stateMap.put(judger, saidState);
                    // } else {
                    if (!state.equals(saidState)) {
                        isOK = false;
                        break;
                    }
                    // }
                }
                if (!isOK) {
                    break;
                }
            }
            if (isOK) {
                if (honestyMax <= honesties.size()) {
                    honestyMax = honesties.size();
                }
            }
        }

        System.out.println(honestyMax);
    }

}