oj.uz

Submission #827383

# Submission time Handle Problem Language Result Execution time Memory
827383 2023-08-16T12:07:58 Z bachhoangxuan Bosses (BOI16_bosses) C++17
100 / 100
 388 ms 5260 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;

vector<int> edge[maxn];
int dist[maxn];

void solve(){
    int n;cin >> n;
    for(int i=1;i<=n;i++){
        int k;cin >> k;
        while(k--){int x;cin >> x;edge[x].push_back(i);}
    }
    int ans=inf;
    for(int s=1;s<=n;s++){
        for(int j=1;j<=n;j++) dist[j]=-1;
        queue<int> q;q.push(s);dist[s]=1;
        int sum=0,cnt=0;
        while(!q.empty()){
            int u=q.front();q.pop();
            sum+=dist[u];cnt++;
            for(int v:edge[u]) if(dist[v]==-1){
                dist[v]=dist[u]+1;
                q.push(v);
            }
        }
        if(cnt==n) ans=min(ans,sum);
    }
    cout << ans << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 2 ms 5032 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5032 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 2 ms 5032 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5032 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 5020 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 2 ms 5032 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5032 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 5020 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 5 ms 5076 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 73 ms 5152 KB Output is correct
15 Correct 5 ms 5076 KB Output is correct
16 Correct 388 ms 5204 KB Output is correct
17 Correct 375 ms 5260 KB Output is correct
18 Correct 358 ms 5248 KB Output is correct