Submission #1279912

#	Time	Username	Problem	Language	Result	Execution time	Memory
1279912		longdeptrai	Bosses (BOI16_bosses)	C++20	100 / 100	733 ms	1068 KiB

bosses

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define LongDepTrai "bosses"
#define ll long long
#define int long long
#define ull unsigned long long
#define ld long double
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define pll pair<ll,ll>
#define vi vector<int>
#define vii vector<ii>
#define vll vector<ll>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) int((x).size())
#define order_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>

inline ll add(ll a, ll b, ll mod){ a += b; if(a >= mod) a -= mod; return a; }
inline ll sub(ll a, ll b, ll mod){ a -= b; if(a < 0) a += mod; return a; }
inline ll mul(ll a, ll b, ll mod){ return ( (ll)a * b ) % mod; }

static mt19937_64 rng((unsigned)chrono::steady_clock::now().time_since_epoch().count());
const int N=5e3+9;
int n,f[N];
bool vs[N];
vi g[N],adj[N];
void dfs(int u){
    for(int x:adj[u]){
        dfs(x);
        f[u]+=f[x];
    }
    f[u]++;
}
void bfs(int u){
    queue<int> q;
    q.push(u);
    vs[u]=1;
    while(q.size()){
        int z=q.front();
        q.pop();
        for(int v:g[z]){
            if(vs[v]) continue;
            vs[v]=1;
            adj[z].pb(v);
            q.push(v);
        }
    }
}
bool check(){
    for(int i=1;i<=n;i++){
        if(!vs[i]) return 0;
    }
    return 1;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    if(fopen(LongDepTrai".inp","r")){
        freopen(LongDepTrai".inp","r",stdin);
        freopen(LongDepTrai".out","w",stdout);
    }
    cin>>n;
    for(int i=1;i<=n;i++){
        int k;
        cin>>k;
        for(int j=1;j<=k;j++){
            int u;
            cin>>u;
            g[u].pb(i);
      //      cout<<u<<" "<<i<<"\n";
        }
    }
    int res=1e18;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++) adj[j].clear(),f[j]=0,vs[j]=0;
        //vs[i]=1;
        bfs(i);
        if(check()){
            dfs(i);
            int tmp=0;
            for(int j=1;j<=n;j++)
            {
//                cout<<f[j]<<" ";
                tmp+=f[j];
            }
            res=min(res,tmp);
        }
//        cout<<"\n";
    }
    cout<<res;

    return 0;
}

Compilation message (stderr)

bosses.cpp: In function 'int main()':
bosses.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |         freopen(LongDepTrai".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bosses.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         freopen(LongDepTrai".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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