oj.uz

Submission #891630

# Submission time Handle Problem Language Result Execution time Memory
891630 2023-12-23T11:32:25 Z ind1v Bosses (BOI16_bosses) C++11
100 / 100
 412 ms 796 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 5e3 + 5;

int n;
vector<int> g[N];
bool vis[N];
int lv[N];
int ans = 1e9;

void bfs(int u) {
  memset(lv, -1, sizeof(lv));
  lv[u] = 1;
  queue<int> q;
  q.push(u);
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (int nxt : g[v]) {
      if (lv[nxt] == -1) {
        lv[nxt] = lv[v] + 1;
        q.push(nxt);
      }
    }
  }
  if (*min_element(lv + 1, lv + n + 1) > -1) {
    ans = min(ans, accumulate(lv + 1, lv + n + 1, 0));
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int k;
    cin >> k;
    for (int j = 1; j <= k; j++) {
      int x;
      cin >> x;
      g[x].emplace_back(i);
    }
  }
  for (int i = 1; i <= n; i++) {
    bfs(i);
  }
  cout << ans << '\n';
  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 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 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 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 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 344 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 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 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 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 344 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 2 ms 732 KB Output is correct
14 Correct 92 ms 600 KB Output is correct
15 Correct 26 ms 604 KB Output is correct
16 Correct 412 ms 600 KB Output is correct
17 Correct 393 ms 796 KB Output is correct
18 Correct 403 ms 796 KB Output is correct