oj.uz

Submission #36404

# Submission time Handle Problem Language Result Execution time Memory
36404 2017-12-08T16:47:47 Z DoanPhuDuc Bosses (BOI16_bosses) C++
100 / 100
 873 ms 2428 KB 
#include <bits/stdc++.h>

#define FOR(x, a, b) for (int x = a; x <= b; ++x)
#define FOD(x, a, b) for (int x = a; x >= b; --x)
#define REP(x, a, b) for (int x = a; x < b; ++x)
#define DEBUG(X) { cout << #X << " = " << X << endl; }
#define PR(A, n) { cout << #A << " = "; FOR(_, 1, n) cout << A[_] << " "; cout << endl; }
#define PR0(A, n)  { cout << #A << " = "; REP(_, 0, n) cout << A[_] << " "; cout << endl; }

using namespace std;

typedef long long LL;
typedef pair <int, int> II;

const int N = 5e3 + 10;
const int INF = 0x3f3f3f3f;

int n;
int f[N], p[N];

bool ban[N];

vector <int> boss[N], adj[N];

queue <int> Q;

int Compute(int u) {
    FOR(i, 1, n) {
        adj[i].clear();
        p[i] = -1;
    }
    p[u] = 1;
    Q.push(u);
    int cnt = 0, ans = 0;
    while (Q.size()) {
        int u = Q.front(); Q.pop();
        ++cnt;
        ans += p[u];
        REP(k, 0, boss[u].size()) {
            int v = boss[u][k];
            if (p[v] == -1) {
                p[v] = p[u] + 1;
                Q.push(v);
            }
        }
    }
    if (cnt == n) return ans;
        else return INF;
}

int main() {
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif // LOCAL
    scanf("%d", &n);
    FOR(i, 1, n) {
        int m; scanf("%d", &m);
        FOR(j, 1, m) {
            int x; scanf("%d", &x);
            boss[x].push_back(i);
        }
    }
    int ans = INF;
    FOR(i, 1, n) ans = min(ans, Compute(i));
    printf("%d\n", ans);
    return 0;
}

Compilation message

bosses.cpp: In function 'int Compute(int)':
bosses.cpp:5:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(x, a, b) for (int x = a; x < b; ++x)
                                        ^
bosses.cpp:39:9: note: in expansion of macro 'REP'
         REP(k, 0, boss[u].size()) {
         ^
bosses.cpp: In function 'int main()':
bosses.cpp:56:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
bosses.cpp:58:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int m; scanf("%d", &m);
                               ^
bosses.cpp:60:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             int x; scanf("%d", &x);
                                   ^

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2296 KB Output is correct
2 Correct 0 ms 2296 KB Output is correct
3 Correct 0 ms 2296 KB Output is correct
4 Correct 0 ms 2296 KB Output is correct
5 Correct 0 ms 2296 KB Output is correct
6 Correct 0 ms 2296 KB Output is correct
7 Correct 0 ms 2296 KB Output is correct
8 Correct 0 ms 2296 KB Output is correct
9 Correct 0 ms 2296 KB Output is correct
10 Correct 0 ms 2296 KB Output is correct
11 Correct 0 ms 2296 KB Output is correct
12 Correct 6 ms 2428 KB Output is correct
13 Correct 3 ms 2428 KB Output is correct
14 Correct 233 ms 2428 KB Output is correct
15 Correct 43 ms 2428 KB Output is correct
16 Correct 749 ms 2428 KB Output is correct
17 Correct 863 ms 2428 KB Output is correct
18 Correct 873 ms 2428 KB Output is correct