Submission #1251301

#	Time	Username	Problem	Language	Result	Execution time	Memory
1251301		Isam	Bosses (BOI16_bosses)	C++20	0 / 100	174 ms	327680 KiB

bosses

#include <bits/stdc++.h>
using namespace std;

#define int long long

constexpr int sz = 5005;
constexpr int inf = 1e18 + 7;

int n, cost, ans = inf, cnt;
vector<int> g[sz], gm[sz];
bitset<sz> vis;

void bfs(int root){
  queue<int> q;
  q.push(root);
  vis[root] = 1;
 // ++cnt;
  while(!q.empty()){
    int cur = q.front();
    q.pop();
    ++cnt;
    for(int &u : g[cur]){
      if(vis[u]) continue;
      vis[u] = 1;
      
      q.push(u);
      gm[cur].emplace_back(u);
    }
  }
}

int d[sz];

int dfs(int u){
  d[u] = 1;


  for(auto to : gm[u]){
      dfs(to);
      d[u] += d[to];
  }

  return d[u];

}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for(int i = 1, k; i <= n; ++i){
    cin >> k;
    for(int j = 1, u; j <= k; ++j){
      cin >> u;
      g[u].emplace_back(i);
    }
  }
  for(int i = 1; i <= n; ++i){
    vis.reset();
    cost = cnt = 0;
    bfs(i);
    if(cnt ^ n) continue; 
    dfs(i);
    for(int j = 1; j <= n; ++j) gm[j].clear(), cost += d[j], d[j] = 0;
    ans = min(ans, cost);
  }
  cout << ans << '\n';
  return 0;
}

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