제출 #50877

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50877		luciocf	Bosses (BOI16_bosses)	C++14	67 / 100	1587 ms	1276 KiB

bosses

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 5e3+10;

int n, size[MAXN];
bool mark[MAXN];
vector<int> grafo[MAXN], aux[MAXN];

void BFS(int u)
{
    memset(mark, 0, sizeof mark);
    queue<int> fila;
    fila.push(u), mark[u] = 1;

    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;
            aux[x].push_back(v);
            mark[v] = 1, fila.push(v);
        }
    }
}

int DFS(int u, int p)
{
    for (int i = 0; i < aux[u].size(); i++)
    {
        int v = aux[u][i];
        if (v == p) continue;
        size[u] += DFS(v, u);
    }
    size[u]++;
    return size[u];
}

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 ans = 1e9;
    for (int i = 1; i <= n; i++)
    {
        memset(size, 0, sizeof size);
        for (int j = 1; j <= n; j++) aux[j].clear();
        BFS(i);

        bool ok = 1;
        for (int j = 1; j <= n; j++)
            if (!mark[j])
                ok = 0;
        if (!ok) continue;

        DFS(i, -1);

        int k = 0;
        for (int j = 1; j <= n; j++)
            k += size[j];
        ans = min(ans, k);
    }
    cout << ans << "\n";
}

컴파일 시 표준 에러 (stderr) 메시지

bosses.cpp: In function 'void BFS(int)':
bosses.cpp:21:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < grafo[x].size(); i++)
                         ~~^~~~~~~~~~~~~~~~~
bosses.cpp: In function 'int DFS(int, int)':
bosses.cpp:33:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < aux[u].size(); i++)
                     ~~^~~~~~~~~~~~~~~

• Subtask 1: 22 / 22
• Subtask 2: 45 / 45
• Subtask 3: 0 / 33