oj.uz

Submission #857780

# Submission time Handle Problem Language Result Execution time Memory
857780 2023-10-06T22:28:59 Z qrno Bosses (BOI16_bosses) C++17
100 / 100
 379 ms 728 KB 
#include <iostream>
#include <vector>
#include <array>
#include <bitset>
using namespace std;

constexpr int INF = 1e9;
constexpr int MAXN = 5e3;

int best = INF;

int N;
array<vector<short>, MAXN> G;
array<short, MAXN> val, q;

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 l = 0, r = -1;

    bitset<MAXN> vis;
    q[++r] = i;
    val[i] = 1;
    vis[i] = true;

    int done = 0, sum = 0;
    while (l <= r) {
      auto v = q[l++];
      sum += val[v];
      if (sum >= best) break;
      done++;
      for (auto u : G[v]) {
        if (!vis[u]) {
          q[++r] = u;
          val[u] = val[v]+1;
          vis[u] = true;
        }
      }
    }
    if (done < N) continue;

    best = min(best, sum);
  }

  cout << best << '\n';
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 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 344 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 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 344 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 64 ms 648 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 379 ms 696 KB Output is correct
17 Correct 113 ms 604 KB Output is correct
18 Correct 91 ms 728 KB Output is correct