oj.uz

Submission #24763

# Submission time Handle Problem Language Result Execution time Memory
24763 2017-06-13T09:49:35 Z nibnalin Bosses (BOI16_bosses) C++14
100 / 100
 809 ms 2444 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

typedef long long int lli;

const lli maxn = lli(5e3)+5, inf = lli(5e14)+5;

lli n, D[maxn];
vector<lli> graph[maxn];

lli solve(lli node)
{
	queue<pair<lli, lli>> Q;
	for(lli i = 0;i < n;i++) D[i] = inf;
	D[node] = 0;
	Q.push({0, node});
	while(!Q.empty())
	{
		pair<lli, lli> top = Q.front();
		Q.pop();

		for(auto it: graph[top.second])
		{
			if(D[it] == inf)
			{
				D[it] = 1+D[top.second];
				Q.push({D[it], it});
			}
		}
	}

	lli ret = n;
	for(lli i = 0;i < n;i++)
	{
		ret += D[i];
		if(D[i] == inf) return inf;
	}
	//cout << "\n" << node << " " << " " << ret << "\n";
	return ret;
}

int main(void)
{
	lli p, x;
	scanf("%lld", &n);
	for(lli i = 0;i < n;i++)
	{
		scanf("%lld", &x);
		for(lli j = 0;j < x;j++)
		{
			scanf("%lld", &p);
			p--;
			graph[p].push_back(i);
		}
	}

	lli res = inf;
	for(lli i = 0;i < n;i++) res = min(res, solve(i));
	printf("%lld\n", res);
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:48:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
                   ^
bosses.cpp:51:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &x);
                    ^
bosses.cpp:54:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld", &p);
                     ^

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2180 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 0 ms 2180 KB Output is correct
6 Correct 0 ms 2180 KB Output is correct
7 Correct 0 ms 2180 KB Output is correct
8 Correct 0 ms 2180 KB Output is correct
9 Correct 0 ms 2180 KB Output is correct
10 Correct 0 ms 2180 KB Output is correct
11 Correct 0 ms 2180 KB Output is correct
12 Correct 6 ms 2312 KB Output is correct
13 Correct 0 ms 2312 KB Output is correct
14 Correct 189 ms 2312 KB Output is correct
15 Correct 29 ms 2312 KB Output is correct
16 Correct 733 ms 2444 KB Output is correct
17 Correct 809 ms 2312 KB Output is correct
18 Correct 793 ms 2312 KB Output is correct