oj.uz

Submission #546746

# Submission time Handle Problem Language Result Execution time Memory
546746 2022-04-08T11:23:05 Z Jomnoi Bosses (BOI16_bosses) C++17
100 / 100
 743 ms 648 KB 
#include <bits/stdc++.h>
#define DEBUG 0
using namespace std;

const int MAX_N = 5e3 + 10;
const long long INF = 1e18 + 7;

vector <int> adj[MAX_N];
bitset <MAX_N> visited;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++) {
        int k;
        cin >> k;
        while(k--) {
            int p;
            cin >> p;
            adj[p].push_back(i);
        }
    }

    long long ans = INF;
    for(int i = 1; i <= n; i++) {
        visited = 0;
        long long sum = 0;

        visited[i] = true;
        queue <pair <int, int>> q;
        q.emplace(i, 1);
        while(!q.empty()) {
            auto [u, c] = q.front();
            q.pop();

            sum += c;
            for(auto v : adj[u]) {
                if(visited[v] == false) {
                    visited[v] = true;
                    q.emplace(v, c + 1);
                }
            }
        }

        if(visited.count() == n) {
            ans = min(ans, sum);
        }
    }
    cout << ans;
    return 0;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:46:28: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |         if(visited.count() == n) {
      |            ~~~~~~~~~~~~~~~~^~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 5 ms 500 KB Output is correct
13 Correct 4 ms 580 KB Output is correct
14 Correct 165 ms 532 KB Output is correct
15 Correct 5 ms 552 KB Output is correct
16 Correct 616 ms 632 KB Output is correct
17 Correct 739 ms 644 KB Output is correct
18 Correct 743 ms 648 KB Output is correct