oj.uz

Submission #484692

# Submission time Handle Problem Language Result Execution time Memory
484692 2021-11-05T05:31:07 Z tranxuanbach Bosses (BOI16_bosses) C++17
100 / 100
 787 ms 868 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(i, l, r) for (int i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())

using ll = long long;
using ld = long double;
using pii = pair <int, int>;
using vi = vector <int>;
using vpii = vector <pii>;
using vvi = vector <vi>;

const int N = 5e3 + 5;

int n;
vi par[N];

vi adj[N];
int dist[N];
int ans = INT_MAX;

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("KEK.inp", "r", stdin);
    // freopen("KEK.out", "w", stdout);
    cin >> n;
    ForE(i, 1, n){
        int k; cin >> k;
        while (k--){
            int x; cin >> x;
            par[i].emplace_back(x);
            adj[x].emplace_back(i);
        }
    }
    ForE(i, 1, n){
        queue <int> qu;
        memset(dist, -1, sizeof(dist));
        dist[i] = 1; qu.emplace(i);
        while (!qu.empty()){
            int u = qu.front(); qu.pop();
            Fora(v, adj[u]){
                if (dist[v] == -1){
                    dist[v] = dist[u] + 1;
                    qu.emplace(v);
                }
            }
        }
        int tans = 0;
        ForE(j, 1, n){
            if (dist[j] == -1){
                tans = INT_MAX;
                break;
            }
            tans += dist[j];
        }
        ans = min(ans, tans);
    }
    cout << ans << endl;
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 5 ms 588 KB Output is correct
13 Correct 3 ms 716 KB Output is correct
14 Correct 161 ms 788 KB Output is correct
15 Correct 7 ms 716 KB Output is correct
16 Correct 600 ms 852 KB Output is correct
17 Correct 757 ms 868 KB Output is correct
18 Correct 787 ms 864 KB Output is correct