oj.uz

Submission #50879

# Submission time Handle Problem Language Result Execution time Memory
50879 2018-06-13T22:51:21 Z luciocf Bosses (BOI16_bosses) C++14
100 / 100
 1321 ms 1236 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 5e3+10;

int n, pai[MAXN], nivel[MAXN], ans[MAXN];
bool mark[MAXN];
vector<int> grafo[MAXN];

int BFS(int u)
{
    memset(mark, 0, sizeof mark);
    memset(ans, 0, sizeof ans);
    queue<int> fila;
    vector<int> level[MAXN];
    fila.push(u), mark[u] = 1, nivel[u] = 0;
    int qtd = 1, maxniv = 0, k = 0;

    while (!fila.empty())
    {
        int x = fila.front();
        fila.pop();
        for (int i = 0; i < grafo[x].size(); i++)
        {
            int v = grafo[x][i];
            if (mark[v]) continue;

            pai[v] = x, nivel[v] = nivel[x]+1;
            level[nivel[v]].push_back(v);
            maxniv = max(maxniv, nivel[v]);

            mark[v] = 1, fila.push(v);
            qtd++;
        }
    }
    if (qtd < n) return 1000000000;

    for (int i = maxniv; i > 0; i--)
    {
        for (int j = 0; j < level[i].size(); j++)
        {
            int v = level[i][j];
            ans[v]++;
            ans[pai[v]] += ans[v];
            k += ans[v];
        }
    }
    k += ans[u]+1;
    return k;
}

int main(void)
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int m;
        cin >> m;
        while (m--)
        {
            int u;
            cin >> u;
            grafo[u].push_back(i);
        }
    }
    int out = 1e9;
    for (int i = 1; i <= n; i++)
        out = min(out, BFS(i));
    cout << out << "\n";
}

Compilation message

bosses.cpp: In function 'int BFS(int)':
bosses.cpp:24:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < grafo[x].size(); i++)
                         ~~^~~~~~~~~~~~~~~~~
bosses.cpp:41:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < level[i].size(); j++)
                         ~~^~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 664 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 2 ms 712 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 3 ms 772 KB Output is correct
9 Correct 2 ms 824 KB Output is correct
10 Correct 4 ms 824 KB Output is correct
11 Correct 4 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 664 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 2 ms 712 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 3 ms 772 KB Output is correct
9 Correct 2 ms 824 KB Output is correct
10 Correct 4 ms 824 KB Output is correct
11 Correct 4 ms 844 KB Output is correct
12 Correct 10 ms 972 KB Output is correct
13 Correct 8 ms 972 KB Output is correct
14 Correct 558 ms 1108 KB Output is correct
15 Correct 74 ms 1108 KB Output is correct
16 Correct 896 ms 1108 KB Output is correct
17 Correct 1247 ms 1108 KB Output is correct
18 Correct 1321 ms 1236 KB Output is correct