oj.uz

Submission #946219

# Submission time Handle Problem Language Result Execution time Memory
946219 2024-03-14T12:19:49 Z veljko Bosses (BOI16_bosses) C++17
100 / 100
 420 ms 756 KB 
/*****from dust I have come, dust I will be*****/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define forn(i,n) for(int i=0;i<n;i++)
int dx[8] = { 1, 0, -1, 0, -1, 1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, -1, 1, 1, -1 };
int ceil_div(int a, int b) {return a % b == 0 ? a / b : a / b + 1;}
 
const int MOD = 1000000007;
//const int MOD = 998244353;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key
 
/*
int k = A.order_of_key(p[i].second);
A.erase(A.find_by_order(k));
erase element from pbds multiset
*/

int bfs(vector<vector<int>>&g, int start, int n){
    vector<int>vis(n, 0);
    queue<int>q;
    q.push(start);
    vis[start] = 1;
    int cost = 0, cnt = 0;
    while (!q.empty()){
        auto t = q.front();
        q.pop();
        for (auto x : g[t]){
            if (vis[x] == 0){
                cnt++;
                vis[x] = vis[t] + 1;
                cost += vis[x];
                q.push(x);
            }
        }
    }
    if (cnt != n-1) return 1e18;
    return cost + 1;
}
 
void solve(){
    int n; cin >> n;
    vector<vector<int>>g(n);
    forn(i,n){
        int sz; cin >> sz;
        int x;
        forn(j,sz){
            cin >> x;
            g[x-1].push_back(i);
        }
    }
    int ans = 1e18;
    forn(i,n){
        ans = min(ans, bfs(g,i,n));
    }
    cout <<ans<<'\n';
    
}
 
 
int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 

 
    int t = 1; //cin >>t;
    for (int i=1;i<=t;i++){
        solve();
    }
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 77 ms 676 KB Output is correct
15 Correct 4 ms 756 KB Output is correct
16 Correct 420 ms 604 KB Output is correct
17 Correct 393 ms 748 KB Output is correct
18 Correct 385 ms 604 KB Output is correct