| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 855198 |
2023-09-30T15:18:20 Z |
NK_ |
Bosses (BOI16_bosses) |
C++17 |
|
0 ms |
348 KB |
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define pb push_back
#define pf push_front
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using vi = V<int>;
using vpi = V<pi>;
using ll = long long;
using pl = pair<ll, ll>;
using vpl = V<pl>;
using vl = V<ll>;
using db = long double;
template<class T> using pq = priority_queue<T, V<T>, greater<T>>;
const int MOD = 1e9 + 7;
const ll INFL = ll(1e17);
const int LG = 18;
int main() {
cin.tie(0)->sync_with_stdio(0);
int N; cin >> N;
V<vi> adj(N); for(int i = 0; i < N; i++) {
int k; cin >> k;
while(k--) {
int x; cin >> x; --x;
adj[x].pb(i);
}
}
auto bfs = [&](int r) {
vi dst(N, MOD), vis(N); dst[r] = 0;
queue<int> q; q.push(r);
while(sz(q)) {
int u = q.front(); q.pop();
if (vis[u]) continue;
vis[u] = 1;
for(auto& v : adj[u]) {
if (dst[v] > dst[u]+1) {
dst[v] = dst[u] + 1;
q.push(v);
}
}
}
int ans = 0;
for(int u = 0; u < N; u++) {
ans += dst[u] + 1;
}
return ans;
};
int ans = MOD;
for(int i = 0; i < N; i++) ans = min(ans, bfs(i));
cout << ans << nl;
exit(0-0);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
