oj.uz

Submission #304630

# Submission time Handle Problem Language Result Execution time Memory
304630 2020-09-21T15:54:01 Z dolijan Bosses (BOI16_bosses) C++14
100 / 100
 798 ms 760 KB 
#include <bits/stdc++.h>
using namespace std;
const int mn=5069;
vector<vector<int> > graf(mn);
int kolko=0;
int bfs(int node,int n)
{
    bool visited[n+1];
    int level[n+1];
    for(int i=1;i<=n;i++) visited[i]=false;
    queue<int> q;
    q.push(node);
    visited[node]=true;
    int rez=0;
    level[node]=1;
    while(!q.empty())
    {
        int t=q.front();
        q.pop();
        rez+=level[t];
        kolko++;
        for(int i=0;i<graf[t].size();i++)
        {
            if(!visited[graf[t][i]])
            {
                q.push(graf[t][i]);
                level[graf[t][i]]=level[t]+1;
                visited[graf[t][i]]=true;
            }
        }
    }
    return rez;
}
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int k;
        cin>>k;
        int inp;
        for(int j=0;j<k;j++)
        {
            cin>>inp;
            graf[inp].push_back(i);
        }
    }
    int mn=n*n;
    for(int i=1;i<=n;i++)
    {
        kolko=0;
        int sta=bfs(i,n);
        //cout<<i<<" "<<kolko<<endl;
        if(kolko==n)
        {
            //cout<<i<<sta<<endl;
            mn=min(mn,sta);
        }
    }
    cout<<mn<<endl;
}

Compilation message

bosses.cpp: In function 'int bfs(int, int)':
bosses.cpp:22:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for(int i=0;i<graf[t].size();i++)
      |                     ~^~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 9 ms 504 KB Output is correct
13 Correct 8 ms 512 KB Output is correct
14 Correct 165 ms 620 KB Output is correct
15 Correct 18 ms 512 KB Output is correct
16 Correct 678 ms 640 KB Output is correct
17 Correct 798 ms 760 KB Output is correct
18 Correct 789 ms 760 KB Output is correct