oj.uz

Submission #938910

# Submission time Handle Problem Language Result Execution time Memory
938910 2024-03-05T19:41:27 Z vjudge1 Bosses (BOI16_bosses) C++17
100 / 100
 392 ms 848 KB 
#include<bits/stdc++.h>
using namespace std;

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

int N;
vector<int> children[MAXN + 5];
int vis[MAXN + 5];
queue<int> BFS;

int bfs(int start) {
  while (!BFS.empty()) BFS.pop();
  memset(vis, -1, sizeof vis);

  BFS.push(start);
  vis[start] = 1;
  while (!BFS.empty()) {
    int cur = BFS.front(); BFS.pop();
    for (auto next: children[cur]) {
      if (vis[next] != -1) continue;
      vis[next] = vis[cur] + 1;
      BFS.push(next);
    }
  }

  int ans = 0;
  for (int i = 0; i < N; i++) {
    if (vis[i] == -1) return INF;
    ans += vis[i];
  }
  return ans;
}

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  cin >> N;
  for (int i = 0; i < N; i++) {
    int sz; cin >> sz;
    while (sz--) {
      int u; cin >> u; u--;
      children[u].push_back(i);
    }
  }
  int ans = INF;
  for (int i = 0; i < N; i++) ans = min(ans, bfs(i));
  cout << ans << endl;
  return 0;
}

Subtask #1
22.0 / 22.0

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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 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 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 70 ms 680 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 392 ms 764 KB Output is correct
17 Correct 375 ms 848 KB Output is correct
18 Correct 378 ms 604 KB Output is correct