oj.uz

Submission #904840

# Submission time Handle Problem Language Result Execution time Memory
904840 2024-01-12T10:21:31 Z browntoad Bosses (BOI16_bosses) C++14
100 / 100
 448 ms 836 KB 
#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

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

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 572 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 572 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 91 ms 724 KB Output is correct
15 Correct 9 ms 604 KB Output is correct
16 Correct 418 ms 832 KB Output is correct
17 Correct 448 ms 836 KB Output is correct
18 Correct 428 ms 820 KB Output is correct