# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
967898 |
2024-04-23T04:50:48 Z |
PM1 |
Bosses (BOI16_bosses) |
C++17 |
|
421 ms |
732 KB |
#include <bits/stdc++.h>
using namespace std;
const int mxn=5e3+5;
int n,ans=1e9,mark[mxn];
vector<int>v[mxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
int k;
cin>>k;
while(k--){
int x;
cin>>x;
v[x].push_back(i);
}
}
for(int i=1;i<=n;i++){
memset(mark,0,sizeof mark);
int res=0;
queue<int>q;
mark[i]=1;
q.push(i);
while(!q.empty()){
int x=q.front();
q.pop();
res+=mark[x];
for(auto j:v[x]){
if(!mark[j]){
mark[j]=mark[x]+1;
q.push(j);
}
}
}
int cnt=1;
for(int j=1;j<=n;j++){
if(mark[j]==0)
cnt=0;
}
if(!cnt)
continue;
ans=min(res,ans);
}
cout<<ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
3 ms |
604 KB |
Output is correct |
13 |
Correct |
3 ms |
604 KB |
Output is correct |
14 |
Correct |
80 ms |
648 KB |
Output is correct |
15 |
Correct |
13 ms |
600 KB |
Output is correct |
16 |
Correct |
421 ms |
704 KB |
Output is correct |
17 |
Correct |
396 ms |
604 KB |
Output is correct |
18 |
Correct |
396 ms |
732 KB |
Output is correct |