oj.uz

Submission #107181

# Submission time Handle Problem Language Result Execution time Memory
107181 2019-04-22T11:05:19 Z stefdasca Bosses (BOI16_bosses) C++14
100 / 100
 605 ms 804 KB 
#include<bits/stdc++.h>
using namespace std;
int n, cost, ans = (1<<30);
vector<int>v[5002];
int viz[5002];
int s;
void bfs(int nod)
{
    memset(viz, 0, sizeof(viz));
    viz[nod] = 1;
    queue<int>q;
    q.push(nod);
    cost = 1;
    while(!q.empty())
    {
        int t = q.front();
        q.pop();
        for(int j = 0; j < v[t].size(); ++j)
        {
            int vecin = v[t][j];
            if(!viz[vecin])
            {
                s++;
                viz[vecin] = viz[t] + 1;
                cost += viz[vecin];
                q.push(vecin);
            }
        }
    }
}
int main()
{
    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        int k;
        cin >> k;
        for(int j = 1; j <= k; ++j)
        {
            int nr;
            cin >> nr;
            v[nr].push_back(i);
        }
    }
    for(int i = 1; i <= n; ++i)
    {
        s = 0;
        cost = 0;
        bfs(i);
        if(s == n-1)
            ans = min(ans, cost);
    }
    cout << ans;
    return 0;
}

Compilation message

bosses.cpp: In function 'void bfs(int)':
bosses.cpp:18:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < v[t].size(); ++j)
                        ~~^~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 105 ms 512 KB Output is correct
15 Correct 8 ms 524 KB Output is correct
16 Correct 589 ms 640 KB Output is correct
17 Correct 605 ms 804 KB Output is correct
18 Correct 573 ms 664 KB Output is correct