oj.uz

Submission #866762

# Submission time Handle Problem Language Result Execution time Memory
866762 2023-10-27T03:11:27 Z 12345678 Bosses (BOI16_bosses) C++17
100 / 100
 411 ms 852 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=5e3+5;
int n, x, k, res, ans=INT_MAX, cnt, dp[nx];
vector<int> d[nx];
bool vs[nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++)
    {
        cin>>k;
        for (int j=0; j<k; j++) cin>>x, d[x].push_back(i);
    }
    for (int i=1; i<=n; i++)
    {
        cnt=0;
        for (int j=1; j<=n; j++) vs[j]=dp[j]=0;
        queue<int> q;
        q.push(i);
        vs[i]=dp[i]=res=1;
        while (!q.empty())
        {
            auto u=q.front();
            cnt++;
            q.pop();
            for (auto v:d[u]) if (!vs[v]) dp[v]=dp[u]+1, res+=dp[v], vs[v]=1, q.push(v);
        }
        if (cnt==n) ans=min(ans, res);
    }
    cout<<ans;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:22:45: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   22 |         for (int j=1; j<=n; j++) vs[j]=dp[j]=0;
      |                                        ~~~~~^~
bosses.cpp:25:20: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   25 |         vs[i]=dp[i]=res=1;
      |               ~~~~~^~~~~~

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 0 ms 344 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 500 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 0 ms 344 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 500 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 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 0 ms 344 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 500 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 73 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 411 ms 716 KB Output is correct
17 Correct 380 ms 852 KB Output is correct
18 Correct 389 ms 736 KB Output is correct