Submission #904840

#	Time	Username	Problem	Language	Result	Execution time	Memory
904840		browntoad	Bosses (BOI16_bosses)	C++14	100 / 100	448 ms	836 KiB

bosses

#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define RREP1(i,n) for (int i=(n); i>=1; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pip pair<int, pii>
#define ppi pair<pii, int>
#define pdd pair<double ,double>
#define pcc pair<char, char>
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif

const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 998244353;
const ll maxn=5005;
const ll maxm=5e4+5;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    if (p < 0) return 0;
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}

ll inv(ll a, ll m=mod){
    return pw(a,m-2,m);
}


int n;
vector<vector<int>> can(maxn); // can[i][j]: j can be reached from i

signed main(){
    IOS();
    cin>>n;
    REP1(i, n){
        int k; cin>>k;
        REP(j, k){
            int u; cin>>u;
            can[u].pb(i);
        }
    }
    int mn = inf, sm, tot;
    REP1(i, n){
        sm = tot = 1;
        vector<int> dis(n+1);
        bool gg = false;
        fill(ALL(dis), inf);
        dis[i] = 1;
        queue<int> qu;
        qu.push(i);
        while(SZ(qu)){
            int x = qu.front(); qu.pop();
            for (int v:can[x]){
                if (dis[v] == inf){
                    tot++;
                    dis[v] = dis[x]+1;
                    sm += dis[v];
                    qu.push(v);
                }
            }
        }
        if (tot == n) mn = min(mn, sm);
    }
    cout<<mn<<endl;
}

Compilation message (stderr)

bosses.cpp: In function 'int main()':
bosses.cpp:76:14: warning: unused variable 'gg' [-Wunused-variable]
   76 |         bool gg = false;
      |              ^~

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