oj.uz

Submission #292508

# Submission time Handle Problem Language Result Execution time Memory
292508 2020-09-07T07:38:57 Z soba Bosses (BOI16_bosses) C++14
100 / 100
 802 ms 760 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int arr[5001];
vector<int>v[5001];
ll visited;
ll BFS(int source)
{
    queue<int>q;
    q.push(source);
    arr[source]++;
    ll node , sz , salary=1 , ret=0;
    while(!q.empty())
    {
        sz=q.size();
        while(sz--)
        {
            ret+=salary;
            node=q.front();
            q.pop();
            visited++;
            for(int i = 0 ; i  < v[node].size() ; i++ )
            {
                if(arr[v[node][i]]==0)
                {
                    q.push(v[node][i]);
                    arr[v[node][i]]++;
                }
            }
        }
        salary++;
    }
    return ret;
}
int main()
{
    int n ;
    cin >> n ;
    for(int i = 1 ; i <=n ; i++)
    {
        int x , y;
        cin >> x ;
        while(x--)
        {
            cin >> y;
            v[y].push_back(i);
        }
    }
    ll ans = INT_MAX , found ;
    for(int i = 1 ; i <= n ; i++)
    {
        memset(arr , 0 , sizeof arr);
        visited=0;
        found=BFS(i);
        if(visited==n)
            ans=min(ans , found);
    }
    cout << ans ;
}

Compilation message

bosses.cpp: In function 'll BFS(int)':
bosses.cpp:23:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |             for(int i = 0 ; i  < v[node].size() ; i++ )
      |                             ~~~^~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 10 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 161 ms 632 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 690 ms 760 KB Output is correct
17 Correct 777 ms 760 KB Output is correct
18 Correct 802 ms 640 KB Output is correct