oj.uz

Submission #936299

# Submission time Handle Problem Language Result Execution time Memory
936299 2024-03-01T14:23:19 Z wateronenn Bosses (BOI16_bosses) C++14
0 / 100
 2 ms 2652 KB 
#include<bits/stdc++.h>
#define pii pair<int,int>
#define f first
#define s second
using namespace std;

const int N = 1e5+9;
vector<int> g[N];

int main(){
	cin.tie(0)->sync_with_stdio(false);
	int n,m;
	cin>>n;
	for(int i=1;i<=n;i++){
		int k;
		cin>>k;
		for(int j=1;j<=k;j++){
			cin>>m;
			g[m].push_back(i);
		}
	}
	int sum = INT_MAX;
	
	for(int i=1;i<=n;i++){
		bool visit[n+1]={0};
		visit[i] = true;
		stack<pii> s;
		s.push({i,1});
		int nub = 0;
		int cnt = 0; //count node
		while(!s.empty()){
			int u = s.top().f;
			int w = s.top().s;
		//	cout<<u<<"* ";
			s.pop();
			nub+=w;
			visit[u] = true;
			cnt++;
			for(auto v:g[u]){
				if(!visit[v]) {
					s.push({v,w+1});
				}
			}
		}
	//	cout<<nub<<endl;
		if(cnt<n) continue;
		sum = min(sum,nub);
	
	}
	cout<<sum;
	
	return 0;
}
/*

4
1 4
3 1 3 4
2 1 2
1 3

*/

Subtask #1
0 / 22.0

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

Subtask #2
0 / 45.0

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

Subtask #3
0 / 33.0

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