oj.uz

Submission #654301

# Submission time Handle Problem Language Result Execution time Memory
654301 2022-10-30T22:42:11 Z bogdanvladmihai Bosses (BOI16_bosses) C++14
100 / 100
 753 ms 98704 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<vector<int>> g(n);
	for (int i = 0; i < n; i++) {
		int cnt; cin >> cnt;
		for (int j = 0; j < cnt; j++) {
			int x; cin >> x;
			x--;
			g[x].push_back(i);
		}
	}
	int answer = INT_MAX;
	vector<vector<int>> dist(n, vector<int>(n, INT_MAX));
	for (int u = 0; u < n; u++) {
		queue<int> q;
		q.push(u);
		dist[u][u] = 1;
		int sum = 0, cnt = 0;
		while ((int)q.size() > 0) {
			int x = q.front();
			sum += dist[u][x];
			cnt++;
			q.pop();
			for (const int &v : g[x]) {
				if (dist[u][v] != INT_MAX) {
					continue;
				}
				dist[u][v] = dist[u][x] + 1;
				q.push(v);
			}
		}
		if (cnt == n) {
			answer = min(answer, sum);
		}
	}
	cout << answer << "\n";
	return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 568 KB Output is correct
13 Correct 5 ms 596 KB Output is correct
14 Correct 176 ms 98664 KB Output is correct
15 Correct 45 ms 98504 KB Output is correct
16 Correct 622 ms 98648 KB Output is correct
17 Correct 753 ms 98676 KB Output is correct
18 Correct 747 ms 98704 KB Output is correct