Submission #11320006

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main(){
    int N;
    cin >> N;
    vector<vector<pair<int, bool> > > person(N);
    for(int i = 0;i < N;i++){
        int A;
        cin >> A;
        for(int j = 0;j < A;j++){
            int B;
            bool C;
            cin >> B >> C;
            person[i].push_back(make_pair(B,C));
        }
    }
    int max = 0;
    queue<int> que;
    for(int i = 0;i < N;i++){
        int count = 0;
        vector<int> is_visited(N,0);
        is_visited[i] = 1;
        que.push(i);
        while(!que.empty()){
            int a = que.front();
            que.pop();
            count++;
            for(auto p : person[a]){
                if(p.second && !is_visited[p.first - 1] == 0){
                    que.push(p.first);
                    is_visited[p.first - 1] = 1;
                }else if(p.second && is_visited[p.first - 1] == -1){
                    count = 0;
                    for(int j = 0;j < que.size();j++){
                        que.pop();
                    }
                    break;
                }else if(!p.second && is_visited[p.first - 1] == 0){
                    is_visited[p.first - 1] = -1;
                }
            }
        }
        max = std::max(max, count);
    }
    cout << max << endl;
}

Submission Info

Judge Result