Submission #807295

#	Time	Username	Problem	Language	Result	Execution time	Memory
807295		tch1cherin	Political Development (BOI17_politicaldevelopment)	C++17	16 / 100	34 ms	25292 KiB

politicaldevelopment

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

const int MAX_N = 5005;
bool adj[MAX_N][MAX_N] = {};

int main() {
  int N, K;
  cin >> N >> K;
  bool good = false;
  vector<vector<int>> G(N);
  for (int i = 0; i < N; i++) {
    int d;
    cin >> d;
    if (d != 0) {
      good = true;
    }
    G[i].resize(d);
    for (int j = 0; j < d; j++) {
      cin >> G[i][j];
      adj[i][G[i][j]] = true;
    }
  }
  if (K == 3) {
    for (int i = 0; i < N; i++)
      for (int j : G[i])
        for (int k : G[j])
          if (adj[i][k]) {
            cout << 3 << "\n";
            exit(0);
          }
  }
  cout << (good && K >= 2 ? 2 : 1) << "\n";
}

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