| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 569150 |
2022-05-26T19:32:42 Z |
beaconmc |
Bosses (BOI16_bosses) |
C++14 |
|
1500 ms |
1268 KB |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("avx,avx2")
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
using namespace std;
ll n;
vector<vector<ll>> bosses;
vector<ll> edges[5001];
vector<ll> newedges[5001];
ll sum = 0;
int dfs(ll a){
ll sus = 1;
for (auto&i : newedges[a]){
sus += dfs(i);
}
sum += sus;
return sus;
}
ll solve(ll a){
FOR(i,0,5001){
edges[i] = {};
newedges[i] = {};
}
FOR(i,0,n){
for (auto&j : bosses[i]){
edges[j].push_back(i+1);
}
}
vector<bool> visited(n+1);
queue<ll> q;
q.push(a);
visited[a] = 1;
while (q.size()){
ll node = q.front();
q.pop();
for (auto&i : edges[node]){
if (!visited[i]){
q.push(i);
visited[i] = 1;
newedges[node].push_back(i);
}
}
}
sum = 0;
dfs(a);
FOR(i,1,n+1){
if (!visited[i]) return 1000000000;
}
return sum;
}
int main(){
cin >> n;
FOR(i,0,n){
ll temp; cin >> temp;
vector<ll> templis(temp);
FOR(i,0,temp) cin >> templis[i];
bosses.push_back(templis);
}
ll mini = 1000000000;
FOR(i,1,n+1){
mini = min(mini, solve(i));
}
cout << mini;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Correct |
1 ms |
468 KB |
Output is correct |
| 5 |
Correct |
1 ms |
468 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Correct |
1 ms |
468 KB |
Output is correct |
| 5 |
Correct |
1 ms |
468 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
2 ms |
468 KB |
Output is correct |
| 8 |
Correct |
2 ms |
468 KB |
Output is correct |
| 9 |
Correct |
1 ms |
468 KB |
Output is correct |
| 10 |
Correct |
3 ms |
468 KB |
Output is correct |
| 11 |
Correct |
2 ms |
468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Correct |
1 ms |
468 KB |
Output is correct |
| 5 |
Correct |
1 ms |
468 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
2 ms |
468 KB |
Output is correct |
| 8 |
Correct |
2 ms |
468 KB |
Output is correct |
| 9 |
Correct |
1 ms |
468 KB |
Output is correct |
| 10 |
Correct |
3 ms |
468 KB |
Output is correct |
| 11 |
Correct |
2 ms |
468 KB |
Output is correct |
| 12 |
Correct |
17 ms |
832 KB |
Output is correct |
| 13 |
Correct |
12 ms |
852 KB |
Output is correct |
| 14 |
Correct |
679 ms |
1068 KB |
Output is correct |
| 15 |
Correct |
363 ms |
1000 KB |
Output is correct |
| 16 |
Execution timed out |
1566 ms |
1268 KB |
Time limit exceeded |
| 17 |
Halted |
0 ms |
0 KB |
- |
