oj.uz

Submission #58210

# Submission time Handle Problem Language Result Execution time Memory
58210 2018-07-17T07:29:32 Z PeppaPig Bosses (BOI16_bosses) C++14
100 / 100
 992 ms 1280 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 5e3 + 5;

int n, ans = INT_MAX;
vector<vector<int> > g(N);
int dep[N];

int bfs(int root) {
	int ret = 0;
	queue<int> Q;
	for(int i = 1; i <= n; i++) dep[i] = INT_MAX;

	Q.emplace(root);
	dep[root] = 1;

	while(!Q.empty()) {
		int now = Q.front();
		Q.pop();

		for(int v : g[now]) if(dep[now] + 1 < dep[v]) {
			dep[v] = dep[now] + 1;
			Q.emplace(v);
		} 
	}
	for(int i = 1; i <= n; i++) {
		if(dep[i] == INT_MAX) return INT_MAX;
		ret += dep[i];
	}
	return ret;
}

int main() {
	scanf("%d", &n);
	for(int i = 1, k; i <= n; i++) {
		scanf("%d", &k);
		while(k--) {
			int v;
			scanf("%d", &v);
			g[v].emplace_back(i);
		}
	} 

	for(int i = 1; i <= n; i++) ans = min(ans, bfs(i));
	printf("%d", ans);

	return 0;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
bosses.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &k);
   ~~~~~^~~~~~~~~~
bosses.cpp:45:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &v);
    ~~~~~^~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 4 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 3 ms 680 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 4 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 3 ms 680 KB Output is correct
7 Correct 3 ms 680 KB Output is correct
8 Correct 3 ms 680 KB Output is correct
9 Correct 3 ms 680 KB Output is correct
10 Correct 1 ms 680 KB Output is correct
11 Correct 4 ms 680 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 4 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 3 ms 680 KB Output is correct
7 Correct 3 ms 680 KB Output is correct
8 Correct 3 ms 680 KB Output is correct
9 Correct 3 ms 680 KB Output is correct
10 Correct 1 ms 680 KB Output is correct
11 Correct 4 ms 680 KB Output is correct
12 Correct 10 ms 696 KB Output is correct
13 Correct 9 ms 860 KB Output is correct
14 Correct 181 ms 880 KB Output is correct
15 Correct 18 ms 932 KB Output is correct
16 Correct 770 ms 1064 KB Output is correct
17 Correct 803 ms 1184 KB Output is correct
18 Correct 992 ms 1280 KB Output is correct