oj.uz

답안 #98967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98967 2019-02-27T19:12:33 Z zicon35 Bosses (BOI16_bosses) C++14
100 / 100
 617 ms 888 KB 
#include<bits/stdc++.h>

using namespace std;

int n,k,v;
vector< vector<int>> adj;

int d[20005];

int bfs(int root) {

	memset(d, -1, sizeof d);
	queue<int> Q;
	Q.push(root);
	d[root] = 1;
	while(!Q.empty()) {
		int x = Q.front();
		Q.pop();
 
		for(auto i : adj[x]) {
			if(d[i] == -1) {
				d[i] = 1 + d[x];
				Q.push(i);
			}
		}
	}
	int a = 0;
	for(int i = 1; i <= n; i++) {
		if(d[i] == -1) return -1;
		else a += d[i];
	}
	return a;
}

int solve(){
    int k,v;
    cin>>n;
    adj.resize(n+2);
    for(int i=1;i<=n;i++){
       cin>>k;
       for(int j=1;j<=k;j++){
            cin>>v;
            adj[v].push_back(i);
       } 
    }

    int ans = INT_MAX; 
    for(int i=1;i<=n;i++){
        int x = bfs(i);
        if(x == -1) continue;
        ans = min(ans,x);
    }
    return ans;
}

int main(){

    cout<<solve()<<endl;
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 168 ms 640 KB Output is correct
15 Correct 26 ms 640 KB Output is correct
16 Correct 598 ms 760 KB Output is correct
17 Correct 617 ms 768 KB Output is correct
18 Correct 591 ms 888 KB Output is correct