oj.uz

Submission #223569

# Submission time Handle Problem Language Result Execution time Memory
223569 2020-04-15T13:04:58 Z kshitij_sodani Bosses (BOI16_bosses) C++17
100 / 100
 790 ms 760 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
vector<int> adj[5001];
int n;
int bfs(int no){
	int dist[n];
	for(int i=0;i<n;i++){
		dist[i]=-1;
	}
	dist[no]=0;
	queue<int> dd;
	dd.push(no);
	while(dd.size()){
		int x=dd.front();
		dd.pop();
		for(auto jj:adj[x]){
			if(dist[jj]==-1 or dist[jj]>dist[x]+1){
				dist[jj]=dist[x]+1;
				dd.push(jj);
			}
		}
	}

	for(int i=0;i<n;i++){
		if(dist[i]==-1){
			return -1;
		}
	}
	int ans=n;
	for(int i=0;i<n;i++){
		ans+=dist[i];
	}


	return ans;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;

	for(int i=0;i<n;i++){
		int k;
		cin>>k;
		int aa;
		for(int j=0;j<k;j++){
			cin>>aa;
			adj[aa-1].pb(i);
		}
	}
	int mi=1000000000;
	for(int i=0;i<n;i++){
		int ma=bfs(i);
		if(ma>-1){
			mi=min(mi,ma);
		}
	}
	cout<<mi<<endl;
	return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 9 ms 640 KB Output is correct
13 Correct 9 ms 640 KB Output is correct
14 Correct 147 ms 632 KB Output is correct
15 Correct 19 ms 640 KB Output is correct
16 Correct 590 ms 640 KB Output is correct
17 Correct 785 ms 760 KB Output is correct
18 Correct 790 ms 760 KB Output is correct