제출 #857759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
857759		qrno	Bosses (BOI16_bosses)	C++17	100 / 100	548 ms	860 KiB

bosses

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

#define int long long
#define all(v) begin(v), end(v)

int N;
vector<vector<int>> G;

int bfs(int v) {
  vector<int> val(N, -1);
  queue<pair<int, int>> Q;
  val[v] = 1;
  Q.push({v, val[v]});

  while (!Q.empty()) {
    auto [v, x] = Q.front(); Q.pop();
    for (auto u : G[v]) {
      if (val[u] == -1) {
        val[u] = x+1;
        Q.push({u, val[u]});
      }
    }
  }

  if (*min_element(all(val)) == -1) return -1;
  return accumulate(all(val), 0LL);
}

signed main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> N;
  G.resize(N);
  for (int i = 0; i < N; i++) {
    int K; cin >> K;
    while (K--) {
      int u; cin >> u; u--;
      G[u].push_back(i);
    }
  }

  int best = -1;
  for (int i = 0; i < N; i++) {
    int sum = bfs(i);
    if (sum == -1) continue;
    if (best == -1 || best > sum)
      best = sum;
  }
  cout << best << endl;
}

• Subtask 1: 22 / 22
• Subtask 2: 45 / 45
• Subtask 3: 33 / 33