제출 #349329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349329		mp007mp	Bosses (BOI16_bosses)	C++14	100 / 100	766 ms	768 KiB

bosses

#include<bits/stdc++.h>
#define S second 
#define F first
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
const int maxn=5050;
int inf = 1e9;
vector<int> adj[maxn];
queue<int> q;
int mark[maxn];
int dist[maxn];
ll ans = inf;
int n;
ll bfs(int v){
	ll tmp=0;
	fill(mark,mark+maxn,0);
	fill(dist,dist+maxn,inf);
	dist[v]=1;
	tmp++;
	mark[v]=1;
	q.push(v);
	while(!q.empty()){
		v = q.front();
		q.pop();
		for(int u:adj[v]){
			if(!mark[u]){
				mark[u]=1;
				dist[u] = dist[v]+1;
				tmp += dist[u];
				q.push(u);
			}
		}
	}
	for(int i=1;i<=n;i++){
		if(!mark[i]){
			return inf;
		}
	}
	return tmp;
}
int main(){
	cin>>n;
	for(int v=1;v<=n;v++){
		int x;
		cin>>x;
		for(int j=0;j<x;j++){
			int u;
			cin>>u;
			adj[u].push_back(v);
		}
	}
	for(int i=1;i<=n;i++){
		ans = min(ans,bfs(i));
	}
	cout<<ans;
	return 0;
}

• Subtask 1: 22 / 22
• Subtask 2: 45 / 45
• Subtask 3: 33 / 33