# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
725132 | 2023-04-17T00:29:26 Z | buffering | Bosses (BOI16_bosses) | C++17 | 624 ms | 656 KB |
#include <bits/stdc++.h> using namespace std; void IO(string s = "") { if (s == "") { freopen("input.txt", "r", stdin); freopen("output 2.txt", "w", stdout); } if (s != "") { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } } int main() { ios::sync_with_stdio(false); cin.tie(0); //IO(); int n; cin >> n; vector<vector<int>> adj(n); for (int i = 0; i < n; i++) { int m; cin >> m; for (int j = 0; j < m; j++) { int v; cin >> v; v--; adj[v].push_back(i); } } long long ans = 1e9; for (int i = 0; i < n; i++) { vector<int> depths(n, -1); queue<int> q; q.push(i); depths[i] = 0; while (!q.empty()) { int node = q.front(); q.pop(); for (int v: adj[node]) { if (depths[v] == -1) { depths[v] = depths[node] + 1; q.push(v); } } } if (*min_element(depths.begin(), depths.end()) == 0) { long long curr = n; for (auto d: depths) curr += d; ans = min(ans, curr); } } cout << ans << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 316 KB | Output is correct |
4 | Correct | 1 ms | 320 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 316 KB | Output is correct |
4 | Correct | 1 ms | 320 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 316 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 316 KB | Output is correct |
4 | Correct | 1 ms | 320 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 316 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 1 ms | 212 KB | Output is correct |
12 | Correct | 4 ms | 384 KB | Output is correct |
13 | Correct | 3 ms | 340 KB | Output is correct |
14 | Correct | 139 ms | 552 KB | Output is correct |
15 | Correct | 30 ms | 468 KB | Output is correct |
16 | Correct | 502 ms | 644 KB | Output is correct |
17 | Correct | 615 ms | 656 KB | Output is correct |
18 | Correct | 624 ms | 656 KB | Output is correct |