oj.uz

Submission #329765

# Submission time Handle Problem Language Result Execution time Memory
329765 2020-11-22T11:43:20 Z SuhaibSawalha1 Bosses (BOI16_bosses) C++17
100 / 100
 721 ms 752 KB 
#include <bits/stdc++.h>
using namespace std;

int main (){
  
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);

  int n;
  cin >> n;
  vector<vector<int>> adj(n);
  for (int u = 0; u < n; ++u){
    int k, v;
    cin >> k;
    while (k--){
      cin >> v;
      adj[--v].push_back(u);
    }
  }
  vector<int> visited(n, -1);
  int ans = 1e9;
  for (int i = 0; i < n; ++i){
    int vis = 0, cost = 0, cnt = 1;
    visited[i] = i;
    for (queue<int> q {{i}}; !q.empty(); ++cnt){
      int s = q.size();
      cost += s * cnt;
      vis += s;
      while (s--){
        int u = q.front();
        q.pop();
        for (int v : adj[u]){
          if (visited[v] ^ i){
            q.push(v);
            visited[v] = i;
          }
        }
      }
    }
    ans = min(ans, vis == n ? cost : ans);
  }
  cout << ans;

  return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 6 ms 492 KB Output is correct
13 Correct 3 ms 492 KB Output is correct
14 Correct 119 ms 748 KB Output is correct
15 Correct 3 ms 620 KB Output is correct
16 Correct 544 ms 736 KB Output is correct
17 Correct 684 ms 752 KB Output is correct
18 Correct 721 ms 752 KB Output is correct