oj.uz

Submission #828900

# Submission time Handle Problem Language Result Execution time Memory
828900 2023-08-17T19:02:24 Z serifefedartar Bosses (BOI16_bosses) C++17
100 / 100
 572 ms 660 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 1000000007
#define LOGN 20
#define MAXN 300005

vector<vector<int>> graph;
ll res = 0;
int n;
bool bfs(int node) {
	int cnt = 0;
	vector<bool> vis(n+1, false);
	queue<pair<int,int>> q;
	q.push({node, 1});
	while (!q.empty()) {
		int node = q.front().f;
		int dist = q.front().s;
		q.pop();

		if (vis[node])
			continue;
		vis[node] = true;
		res += dist;
		cnt++;
		for (auto u : graph[node]) {
			if (!vis[u])
				q.push({u, dist+1});
		}
	}

	return cnt == n;
}

int main() {
    fast
    cin >> n;

    graph = vector<vector<int>>(n+1, vector<int>());
    for (int i = 1; i <= n; i++) {
    	int k; cin >> k;
    	for (int j = 0; j < k; j++) {
    		int boss_cand;
  			cin >> boss_cand;
  			graph[boss_cand].push_back(i);
    	}
    }

    ll ans = INT_MAX;
    for (int i = 1; i <= n; i++) {
    	res = 0;
   		bool control = bfs(i);
   		if (control)
   			ans = min(ans, res);
    }
    cout << ans << "\n";
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 324 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 324 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 15 ms 468 KB Output is correct
13 Correct 12 ms 456 KB Output is correct
14 Correct 110 ms 536 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 527 ms 628 KB Output is correct
17 Correct 570 ms 596 KB Output is correct
18 Correct 572 ms 660 KB Output is correct