oj.uz

Submission #704256

# Submission time Handle Problem Language Result Execution time Memory
704256 2023-03-02T02:06:13 Z anha3k25cvp Bosses (BOI16_bosses) C++14
100 / 100
 633 ms 668 KB 
#include <bits/stdc++.h>
#define ll long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>

using namespace std;

const int N = 1 + 1e5;
const int inf = 7 + 1e9;

int n;
vector <int> h;
vector <vector <int>> g;

int cal(int root) {
    h.assign(n + 1, 0);
    queue <int> q;
    q.push(root);
    h[root] = 1;
    int cnt = 0;
    while (!q.empty()) {
        int u = q.front(); q.pop();
        cnt ++;
        for (int v : g[u])
            if (!h[v]) {
                h[v] = h[u] + 1;
                q.push(v);
            }
    }
    if (cnt < n)
        return inf;
    int ans = 0;
    for (int i = 1; i <= n; i ++)
        ans += h[i];
    return ans;
}

int main() {
#define TASKNAME "bosses"
    ios_base :: sync_with_stdio (0);
    cin.tie (0);
    if ( fopen( TASKNAME".inp", "r" ) ) {
        freopen( TASKNAME".inp", "r", stdin );
        freopen( TASKNAME".out", "w", stdout );
    }
    cin >> n;
    g.resize(n + 1);
    for (int i = 1; i <= n; i ++) {
        int k;
        cin >> k;
        while (k --) {
            int u;
            cin >> u;
            g[u].push_back(i);
        }
    }
    int ans = inf;
    for (int i = 1; i <= n; i ++)
        ans = min(ans, cal(i));
    cout << ans;
    return 0;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:45:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         freopen( TASKNAME".inp", "r", stdin );
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bosses.cpp:46:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |         freopen( TASKNAME".out", "w", stdout );
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 3 ms 396 KB Output is correct
14 Correct 115 ms 468 KB Output is correct
15 Correct 12 ms 580 KB Output is correct
16 Correct 479 ms 644 KB Output is correct
17 Correct 628 ms 664 KB Output is correct
18 Correct 633 ms 668 KB Output is correct