oj.uz

답안 #981063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
981063 2024-05-12T18:46:53 Z kilkuwu Bosses (BOI16_bosses) C++17
100 / 100
 434 ms 792 KB 
#include <bits/stdc++.h>

#define nl '\n'

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int n;
  std::cin >> n;
  std::vector<std::vector<int>> employee(n);

  for (int i = 0; i < n; i++) {
    int k;
    std::cin >> k;
    for (int j = 0; j < k; j++) {
      int x; std::cin >> x;
      --x;
      employee[x].push_back(i);
    }
  }
  int res = 1e9;

  for (int r = 0; r < n; r++) {
    std::vector<int> dep(n, -1);
    // now what can we do 
    std::queue<int> q;
    q.push(r);
    dep[r] = 1;
    int ans = 1;
    int cnt = 0;
    while (q.size()) {
      int u = q.front();
      q.pop();
      cnt++;

      for (int v : employee[u]) {
        if (dep[v] == -1) {
          dep[v] = dep[u] + 1;
          q.push(v);
          ans += dep[v];
        }
      }
    }

    if (cnt == n) {
      res = std::min(ans, res);
    }
  }

  std::cout << res << nl;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
6 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
6 Correct 1 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 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 73 ms 688 KB Output is correct
15 Correct 4 ms 708 KB Output is correct
16 Correct 432 ms 780 KB Output is correct
17 Correct 432 ms 604 KB Output is correct
18 Correct 434 ms 792 KB Output is correct