oj.uz

Submission #220153

# Submission time Handle Problem Language Result Execution time Memory
220153 2020-04-07T07:16:45 Z MKopchev Bosses (BOI16_bosses) C++14
100 / 100
 803 ms 760 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=5e3+42,inf=1e4+42;
int n;
vector<int> adj[nmax];

int dist[nmax];

queue< pair<int/*node*/,int/*dist*/> > q;

int bfs(int start)
{
    for(int i=1;i<=n;i++)dist[i]=inf;

    q.push({start,1});

    while(q.size())
    {
        pair<int/*node*/,int/*dist*/> cur=q.front();
        q.pop();

        if(dist[cur.first]!=inf)continue;

        dist[cur.first]=cur.second;
        for(auto k:adj[cur.first])
            q.push({k,cur.second+1});
    }

    int ret=0;
    for(int i=1;i<=n;i++)ret=ret+dist[i];

    //cout<<start<<" -> ";for(int i=1;i<=n;i++)cout<<dist[i]<<" ";cout<<endl;

    return ret;
}
int main()
{
    scanf("%i",&n);

    for(int i=1;i<=n;i++)
    {
        int sz,u;
        scanf("%i",&sz);
        for(int j=1;j<=sz;j++)
        {
            scanf("%i",&u);
            adj[u].push_back(i);
        }
    }

    int output=n*n;
    for(int i=1;i<=n;i++)
        output=min(output,bfs(i));

    printf("%i\n",output);
    return 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("%i",&n);
     ~~~~~^~~~~~~~~
bosses.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&sz);
         ~~~~~^~~~~~~~~~
bosses.cpp:46:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%i",&u);
             ~~~~~^~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 36 ms 640 KB Output is correct
13 Correct 27 ms 640 KB Output is correct
14 Correct 171 ms 612 KB Output is correct
15 Correct 31 ms 512 KB Output is correct
16 Correct 654 ms 640 KB Output is correct
17 Correct 790 ms 640 KB Output is correct
18 Correct 803 ms 760 KB Output is correct