oj.uz

Submission #422143

# Submission time Handle Problem Language Result Execution time Memory
422143 2021-06-09T18:50:03 Z victoriad Bosses (BOI16_bosses) C++14
100 / 100
 734 ms 708 KB 
#include <cmath>
#include <cstdio>
#include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <map>
using namespace std;
 int x,t;
 void bfs(vector<vector<int> >&g,int n,int y){
	 queue<int>q;
	 q.push(n);
	 vector<int>s(y,1e9);
	 s[n]=1;
	 while(!q.empty()){
		 t++;
		 int a=q.front();
		 q.pop();
		 for(int i:g[a]){
			 if(s[i]>s[a]+1){
				 s[i]=s[a]+1;
				 x+=s[i];
				 q.push(i);
			 }
		 }
	 }
 }


int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	int n,k,a;
	cin>>n;
	vector<vector<int> >em(n);
	int r=-1;
	for(int i=0;i<n;i++){
		cin>>k;
		while(k--){
			cin>>a;
			a--;
			em[a].push_back(i);
		}
	}
	int ans=1e9;
	for(int i=0;i<n;i++){
		x=1;
		t=0;
		bfs(em,i,n);
		if(t==n){
		ans=min(x,ans);
		}
	}
	cout<<ans<<"\n";
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:38:6: warning: unused variable 'r' [-Wunused-variable]
   38 |  int r=-1;
      |      ^

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 4 ms 332 KB Output is correct
14 Correct 137 ms 552 KB Output is correct
15 Correct 18 ms 576 KB Output is correct
16 Correct 576 ms 632 KB Output is correct
17 Correct 734 ms 708 KB Output is correct
18 Correct 726 ms 648 KB Output is correct