제출 #1251309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1251309		Isam	Bosses (BOI16_bosses)	C++17	0 / 100	196 ms	327680 KiB

bosses

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

#define intt long long

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

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

void bfs(int root){
  queue<int> q;
  q.push(root);
  vis[root] = 1;
  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);
    }
  }
}

intt dfs(int u, int fa){
  intt res = 1;
  for(auto to : gm[u]) if(to ^ fa) res += dfs(to, u);
  cost += res;
  return res;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  //g.resize(n + 1), gm.resize(n + 1);
  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 = 0ll;
    cnt = 0;
    bfs(i);
    if(cnt ^ n) continue; 
    dfs(i, i);
    for(int j = 1; j <= n; ++j) gm[j].clear();
    ans = min(ans, cost);
  }
  cout << ans << '\n';
  return 0;
}

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