oj.uz

Submission #695216

# Submission time Handle Problem Language Result Execution time Memory
695216 2023-02-04T19:40:36 Z 3omar_ahmed Bosses (BOI16_bosses) C++17
100 / 100
 636 ms 716 KB 
/**
 * author: 3omar_ahmed
 * date: 04-02-2023
 * Expert When :)
 */
#include <ext/rope>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std ;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
template<class x> using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
#define int long long
#define endl '\n'
#define all(a) a.begin() , a.end()
#define alr(a) a.rbegin() , a.rend()
int n;
vector < vector < int >> adj;
int bfs(int root){
    queue < int > dq;
    vector < int > dis(n + 1);
    dq.push(root);
    dis[root] = 1;
    int get = 1;
    while(dq.size()){
        int node = dq.front();
        dq.pop();
        for(auto child : adj[node]){
            if(dis[child]) continue;
            dis[child] = dis[node] + 1;
            get += dis[child];
            dq.push(child);
        }
    }
    for(int i = 0 ; i < n ; i++) if(dis[i] == 0) return 1e18;
    return get;
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);

    cin >> n;
    adj = vector < vector < int >> (n + 1);
    for(int i = 1 ; i <= n ; i++){
        int sz; cin >> sz;
        for(int j = 1 ; j <= sz ; j++){
            int x;
            cin >> x;
            adj[x - 1].push_back(i - 1);
        }
    }
    int ans = 1e18;
    for(int i = 0 ; i < n ; i++){
        ans = min(ans, bfs(i));
    }
    cout << ans << endl;
    return 0 ;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 112 ms 544 KB Output is correct
15 Correct 7 ms 568 KB Output is correct
16 Correct 499 ms 656 KB Output is correct
17 Correct 623 ms 716 KB Output is correct
18 Correct 636 ms 616 KB Output is correct