| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 954681 |
2024-03-28T10:37:26 Z |
4QT0R |
Bosses (BOI16_bosses) |
C++17 |
|
515 ms |
860 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll visited[5002];
vector<ll> graph[5002];
ll iter=0;
queue<pair<ll,ll>> q;
ll bfs(ll v, ll n){
visited[v]=iter;
q.push({v,1});
ll ans=0;
while(q.size()){
auto [v,d]=q.front();
q.pop();
ans+=d;
for (auto u : graph[v])if (visited[u]!=iter){
visited[u]=iter;
q.push({u,d+1});
}
}
for (ll i = 1; i<=n; i++)if (visited[i]!=iter)return 1e18;
return ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,k,v;
cin >> n;
for (ll i = 1; i<=n; i++){
cin >> k;
for (ll j = 1; j<=k; j++){
cin >> v;
graph[v].push_back(i);
}
}
ll mn=1e18;
for (ll i = 1; i<=n; i++){
iter++;
mn=min(mn,bfs(i,n));
}
cout << mn << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
356 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
356 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
3 ms |
600 KB |
Output is correct |
| 13 |
Correct |
3 ms |
604 KB |
Output is correct |
| 14 |
Correct |
116 ms |
712 KB |
Output is correct |
| 15 |
Correct |
3 ms |
860 KB |
Output is correct |
| 16 |
Correct |
487 ms |
836 KB |
Output is correct |
| 17 |
Correct |
510 ms |
816 KB |
Output is correct |
| 18 |
Correct |
515 ms |
600 KB |
Output is correct |
