oj.uz

Submission #951875

# Submission time Handle Problem Language Result Execution time Memory
951875 2024-03-22T21:27:39 Z MohamedAhmed04 Bosses (BOI16_bosses) C++14
100 / 100
 424 ms 848 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 5000 + 10 ;

int n ;
vector< vector<int> >adj(MAX) ;

int dep[MAX] , vis[MAX] ;

int solve(int boss)
{
    for(int i = 1 ; i <= n ; ++i)
        vis[i] = 0 ;
    int cnt = 0 , sum = 0 ;
    queue<int>q ;
    q.push(boss) ;
    dep[boss] = 1 , vis[boss] = 1 ;
    while(!q.empty())
    {
        int node = q.front() ;
        q.pop() ;
        cnt++ , sum += dep[node] ;
        for(auto &child : adj[node])
        {
            if(!vis[child])
            {
                vis[child] = 1 ;
                dep[child] = dep[node] + 1 ;
                q.push(child) ;
            }
        }
    }
    if(cnt != n)
        sum = 2e9 ;
    return sum ;
}

int main()
{
    ios_base::sync_with_stdio(0) ;
    cin.tie(0) ;
    cin>>n ;
    for(int i = 1 ; i <= n ; ++i)
    {
        int sz ;
        cin>>sz ;
        while(sz--)
        {
            int node ;
            cin>>node ;
            adj[node].push_back(i) ;
        }
    }
    int ans = 1e9 ;
    for(int i = 1 ; i <= n ; ++i)
        ans = min(ans , solve(i)) ;
    return cout<<ans<<"\n" , 0 ;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 0 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 1 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 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 2 ms 708 KB Output is correct
14 Correct 75 ms 604 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 424 ms 600 KB Output is correct
17 Correct 406 ms 848 KB Output is correct
18 Correct 398 ms 816 KB Output is correct