Submission #1075194

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075194		Mighilon	Bosses (BOI16_bosses)	C++17	0 / 100	0 ms	348 KiB

bosses

#include <bits/stdc++.h>
using namespace std;
 
#ifdef DEBUG
#include "../Library/debug.h"
#else
#define dbg(x...)
#endif
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
 
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i)
#define trav(a, x) for (auto& a : x)
#define f first 
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
 
const char nl = '\n';
const int INF = 1e9;
const int MOD = 1e9 + 7;

vector<vi> adj;
vector<bool> vis;
vl a;

// void bfs(int u, int p){
//     vector<vi> childs;
//     queue<pi> q;
//     q.push({u, p});
//     while(!q.empty()){
//         auto [u, p] = q.front();
//         q.pop();
//         if(vis[u])
//             continue;
//         vis[u] = true;
//         trav(v, adj[u]){
//             if(v == p) continue;
//             if(!vis[v]){
//                 childs[v].pb(u);
//                 q.push({v, u});
//             }
//         }
//     }
// }

ll dfs(int u){
    vi que;
    trav(v, adj[u]){
        if(vis[v]) continue;
        que.pb(v);
        vis[v] = true;
    }
    trav(v, que){
        a[u] += dfs(v);
    }
    return a[u];
}

void solve(){
    int n;
    cin >> n;
    adj.resize(n);
    vis.resize(n);
    a.resize(n);
    F0R(i, n){
        int x; cin >> x;
        F0R(j, x){
            int a;
            cin >> a;
            a--;
            adj[a].pb(i);
        }
    }
    ll mn = 1e18;
    F0R(i, n){
        vis.assign(n, false);
        a.assign(n, 1);
        vis[i] = true;
        dfs(i);
        if(accumulate(all(vis), 0) != n)
            continue;
        dbg(a)
        mn = min(mn, accumulate(all(a), 0LL));
    }
    cout << mn << nl;
}
 
int32_t main(){
    ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    
    int TC = 1;
    // cin >> TC;
    while(TC--){
        solve();
    }
    return 0;
}

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