oj.uz

Submission #107361

# Submission time Handle Problem Language Result Execution time Memory
107361 2019-04-23T12:37:04 Z MohamedAhmed0 Bosses (BOI16_bosses) C++14
100 / 100
 727 ms 760 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX = 5005 ;
int vis[MAX] ;
long long cost = 0;

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

int n , cnt = 0 ;

void bfs(int src)
{
    queue< pair<int , int> >q ;
    q.push({src , 1}) ;
    vis[src] = 1 ;
    while(!q.empty())
    {
        pair<int , int>p = q.front() ;
        q.pop() ;
        cnt++ ;
        int node = p.first ;
        cost += (p.second * 1ll) ;
        for(auto &child : adj[node])
        {
            if(vis[child] == 1)
                continue ;
            vis[child] = 1 ;
            q.push({child , p.second+1}) ;
        }
    }
    return ;
}

int main()
{
    scanf("%d" , &n) ;
    for(int i = 1 ; i <= n ; ++i)
    {
        int m ;
        scanf("%d" , &m) ;
        while(m--)
        {
            int x ;
            scanf("%d" , &x) ;
            adj[x].push_back(i) ;
        }
    }
    long long ans = 1e18 ;
    for(int i = 1 ; i <= n ; ++i)
    {
        memset(vis , 0 , sizeof(vis)) ;
        cnt = 0 , cost = 0;
        bfs(i) ;
        if(cnt != n)
            continue;
        ans = min(ans , cost) ;
    }
    return printf("%lld" , ans) , 0 ;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d" , &n) ;
     ~~~~~^~~~~~~~~~~
bosses.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d" , &m) ;
         ~~~~~^~~~~~~~~~~
bosses.cpp:46:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d" , &x) ;
             ~~~~~^~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 540 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 170 ms 580 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 630 ms 644 KB Output is correct
17 Correct 698 ms 660 KB Output is correct
18 Correct 727 ms 760 KB Output is correct