oj.uz

Submission #145056

# Submission time Handle Problem Language Result Execution time Memory
145056 2019-08-18T15:38:25 Z mosesmayer Bosses (BOI16_bosses) C++17
100 / 100
 1110 ms 816 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef vector<int> vi;
typedef long long LL;

const LL LINF = 1e18;
const int mxsz = 5e3 + 5;
int n;
vi adj[mxsz];

queue<int> q;
int dep[mxsz], ord[mxsz], lvl[mxsz];
LL test(int rt){
	while (!q.empty()) q.pop();
	fill(dep+1, dep+n+1, 0x3f3f3f3f);
	fill(lvl, lvl+n+1, 0);
	dep[rt] = 0;
	q.push(rt);
	while (!q.empty()){
		int u = q.front(); q.pop();
		for (int nx : adj[u]){
			if (dep[nx] > dep[u] + 1){
				dep[nx] = dep[u] + 1;
				q.push(nx);
			}
		}
	}
	int mx = 0;
	for (int i = 1; i <= n; i++) mx = max(mx, dep[i]);
	if (mx > n) return LINF;
	for (int i = 1; i <= n; i++) lvl[dep[i]]++;
	LL tot = 0, p = 0;
	for (int i = n; i >= 0; --i){
		tot += lvl[i];
		tot += p;
		p += lvl[i];
	}
	return tot;
}
void read(){
	cin >> n;
	for (int i = 1, t; i <= n; i++){
		cin >> t;
		for (int j = 0, u; j < t; j++){
			cin >> u;
			adj[u].pb(i);
		}
		ord[i] = i;
	}
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	read();
	LL mn = LINF;
	for (int i = 1; i <= n; i++){
		LL cur = test(i);
		mn = min(mn, cur);
	}
	cout << mn << '\n';
	return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 552 KB Output is correct
10 Correct 3 ms 532 KB Output is correct
11 Correct 3 ms 504 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 552 KB Output is correct
10 Correct 3 ms 532 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 7 ms 632 KB Output is correct
13 Correct 6 ms 632 KB Output is correct
14 Correct 190 ms 632 KB Output is correct
15 Correct 50 ms 676 KB Output is correct
16 Correct 727 ms 764 KB Output is correct
17 Correct 1070 ms 816 KB Output is correct
18 Correct 1110 ms 760 KB Output is correct