oj.uz

Submission #838885

# Submission time Handle Problem Language Result Execution time Memory
838885 2023-08-28T05:12:40 Z vjudge1 Bosses (BOI16_bosses) C++17
100 / 100
 487 ms 664 KB 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

#include <bits/stdc++.h>
 
#define int long long 
#define pb push_back
#define ui unsigned int
#define ld long double
#define pl pair<long long int,  long long int>
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first    
#define ss second
#define sz size()
#define all(x) x.begin(), x.end()
 
using namespace std;
 
const int maxn = 1e5 + 11;
const int inf = 1e18 + 1;
// const int mod = 1e9 + 7;
const int mod = 998244353;
const int dx[] = {-1, 0, 0, 1, -1, -1, 1, 1};
const int dy[] = {0, -1, 1 , 0, -1, 1, -1, 1};
const double eps = 1e-10;

int used[5001];
vector<int> g[5001];
int d[5001];
int cnt;
queue<int> q;

void dfs(int v) {
    used[ v ] = 1;

    q.push( v );
    while(q.sz) {
        int v = q.front();
        q.pop();

        cnt += d[ v ];

        for(auto to : g[ v ]) {
            if(!used[ to ]) {
                used[ to ] = 1;
                d[ to ] = d[ v ] + 1;
                q.push( to );
            }
        }
    }
}

void solve() {
    int n;

    cin >> n;

    for(int i = 1; i <= n; i++) {
        int k;

        cin >> k;

        for(int j = 1; j <= k; j++) {
            int x;

            cin >> x;

            g[ x ].pb( i );
        }
    }   
    int ans = inf;

    for(int i = 1; i <= n; i++) {
        cnt = 0;
        d[ i ] = 1;
        dfs( i );
        for(int j = 1; j <= n; j++) {
            if(!used[ j ]) {
                cnt = inf;
            }
            used[ j ] = 0;
            d[ j ] = 0;
        }
        ans = min(ans, cnt);
    }
    cout << ans;
}
    
signed main() {
    // freopen("sum.in", "r", stdin); 
    // freopen("sum.out", "w", stdout);
 
    boost;      

    int tt = 1;

    // cin >> tt;

    for(int i = 1; i <= tt; i++) {
        // cout << "Case " << i << ":\n";
        solve();    
    }           
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 416 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 105 ms 596 KB Output is correct
15 Correct 21 ms 620 KB Output is correct
16 Correct 463 ms 596 KB Output is correct
17 Correct 463 ms 660 KB Output is correct
18 Correct 487 ms 664 KB Output is correct