답안 #973128

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973128 2024-05-01T14:05:17 Z canadavid1 Bosses (BOI16_bosses) C++14
100 / 100
482 ms 788 KB
#include <iostream>
#include <vector>

#include <algorithm>



int main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    int N;
    std::cin >> N;
    std::vector<std::vector<int>> coboss(N);
    for(int i = 0; i < N; i++)
    {
        int K;
        std::cin >> K;
        for(int j = 0; j < K; j++)
        {
            int l;
            std::cin >> l;
            coboss[l-1].push_back(i);
        }
    }
    int min = 1<<30;
    for(int head = 0; head < N; head++)
    {
        // bfs from head
        std::vector<int> curr = {head};
        std::vector<bool> seen(N); seen[head] = 1;
        std::vector<int> next;
        int c = 0;
        for(int d = 1;curr.size();d++)
        {
            for(auto n: curr)
            {
                c += d;
                for(auto ne : coboss[n])
                {
                    if(!seen[ne]) {next.push_back(ne); seen[ne] = 1;}
                }
            }
            curr = std::move(next);
            next.clear();
        }
        if (c < min && std::all_of(seen.begin(),seen.end(),[](auto x){return x;})) min = c;
    }
    std::cout << min << "\n";
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 456 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 456 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 192 ms 664 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 393 ms 772 KB Output is correct
17 Correct 482 ms 784 KB Output is correct
18 Correct 454 ms 788 KB Output is correct