oj.uz

답안 #723689

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
723689 2023-04-14T07:33:59 Z Mardonbekhazratov Bosses (BOI16_bosses) C++17
0 / 100
 2 ms 212 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int INF=1e9;
vector<vector<int>>v,g;
vector<bool>vis;
vector<int>a;
int n;

void dfs(int x){
	vis[x]=true;
	int s=0;
	for(int z:v[x]){
		if(!vis[z]){
			g[x].push_back(z);
			dfs(z);
			s+=a[z];
		}
	}
	a[x]+=s;
}


int solve(int x){
	g.resize(n+1);
	vis.assign(n+1,false);
	a.assign(n+1,1);
	dfs(x);
	int s=0;
	for(int i=1;i<=n;i++) s+=a[i];
	return s;
}


int main(){
	cin>>n;
	v.resize(n+1);
	for(int i=1;i<=n;i++){
		int k;cin>>k;
		for(int j=0;j<k;j++){
			int x;cin>>x;
			v[x].push_back(i);
		}
	}
	int res=INF;
	for(int i=1;i<=n;i++){
		res=min(res,solve(i));
	}
	cout<<res;
}

Subtask #1
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -