oj.uz

Submission #24438

# Submission time Handle Problem Language Result Execution time Memory
24438 2017-06-07T21:30:28 Z Bruteforceman Bosses (BOI16_bosses) C++11
100 / 100
 656 ms 2292 KB 
#include "bits/stdc++.h"
using namespace std;

vector <int> g[5005];
int d[5005];
int n;

int query(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 : g[x]) {
			if(d[i] == -1) {
				d[i] = 1 + d[x];
				Q.push(i);
			}
		}
	}
	int ans = 0;
	for(int i = 1; i <= n; i++) {
		if(d[i] == -1) return -1;
		else ans += d[i];
	}
	return ans;
}

int main(int argc, char const *argv[])
{
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) {
		int p;
		scanf("%d", &p);
		for(int j = 1; j <= p; j++) {
			int x;
			scanf("%d", &x);
			g[x].push_back(i);
		}
	}
	int ans = INT_MAX;
	for(int i = 1; i <= n; i++) {
		int x = query(i);
		if(x == -1) continue;
		ans = min(ans, x);
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message

bosses.cpp: In function 'int main(int, const char**)':
bosses.cpp:34:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
bosses.cpp:37:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &p);
                  ^
bosses.cpp:40:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &x);
                   ^

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2160 KB Output is correct
2 Correct 0 ms 2160 KB Output is correct
3 Correct 0 ms 2160 KB Output is correct
4 Correct 0 ms 2160 KB Output is correct
5 Correct 0 ms 2160 KB Output is correct
6 Correct 0 ms 2160 KB Output is correct

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2160 KB Output is correct
2 Correct 0 ms 2160 KB Output is correct
3 Correct 0 ms 2160 KB Output is correct
4 Correct 0 ms 2160 KB Output is correct
5 Correct 0 ms 2160 KB Output is correct
6 Correct 0 ms 2160 KB Output is correct
7 Correct 0 ms 2160 KB Output is correct
8 Correct 0 ms 2160 KB Output is correct
9 Correct 0 ms 2160 KB Output is correct
10 Correct 0 ms 2160 KB Output is correct
11 Correct 0 ms 2160 KB Output is correct
12 Correct 3 ms 2292 KB Output is correct
13 Correct 3 ms 2292 KB Output is correct
14 Correct 129 ms 2292 KB Output is correct
15 Correct 6 ms 2292 KB Output is correct
16 Correct 599 ms 2292 KB Output is correct
17 Correct 656 ms 2292 KB Output is correct
18 Correct 643 ms 2292 KB Output is correct