# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
113328 |
2019-05-25T05:19:50 Z |
ckodser |
Bosses (BOI16_bosses) |
C++14 |
|
556 ms |
764 KB |
#include<bits/stdc++.h>
#define ll int
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll>
using namespace :: std;
const ll mod=1e9+7;
const ll maxn=5500;
const ll inf=1e9+900;
vector<ll> ger[maxn];
ll h[maxn];
bool vis[maxn];
ll find_min(ll a,ll n){
memset(vis,0,sizeof vis);
queue<ll> qu;
h[a]=1;
vis[a]=1;
ll cnt=1;
ll ans=1;
qu.push(a);
while(qu.size()){
ll v=qu.front();
qu.pop();
for(auto u:ger[v]){
if(!vis[u]){
vis[u]=1;
qu.push(u);
h[u]=h[v]+1;
ans+=h[u];
cnt++;
}
}
}
if(cnt!=n)return inf;
return ans;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll n,m;
cin>>n;
for(ll i=1;i<=n;i++){
ll k;
cin>>k;
while(k--){
ll v;
cin>>v;
ger[v].pb(i);
}
}
ll ans=inf;
for(ll i=1;i<=n;i++){
ans=min(ans,find_min(i,n));
}
cout<<ans;
}
Compilation message
bosses.cpp: In function 'int main()':
bosses.cpp:48:10: warning: unused variable 'm' [-Wunused-variable]
ll n,m;
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
2 ms |
512 KB |
Output is correct |
8 |
Correct |
2 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Correct |
2 ms |
512 KB |
Output is correct |
11 |
Correct |
3 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
2 ms |
512 KB |
Output is correct |
8 |
Correct |
2 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Correct |
2 ms |
512 KB |
Output is correct |
11 |
Correct |
3 ms |
512 KB |
Output is correct |
12 |
Correct |
6 ms |
512 KB |
Output is correct |
13 |
Correct |
5 ms |
512 KB |
Output is correct |
14 |
Correct |
110 ms |
632 KB |
Output is correct |
15 |
Correct |
5 ms |
512 KB |
Output is correct |
16 |
Correct |
556 ms |
640 KB |
Output is correct |
17 |
Correct |
553 ms |
764 KB |
Output is correct |
18 |
Correct |
546 ms |
760 KB |
Output is correct |