oj.uz

답안 #857765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857765 2023-10-06T22:01:38 Z qrno Bosses (BOI16_bosses) C++14
100 / 100
 402 ms 1012 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 5e3;

int best = -1;

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

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

  int done = 0, sum = 0;
  while (!Q.empty()) {
    auto v = Q.front(); Q.pop();
    sum += val[v];
    if (best != -1 && sum >= best) return -1;
    done++;
    for (auto u : G[v]) {
      if (last[u] != s) {
        val[u] = val[v]+1;
        last[u] = s;
        Q.push(u);
      }
    }
  }

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

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

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

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

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1012 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 69 ms 668 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 402 ms 728 KB Output is correct
17 Correct 117 ms 752 KB Output is correct
18 Correct 105 ms 600 KB Output is correct