oj.uz

Submission #924997

# Submission time Handle Problem Language Result Execution time Memory
924997 2024-02-10T10:43:05 Z NintsiChkhaidze Bosses (BOI16_bosses) C++17
100 / 100
 438 ms 872 KB 
#include <bits/stdc++.h>
#define ll long long
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#define left (h<<1),l,(l + r)/2
#define right ((h<<1)|1),(l + r)/2 + 1,r
#define int ll
using namespace std;

const int N = 5000 + 3;

int vis[N],dep[N],cnt[N];
vector <int> v[N];

signed main(){
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);

	int n;
	cin>>n;

	for (int i = 1; i <= n; i++){
		int k;
		cin>>k;

		for (int j= 1; j <= k; j++){
			int x;
			cin>>x;
			v[x].pb(i);
		}
	}

	int ans = 1e18;
	for (int root = 1; root <= n; root++){
		for (int i = 1;i <= n; i++)
			dep[i] = 0,cnt[i] = 0;
		queue <int> q;
		q.push(root);
		dep[root] = 1;

		int c=0;
		while(q.size()){
			int x = q.front(); q.pop();
			++c;
			for (int to: v[x]){
				if (!dep[to]) {
					dep[to] = dep[x] + 1;
					q.push(to);
				}
			}
		}
		if (c < n) continue;

		for(int i=1;i<=n;i++)
			cnt[dep[i]]++;

		int sum = n,cur = n;	
		for (int i = 1; i <= n; i++){
			cur -= cnt[i];
			sum += cur;
		}
		ans=min(ans,sum);
	}
	cout<<ans;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 79 ms 728 KB Output is correct
15 Correct 6 ms 600 KB Output is correct
16 Correct 425 ms 872 KB Output is correct
17 Correct 438 ms 872 KB Output is correct
18 Correct 419 ms 860 KB Output is correct