oj.uz

답안 #978205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978205 2024-05-09T03:17:54 Z Amaarsaa Bosses (BOI16_bosses) C++14
100 / 100
 863 ms 1148 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long ;
vector < ll > adj[5002], ad[5003];
ll n;
ll C[5003];
void Dfs(ll x) {
	for ( ll X : ad[x]) {
		Dfs(X);
		C[x] += C[X];
	}
	
}
ll Go(ll x) {
	ll i, node;
	queue < ll > q;
	ll D[5003], cnt = 1;
	for (i = 1; i <= n; i ++) D[i] = -1, C[i] = 1, ad[i].clear();
	q.push(x);
	D[x] = 0;
	while(!q.empty()) {
		node= q.front();
		q.pop();
		for ( ll child : adj[node] ) {
			if ( D[child] == -1) {
				q.push(child);
				ad[node].push_back(child);
				cnt ++;
				D[child] = 1;
			}
		}
	}
	if ( cnt != n) return -1;
	Dfs(x);
	ll s = 0;
	for ( i = 1; i <= n; i ++) s += C[i];
	return s;
}

int main() {
//	freopen("moocast.in", "r", stdin);
//	freopen("moocast.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	ll i, j, x, m, s, ans;

	cin >> n;
	
	for (i = 1; i <= n; i ++) {
		cin >> m;
		for (j = 1; j <= m; j ++) {
			cin >> x;
			adj[x].push_back(i);	
		}
	}
	ans = LONG_LONG_MAX;
	for (i = 1; i <= n; i ++) {
		s = Go(i);
		if ( s != -1) ans= min(ans, s);
	}
	cout << ans << endl;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 3 ms 856 KB Output is correct
14 Correct 153 ms 1024 KB Output is correct
15 Correct 44 ms 976 KB Output is correct
16 Correct 556 ms 1148 KB Output is correct
17 Correct 812 ms 1136 KB Output is correct
18 Correct 863 ms 1140 KB Output is correct