Submission #865962

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
865962	2023-10-25T06:19:09 Z	iskhakkutbilim	Bosses (BOI16_bosses)	C++17	100 / 100	561 ms	956 KB

bosses

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 5000;
int n;
vector<int> g[N+1];
 
 
int sum = 0;
void dfs(int v, int par, vector< vector<int> > &adj, vector<int> &sub){
	sub[v] = 1;
	for(int to : adj[v]){
		if(to == par) continue;
		dfs(to, v, adj, sub);
		sub[v]+= sub[to];	
	}
	sum+= sub[v];
}
 
 
int f(int root){
	queue<int> q; q.push(root);
	vector<int> dis(n+1, -1), parent(n+1, 0), ord;
	dis[root] = 0;
	while(!q.empty()){
		int v =q.front(); q.pop();
		for(int to : g[v]){
			if(dis[to] == -1){
				q.push(to);
				dis[to] = dis[v] + 1;
				parent[to] = v;
				ord.push_back(to);
			}
		}
	}
	for(int i = 1;i <= n; i++){
		if(dis[i] == -1){
			return LLONG_MAX;
		}
		dis[i] = 1;
	}
	sum = 0;
	reverse(all(ord));
	for(int x : ord){
		sum+= dis[x];
		dis[parent[x]]+= dis[x];
	}
	sum+= dis[root];
	return sum;
}
 
main(){
   ios::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
	cin >> n;
	for(int i = 1;i <= n; i++){
		int sz; cin >> sz;
		for(int j = 0;j < sz; j++){
			int x; cin >> x;
			g[x].push_back(i);
		}
	}
	int ans = LLONG_MAX;
	for(int i = 1;i <= n; i++){
		ans = min(ans, f(i));
	}
	cout << ans;
	return 0;
}

Compilation message

bosses.cpp:56:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   56 | main(){
      | ^~~~

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	348 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	348 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	0 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	348 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	0 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	3 ms	752 KB	Output is correct
14	Correct	99 ms	604 KB	Output is correct
15	Correct	7 ms	860 KB	Output is correct
16	Correct	478 ms	956 KB	Output is correct
17	Correct	557 ms	856 KB	Output is correct
18	Correct	561 ms	912 KB	Output is correct