Submission #254709

#	Time	Username	Problem	Language	Result	Execution time	Memory
254709		alrad	Bosses (BOI16_bosses)	C++17	67 / 100	1593 ms	1128 KiB

bosses

#include <bits/stdc++.h>

using namespace std;

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

template <class T> inline T gcd(T a , T b) { return !a ? b : gcd(b % a , a); }
template <class T> inline T lcm(T a , T b) {return (a * b) / gcd(a , b) ; }

#define all(x) x.begin(), x.end()
#define debug(x) { cerr << #x << " = " << x << endl; }

const int N = 5000 + 5;
const int INF = 1e9;

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

int main() {
   ios_base :: sync_with_stdio(0);
   cin.tie(0) , cout.tie(0);
   int n;
   cin >> n;
   for (int i = 1; i <= n; i++) {
      int k;
      cin >> k;
      for (int j = 0; j < k; j++) {
         int x;
         cin >> x;
         g[x].push_back(i);
      }
   }
   auto calc = [&](int root) {
      int sz = 1;
      queue<int> q;
      vector<int> d(n + 1 , 0);
      vector<bool> used(n + 1 , false);
      d[root] = 0 , used[root] = true , q.push(root);
      while (!q.empty()) {
         int v = q.front();
         q.pop();
         for (int to : g[v]) {
            if (!used[to]) {
               sz++;
               used[to] = true;
               d[to] = d[v] + 1;
               q.push(to);
            }
         }
      }
      if (sz != n) {
         return INF;
      }
      unordered_map<int , int> cnt;
      for (int i = 1; i <= n; i++) {
         cnt[d[i]]++;
      }
      int res = 0 , children = 0;
      for (int deep = n - 1; deep >= 0; deep--) {
         res += children + cnt[deep];
         children += cnt[deep];
      }
      return res;
   };
   int ans = INF;
   for (int i = 1; i <= n; i++) {
      ans = min(ans , calc(i));
   }
   cout << ans << '\n';
   return 0;
}

• Subtask 1: 22 / 22
• Subtask 2: 45 / 45
• Subtask 3: 0 / 33