Submission #520690

# Submission time Handle Problem Language Result Execution time Memory
520690 2022-01-30T20:20:12 Z Alex_tz307 Bosses (BOI16_bosses) C++17
100 / 100
729 ms 588 KB
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f

using namespace std;

void minSelf(int &x, int y) {
  if (y < x) {
    x = y;
  }
}

void testCase() {
  int n;
  cin >> n;
  vector<vector<int>> g(n + 1);
  for (int v = 1; v <= n; ++v) {
    int k;
    cin >> k;
    for (int i = 0; i < k; ++i) {
      int u;
      cin >> u;
      g[u].emplace_back(v);
    }
  }
  int ans = INF;
  for (int root = 1; root <= n; ++root) {
    vector<int> level(n + 1);
    level[root] = 1;
    queue<int> q;
    q.emplace(root);
    while (!q.empty()) {
      int u = q.front();
      q.pop();
      for (int v : g[u]) {
        if (!level[v]) {
          level[v] = level[u] + 1;
          q.emplace(v);
        }
      }
    }
    if (*min_element(level.begin() + 1, level.end()) != 0) {
      minSelf(ans, accumulate(level.begin() + 1, level.end(), 0));
    }
  }
  cout << ans << '\n';
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 284 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 284 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 5 ms 332 KB Output is correct
13 Correct 5 ms 332 KB Output is correct
14 Correct 183 ms 508 KB Output is correct
15 Correct 30 ms 460 KB Output is correct
16 Correct 603 ms 588 KB Output is correct
17 Correct 717 ms 588 KB Output is correct
18 Correct 729 ms 588 KB Output is correct