Submission #1275846

#TimeUsernameProblemLanguageResultExecution timeMemory
1275846namiousBosses (BOI16_bosses)C++20
0 / 100
1 ms572 KiB
#include <bits/stdc++.h> using namespace std; #define pii pair<int,int> #define pb push_back #define endl '\n' #define fast_io ios_base::sync_with_stdio(0) ,cin.tie(0),cout.tie(0); #pragma GCC optimize("O3,unroll-loops") const int maxn = 5e3+3 , mod = 1e9+7 , inf = 1e9; int n; vector <int> adj[maxn]; int dis[maxn]; int32_t main(){ fast_io cin >> n; for(int i = 1 ; i <= n ; i++){ int k; cin >> k; for(int j = 1 ; j <= k ; j++){ int x; cin >> x; adj[x].pb(i); } } int ans = inf; for(int i = 1 ; i <= n ; i++){ for(int j = 1 ; j <= n ; j++) dis[j] = inf; queue <int> q; q.push(i) , dis[i] = 1; while(q.size()){ int v = q.front(); q.pop(); for(auto u : adj[v]) if(dis[v]+1 < dis[u]){ dis[u] = dis[v]+1 , q.push(u); } } int sum = 0; for(int j = 1 ; j <= n ; j++) sum += dis[j]; ans = min(ans , sum); } cout << ans << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...