oj.uz

Submission #700936

# Submission time Handle Problem Language Result Execution time Memory
700936 2023-02-19T12:54:23 Z Farbod Bosses (BOI16_bosses) C++17
100 / 100
 1244 ms 984 KB 
/*
*  In the name of God
*
*  Author: Farbod Doost
*  Last Modified: Sun, 19 Feb 2023 (12:52:53)
*
*/
#include <bits/stdc++.h>
using namespace std;

const int N = 5005;
const long long inf = 1e18;

int n;
vector <int> adj[N];

long long c[N], ans = inf;

bool vis[N];
queue <int> q;
vector <int> g[N];

void dfs(int v)
{
    for (auto u: g[v])
        dfs(u), c[v] += c[u];
    return;
}

void f(int r)
{
    for (int i = 0; i < n; i++)
        vis[i] = 0, c[i] = 1, g[i].clear();

    q.push(r), vis[r] = 1;
    while (!q.empty()) {
        int v = q.front();
        q.pop();

        for (auto u: adj[v])
            if (!vis[u])
                q.push(u), vis[u] = 1, g[v].push_back(u);
    }

    dfs(r);

    long long sum = 0;
    for (int i = 0; i < n; i++) {
        if (!vis[i])
            return;
        sum += c[i];
    }

    ans = min(ans, sum);

    return;
}

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

    cin >> n;
    for (int i = 0; i < n; i++) {
        int k, x;
        cin >> k;

        while (k--)
            cin >> x, x--, adj[x].push_back(i);
    }

    for (int i = 0; i < n; i++)
        f(i);

    cout << ans;

    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 560 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 560 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 6 ms 724 KB Output is correct
13 Correct 4 ms 628 KB Output is correct
14 Correct 289 ms 852 KB Output is correct
15 Correct 22 ms 724 KB Output is correct
16 Correct 1004 ms 920 KB Output is correct
17 Correct 1244 ms 984 KB Output is correct
18 Correct 1234 ms 968 KB Output is correct