oj.uz

Submission #231531

# Submission time Handle Problem Language Result Execution time Memory
231531 2020-05-13T21:54:56 Z Haunted_Cpp Bosses (BOI16_bosses) C++17
100 / 100
 703 ms 760 KB 
#include <bits/stdc++.h>
 
using namespace std;

#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")

const int N = 5e3 + 5;

vector< vector<int> > g (N);

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int k;
    cin >> k;
    for (int j = 0; j < k; j++) {
      int st;
      cin >> st;
      --st;
      g[st].emplace_back(i);
    }
  }
  queue<int> q;
  int mn = 1e9;
  for (int i = 0; i < n; i++) {
    vector<int> dist (N, 1e9);
    int visited = 0;
    int res = 1;
    dist[i] = 1;
    q.push(i);
    while (!q.empty()) {
      int node = q.front();
      ++visited;
      q.pop();
      for (auto to : g[node]) {
        if (dist[to] > dist[node] + 1) {
          dist[to] = dist[node] + 1;
          res += dist[to];
          q.push(to);
        }
      }
    }
    if (visited != n) continue;
    mn = min (mn, res);  
  }  
  cout << mn << '\n';
  return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 132 ms 636 KB Output is correct
15 Correct 9 ms 512 KB Output is correct
16 Correct 541 ms 640 KB Output is correct
17 Correct 703 ms 760 KB Output is correct
18 Correct 700 ms 640 KB Output is correct