# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706411 | Alihan_8 | Bosses (BOI16_bosses) | C++17 | 625 ms | 708 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n;
vector <int> g[n];
for ( int i = 0; i < n; i++ ){
int x; cin >> x;
while ( x-- ){
int t; cin >> t;
g[--t].pb(i);
}
}
const int inf = 1e18;
auto bfs = [&](int st){
vector <int> dis(n, -1);
dis[st] = 1;
queue <int> q; q.push(st);
while ( !q.empty() ){
int cur = q.front();
q.pop();
for ( auto to: g[cur] ){
if ( dis[to] != -1 ) continue;
dis[to] = dis[cur]+1;
q.push(to);
}
}
int cnt = 0;
for ( auto i: dis ){
cnt += i;
if ( i == -1 ) return inf;
}
return cnt;
};
int Mn = inf;
for ( int i = 0; i < n; i++ ){
Mn = min(Mn, bfs(i));
}
cout << Mn;
cout << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |