# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
533215 | kebine | Bosses (BOI16_bosses) | C++17 | 1 ms | 332 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>
using namespace std;
#define ll long long
ll n;
vector<ll> adj[5005];
ll dist[5005];
bool vis[5005];
ll bfs(ll x, ll sum) {
queue <ll> q;
q.push(x);
dist[x] = 1;
vis[x] = true;
int cnt = 0;
while(!q.empty()) {
ll cur = q.front();
cnt++;
q.pop();
for(ll i = 0; i < adj[cur].size(); i++) {
ll next = adj[cur][i];
if (!vis[next]) {
vis[next] = true;
dist[next] = dist[cur] + 1;
sum += dist[next];
q.push(next);
}
}
}
if (cnt >= n) {
return sum;
}
return 1e16;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for(ll i = 1; i <= n; i++) {
ll k;
cin >> k;
for(ll j = 0; j < k; j++) {
ll next;
cin >> next;
adj[next].push_back(i);
//cout << next << " " << i << endl;
}
}
ll mn = 1e16;
for(ll i = 1; i <= n; i++) {
int ans = bfs(i, 1);
if (ans < mn) {
mn = ans;
}
}
cout << mn << "\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... |