제출 #857763

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

bosses

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

const int MAXN = 5e3;

int N;
array<vector<int>, MAXN> G;
array<int, MAXN> val, last;

int bfs(int src) {
  fill(begin(val), end(val), -1);

  queue<int> Q;
  val[src] = 1;
  last[src] = src;
  Q.push(src);

  int done = 0;
  int total = 0;
  while (!Q.empty()) {
    auto v = Q.front(); Q.pop();
    total += val[v];
    done++;
    for (auto u : G[v]) {
      if (last[u] != src) {
        val[u] = val[v]+1;
        last[u] = src;
        Q.push(u);
      }
    }
  }

  if (done < N) return -1;
  return total;
}

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

  cin >> N;
  for (int i = 0; i < N; i++) {
    int K; cin >> K;
    G[i].reserve(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