Submission #1117529

#	Time	Username	Problem	Language	Result	Execution time	Memory
1117529		stefanneagu	Political Development (BOI17_politicaldevelopment)	C++17	39 / 100	2434 ms	311560 KiB

politicaldevelopment

#include <bits/stdc++.h>

using namespace std;

const int nmax = 5e4 + 2;

vector<int> adj[nmax];
bitset<nmax> f[nmax];

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, k;
  cin >> n >> k;
  for(int i = 1; i <= n; i++) {
    int d;
    cin >> d;
    while(d--) {
      int j;
      cin >> j;
      j++;
      adj[i].push_back(j);
      f[i][j] = 1;
    }
  }
  int ans = 0;
  for(int i = 1; i <= n; i++) {
    if((int) adj[i].size() <= k) {
      for(int bit = 0; bit < (1 << adj[i].size()); bit++) {
        vector<int> v;
        for(int x = 0; (1 << x) <= bit; x++) {
          if(bit & (1 << x)) {
            v.push_back(adj[i][x]);
          }
        }
        v.push_back(i);
        bool ok = 1;
        for(auto it : v) {
          for(auto it2 : v) {
            if(it != it2 && f[it][it2] == 0) {
              ok = 0;
              break;
            }
          }
          if(!ok) {
            break;
          }
        }
        if(ok) {
          ans = max(ans, (int) v.size());
        }
      }
    }
  }
  cout << ans;
	return 0;
}

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