Submission #244709

#	Time	Username	Problem	Language	Result	Execution time	Memory
244709		santaclaus03	Political Development (BOI17_politicaldevelopment)	C++14	0 / 100	3080 ms	3456 KiB

politicaldevelopment

#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, K; cin >> N >> K;
    vector<bitset<5000>> graph(N);
    for (int i = 0; i < N; ++i) {
        int D; cin >> D;
        for (int j = 0; j < D; ++j) {
            int x; cin >> x;
            graph[i][x] = true;
        }
    }
    int ans = 1;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            if (graph[i][j]) ans = max(ans, 2);
            bitset<5000> x = graph[i];
            x &= graph[j];
            if (x.any()) {
                ans = 3;
            }
        }
    }
    cout << ans << endl;
    return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 38
• Subtask 5: 0 / 23