oj.uz

Submission #954678

# Submission time Handle Problem Language Result Execution time Memory
954678 2024-03-28T10:31:12 Z 4QT0R Bosses (BOI16_bosses) C++17
0 / 100
 1 ms 576 KB 
#include <bits/stdc++.h>
using namespace std;

int visited[5002];
vector<int> graph[5002];
int iter=0;
queue<pair<int,int>> q;

int bfs(int v){
	visited[v]=iter;
	q.push({v,1});
	int ans=0;
	while(q.size()){
		auto [v,d]=q.front();
		q.pop();
		ans+=d;
		for (auto u : graph[v])if (visited[u]!=iter){
			visited[u]=iter;
			q.push({u,d+1});
		}
	}
	return ans;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n,k,v;
	cin >> n;
	for (int i = 1; i<=n; i++){
		cin >> k;
		for (int j = 1; j<=k; j++){
			cin >> v;
			graph[v].push_back(i);
		}
	}
	int mn=1e9;
	for (int i = 1; i<=n; i++){
		iter++;
		mn=min(mn,bfs(i));
	}
	cout << mn << '\n';
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 576 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 576 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 576 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -