oj.uz

Submission #279695

# Submission time Handle Problem Language Result Execution time Memory
279695 2020-08-22T09:55:58 Z erray Bosses (BOI16_bosses) C++17
100 / 100
 1147 ms 1224 KB 
// author: erray
#include<bits/stdc++.h>
 
using namespace std;
 
int main () {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<vector<int>> g(n);
  for (int i = 0; i < n; ++i) {
    int k;
    cin >> k;
    for (int j = 0; j < k; ++j) {
      int x;
      cin >> x;
      --x;
      g[x].push_back(i);
    }
  }
  long long ans = LLONG_MAX;
  for (int i = 0; i < n; ++i) {
    vector<bool> vis(n);
    vector<long long> val(n, 1);
    queue<pair<int, int>> que;
    que.emplace(i, -1);
    vector<pair<int, int>> ord;

    vis[i] = true;
    while (!que.empty()) {
      int v = que.front().first;
      ord.push_back(que.front());
      que.pop();
      for (auto u : g[v]) {
        if (vis[u]) continue;
        vis[u] = true;
        que.emplace(u, v);        
      }
    }
    if ((int) ord.size() != n) continue;
    reverse(ord.begin(), ord.end());
    ord.pop_back();
    bool ok = true;
    for (auto v : ord) {
      val[v.second] += val[v.first];
    }
    ans = min(ans, accumulate(val.begin(), val.end(), 0LL));
  }
  cout << ans << '\n';
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:44:10: warning: unused variable 'ok' [-Wunused-variable]
   44 |     bool ok = true;
      |          ^~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 4 ms 512 KB Output is correct
14 Correct 210 ms 640 KB Output is correct
15 Correct 32 ms 768 KB Output is correct
16 Correct 744 ms 1004 KB Output is correct
17 Correct 1147 ms 924 KB Output is correct
18 Correct 1146 ms 1224 KB Output is correct