oj.uz

Submission #973618

# Submission time Handle Problem Language Result Execution time Memory
973618 2024-05-02T08:34:55 Z Amirreza_Fakhri Bosses (BOI16_bosses) C++17
100 / 100
 445 ms 856 KB 
// In the name of the God
#include <bits/stdc++.h>
#define ll long long
// #define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2")

const int inf = 1e9+7;
const int mod = 998244353;
const int maxn = 5e3+5;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, mark[maxn];
vector <int> adj[maxn];
queue <int> q;

int bfs(int r) {
    int sum = 0;
    memset(mark, 0, sizeof mark);
    while (q.size()) q.pop();
    mark[r] = 1;
    q.push(r);
    while (q.size()) {
        int v = q.front();
        q.pop();
        sum += mark[v];
        for (int u : adj[v]) {
            if (!mark[u]) {
                mark[u] = mark[v] + 1;
                q.push(u);
            }
        }
    }
    if (*min_element(mark, mark+n) == 0) return inf;
    return sum;
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        int k; cin >> k;
        while (k--) {
            int j; cin >> j;
            adj[--j].pb(i);
        }
    }
    int ans = inf;
    for (int i = 0; i < n; i++) smin(ans, bfs(i));
    cout << ans << '\n';
    return 0;
}







/*
srand(time(0));
cout << (rand()%1900) + 1 << ' ' << (rand()%2)+5 << '\n';
*/

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 584 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 0 ms 580 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 584 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 0 ms 580 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 3 ms 716 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 100 ms 692 KB Output is correct
15 Correct 26 ms 600 KB Output is correct
16 Correct 445 ms 852 KB Output is correct
17 Correct 419 ms 604 KB Output is correct
18 Correct 436 ms 600 KB Output is correct