oj.uz

답안 #937318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937318 2024-03-03T20:23:36 Z fasdfhasjfaksdfjhalskdjhf Bosses (BOI16_bosses) C++14
100 / 100
 412 ms 756 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N; cin >> N;
	
	vector<vector<int>> workers(N + 1);
	for(int i = 1; i <= N; i++){
		int K; cin >> K;
		while(K--){
			int x; cin >> x;
			workers[x].push_back(i);
		}
	}

	long long final_ans = LONG_LONG_MAX;
	for(int i = 1; i <= N; i++){
		queue<pair<int, int>> q;
		q.push({i, 1});
		
		vector<bool> vis(N + 1, false);
		vis[i] = 1;
		int visited = 1;
		long long ans = 0;
		while(!q.empty()){
			pair<int, int> cur = q.front();
			q.pop();
			for(int j : workers[cur.first]){
				if(vis[j]) continue;
				vis[j] = 1;
				visited++;
				ans += (cur.second + 1);
				q.push({j, cur.second + 1});
			}
		}

		/*cout << visited << "\n";
		for(int j = 1; j <= N; j++){
			cout << j << " " << Tree[j].parent << " " << Tree[j].depth << "\nchildren are : ";
			for(int k : Tree[j].children) cout << k << " ";
			cout << "\n\n";
		}
		cout << "\n\n==============================\n";
		cout << i << " ";*/

		if(visited == N){
			final_ans = min(final_ans, ans);
		}
		else{
			//cout << "Not valid\n\n\n";
		}
	}
	cout << final_ans + 1;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 500 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 113 ms 640 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 412 ms 732 KB Output is correct
17 Correct 405 ms 756 KB Output is correct
18 Correct 397 ms 604 KB Output is correct