# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292230 | 2020-09-06T14:37:29 Z | Abdelrahman | Bosses (BOI16_bosses) | C++17 | 615 ms | 768 KB |
#include <bits/stdc++.h> #define endl '\n' #define modulo 1000000007 //#define int long long #pragma GCC optimize("-Ofast") #define float double #define PI 3.141592653589793238462643383279502884 #define sinDegrees(x) sin((x) * PI / 180.0) #define tanDegrees(x) tan((x) * PI / 180.0) #define atanDegrees(x) atan(x)* 180.0 / PI using namespace std; vector<int> children[5001]; bool visited[5001] = {0}; int mini=INT_MAX; int finale = 0, done=0; void solve(int emp) { vector<pair<int, int> > v; visited[emp]=1; v.push_back({emp, 1}); done++; finale++; int x=0; while (x!=v.size()) { if (finale>mini) break; auto p = v[x]; for (int i=0;i<children[p.first].size();i++) { int a = children[p.first][i]; //cout<<a<<" "; if (visited[a]) continue; done++; visited[a]=1; v.push_back({a, p.second+1}); finale+=p.second+1; } x++; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin>>n; for (int i=0;i<n;i++) { int a; cin>>a; while (a--) { int b; cin>>b; children[b-1].push_back(i); } } for (int i=0;i<n;i++) { solve(i); if (done==n) { mini = min(finale, mini); } memset(visited, 0, sizeof(visited)); finale = 0; done=0; } cout<<mini; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 512 KB | Output is correct |
8 | Correct | 1 ms | 512 KB | Output is correct |
9 | Correct | 1 ms | 512 KB | Output is correct |
10 | Correct | 1 ms | 512 KB | Output is correct |
11 | Correct | 1 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 512 KB | Output is correct |
8 | Correct | 1 ms | 512 KB | Output is correct |
9 | Correct | 1 ms | 512 KB | Output is correct |
10 | Correct | 1 ms | 512 KB | Output is correct |
11 | Correct | 1 ms | 384 KB | Output is correct |
12 | Correct | 3 ms | 512 KB | Output is correct |
13 | Correct | 2 ms | 512 KB | Output is correct |
14 | Correct | 131 ms | 640 KB | Output is correct |
15 | Correct | 4 ms | 640 KB | Output is correct |
16 | Correct | 615 ms | 760 KB | Output is correct |
17 | Correct | 204 ms | 768 KB | Output is correct |
18 | Correct | 202 ms | 768 KB | Output is correct |