# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53620 | 2018-06-30T14:21:33 Z | ruhanhabib39 | Bosses (BOI16_bosses) | C++17 | 1500 ms | 1680 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 5000; int N; vector<int> par[MAXN + 10]; vector<int> child[MAXN + 10]; int done[MAXN + 10]; vector<int> nxt[MAXN + 10]; int salary[MAXN + 10]; int calc(int u) { int ss = 0; for(int v : nxt[u]) ss += calc(v); salary[u] = 1; for(int v : nxt[u]) salary[u] += salary[v]; return ss + salary[u]; } int work(int root) { queue<int> q; q.push(root); fill(nxt, nxt + N + 1, vector<int>()); done[root] = root; while(!q.empty()) { int u = q.front(); q.pop(); for(int v : child[u]) { if(done[v] == root) continue; done[v] = root; nxt[u].push_back(v); q.push(v); } } for(int u = 1; u <= N; u++) { if(done[u] != root) return 1e9; } return calc(root); } int main() { scanf("%d", &N); for(int u = 1; u <= N; u++) { int sz; scanf("%d", &sz); par[u].resize(sz); for(int& p : par[u]) { scanf("%d", &p); child[p].push_back(u); } } int res = 1e9; for(int u = 1; u <= N; u++) res = min(res, work(u)); printf("%d\n", res); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 632 KB | Output is correct |
2 | Correct | 2 ms | 752 KB | Output is correct |
3 | Correct | 3 ms | 948 KB | Output is correct |
4 | Correct | 3 ms | 948 KB | Output is correct |
5 | Correct | 3 ms | 948 KB | Output is correct |
6 | Correct | 3 ms | 948 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 632 KB | Output is correct |
2 | Correct | 2 ms | 752 KB | Output is correct |
3 | Correct | 3 ms | 948 KB | Output is correct |
4 | Correct | 3 ms | 948 KB | Output is correct |
5 | Correct | 3 ms | 948 KB | Output is correct |
6 | Correct | 3 ms | 948 KB | Output is correct |
7 | Correct | 4 ms | 948 KB | Output is correct |
8 | Correct | 3 ms | 948 KB | Output is correct |
9 | Correct | 3 ms | 948 KB | Output is correct |
10 | Correct | 4 ms | 948 KB | Output is correct |
11 | Correct | 3 ms | 948 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 632 KB | Output is correct |
2 | Correct | 2 ms | 752 KB | Output is correct |
3 | Correct | 3 ms | 948 KB | Output is correct |
4 | Correct | 3 ms | 948 KB | Output is correct |
5 | Correct | 3 ms | 948 KB | Output is correct |
6 | Correct | 3 ms | 948 KB | Output is correct |
7 | Correct | 4 ms | 948 KB | Output is correct |
8 | Correct | 3 ms | 948 KB | Output is correct |
9 | Correct | 3 ms | 948 KB | Output is correct |
10 | Correct | 4 ms | 948 KB | Output is correct |
11 | Correct | 3 ms | 948 KB | Output is correct |
12 | Correct | 14 ms | 1124 KB | Output is correct |
13 | Correct | 11 ms | 1184 KB | Output is correct |
14 | Correct | 383 ms | 1648 KB | Output is correct |
15 | Correct | 163 ms | 1648 KB | Output is correct |
16 | Correct | 936 ms | 1680 KB | Output is correct |
17 | Execution timed out | 1567 ms | 1680 KB | Time limit exceeded |
18 | Halted | 0 ms | 0 KB | - |