oj.uz

Submission #643163

# Submission time Handle Problem Language Result Execution time Memory
643163 2022-09-21T10:58:39 Z fatemetmhr Bosses (BOI16_bosses) C++17
100 / 100
 546 ms 3032 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb       push_back
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn5 = 1e5 + 10;
const int inf   = 1e9;

int n;
vector <int> adj[maxn5];
int q[maxn5], h[maxn5];
bool mark[maxn5];

inline int check(int ro){
    memset(mark, false, sizeof mark);
    mark[ro] = true;
    ll ans = n;
    h[ro] = 0;
    int l = 0, r = 1;
    q[0] = ro;
    while(l < r){
        int v = q[l++];
        ans += h[v];
        for(auto u : adj[v]) if(!mark[u]){
            h[u] = h[v] + 1;
            q[r++] = u;
            mark[u] = true;
        }
    }
    if(r < n)
        return inf;
    return ans;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin >> n;
    for(int i = 0; i < n; i++){
        int k; cin >> k;
        while(k--){
            int a; cin >> a; a--;
            adj[a].pb(i);
        }
    }
    int ans = n * n + 1;
    for(int i = 0; i < n; i++)
        ans = min(ans, check(i));
    cout << ans << endl;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2676 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2676 KB Output is correct
5 Correct 1 ms 2676 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 3 ms 2676 KB Output is correct
12 Correct 6 ms 2772 KB Output is correct
13 Correct 4 ms 2816 KB Output is correct
14 Correct 98 ms 2908 KB Output is correct
15 Correct 14 ms 2928 KB Output is correct
16 Correct 471 ms 2996 KB Output is correct
17 Correct 537 ms 3032 KB Output is correct
18 Correct 546 ms 3028 KB Output is correct