Submission #245533

#	Time	Username	Problem	Language	Result	Execution time	Memory
245533		Tc14	Political Development (BOI17_politicaldevelopment)	C++17	16 / 100	3086 ms	26488 KiB

politicaldevelopment

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ve vector
typedef long long ll;

int n, k, r;
ve<set<int>> G;
ve<int> S;

void f(int i, int s) {

    bool valid;

    if (i < k) {

        for (int j = s; j < n; j++) {

            valid = true;
            for (int l : S) {
                if (G[l].find(j) == G[l].end() || G[j].find(l) == G[j].end()) {
                    valid = false;
                    break;
                }
            }

            if (valid) {
                S.push_back(j);
                r = max(r, i + 1);
                f(i + 1, j + 1);
                S.pop_back();
            }
        }
    }
}

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int d, a;

    cin >> n >> k;
    G = ve<set<int>>(n);

    for (int i = 0; i < n; i++) {
        cin >> d;
        for (int j = 0; j < d; j++) {
            cin >> a;
            G[i].insert(a);
        }
    }

    r = 0;
    f(0, 0);

    cout << r << endl;

    return 0;
}

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