oj.uz

Submission #938909

# Submission time Handle Problem Language Result Execution time Memory
938909 2024-03-05T19:35:33 Z vjudge1 Bosses (BOI16_bosses) C++17
0 / 100
 1 ms 348 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++) 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
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -