oj.uz

Submission #943800

# Submission time Handle Problem Language Result Execution time Memory
943800 2024-03-12T01:01:26 Z phoenix0423 Bosses (BOI16_bosses) C++17
100 / 100
 408 ms 3668 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
#define lowbit(x) x&-x
const int INF = 1e18;
const int maxn = 1e5 + 5;
const int N = 1e9 + 7;
vector<int> adj[maxn];
int dep[maxn];

signed main(void){
	fastio;
	int n;
	cin>>n;
	for(int i = 0; i < n; i++){
		int d;
		cin>>d;
		for(int j = 0; j < d; j++){
			int x;
			cin>>x;
			x--;
			adj[x].pb(i);
		}
	}
	int ans = INF;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++) dep[j] = 0;
		dep[i] = 1;
		queue<int> q;
		q.push(i);
		int cnt = 0, cur = 0;
		while(!q.empty()){
			int pos = q.front(); q.pop();
			cnt++;
			cur += dep[pos];
			for(auto x : adj[pos]){
				if(dep[x]) continue;
				dep[x] = dep[pos] + 1;
				q.push(x);
			}
		}
		if(cnt < n) continue;
		ans = min(ans, cur);
	}
	cout<<ans<<"\n";
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3160 KB Output is correct
5 Correct 1 ms 3160 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3160 KB Output is correct
5 Correct 1 ms 3160 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 1 ms 3160 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 1 ms 3412 KB Output is correct
10 Correct 1 ms 3160 KB Output is correct
11 Correct 1 ms 3164 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3160 KB Output is correct
5 Correct 1 ms 3160 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 1 ms 3160 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 1 ms 3412 KB Output is correct
10 Correct 1 ms 3160 KB Output is correct
11 Correct 1 ms 3164 KB Output is correct
12 Correct 4 ms 3420 KB Output is correct
13 Correct 3 ms 3420 KB Output is correct
14 Correct 68 ms 3420 KB Output is correct
15 Correct 4 ms 3420 KB Output is correct
16 Correct 399 ms 3668 KB Output is correct
17 Correct 365 ms 3652 KB Output is correct
18 Correct 408 ms 3652 KB Output is correct