oj.uz

Submission #958401

# Submission time Handle Problem Language Result Execution time Memory
958401 2024-04-05T18:21:46 Z IsaL Bosses (BOI16_bosses) C++17
100 / 100
 1065 ms 924 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>

const int N = 5069;
const ll mod = 1e9 + 7;

int tc;
int n, sub[N], cn, tot, dp[N];
bool vis[N];
vector<int> al[N];

void dfs(int x)
{
    sub[x] = 1;
    vis[x] = 1;
    for(auto z : al[x])
    {
        if(dp[z] == 1 + dp[x] and !vis[z]) {
            dfs(z);
            sub[x] += sub[z];
        }
    }
    tot += sub[x];
}

signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int i, j;

    cin >> n;
    for(i = 1; i <= n; i++)
    {
        int k;
        cin >> k;
        for(j = 1; j <= k; j++)
        {
            int x;
            cin >> x;
            al[x].push_back(i);
        }
    }
    
    int ans = 1e18;
    for(i = 1; i <= n; i++)
    {
        cn = tot = 0;
        for(j = 1; j <= n; j++)
        {
            sub[j] = 0;
            vis[j] = 0;
            dp[j] = 0;
        }
        queue<int> q;
        q.push(i);
        dp[i] = 1;
        cn = 1;
        while(!q.empty())
        {
            int x = q.front();
            q.pop();
            for(auto z : al[x])
            {
                if(dp[z] == 0)
                {
                    dp[z] = dp[x] + 1;
                    ++cn;
                    q.push(z);
                }
            }
        }
        if(cn == n)
        {
            dfs(i);
            ans = min(ans, tot);
        }
    }
    cout << ans << '\n';
}

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 1 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 1 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 1 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 420 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 1 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 420 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 7 ms 604 KB Output is correct
14 Correct 81 ms 924 KB Output is correct
15 Correct 6 ms 604 KB Output is correct
16 Correct 442 ms 880 KB Output is correct
17 Correct 1065 ms 872 KB Output is correct
18 Correct 1041 ms 872 KB Output is correct