oj.uz

답안 #52403

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
52403 2018-06-25T20:20:25 Z TadijaSebez Bosses (BOI16_bosses) C++11
100 / 100
 811 ms 1408 KB 
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
const int N=5050;
const int inf=1e9+7;
vector<int> E[N];
int dep[N],ans=inf;
int min(int a, int b){ return a>b?b:a;}
queue<int> q;
void BFS(int u, int n)
{
	int i;
	for(i=1;i<=n;i++) dep[i]=inf;
	q.push(u);
	dep[u]=1;
	int sol=0;
	while(q.size())
	{
		int x=q.front();
		q.pop();
		sol+=dep[x];
		for(i=0;i<E[x].size();i++)
		{
			int y=E[x][i];
			if(dep[y]>dep[x]+1)
			{
				dep[y]=dep[x]+1;
				q.push(y);
			}
		}
	}
	for(i=1;i<=n;i++) if(dep[i]==inf) return;
	ans=min(ans,sol);
}
int main()
{
	int n,i,sz,x;
	scanf("%i",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%i",&sz);
		while(sz--) scanf("%i",&x),E[x].push_back(i);
	}
	for(i=1;i<=n;i++) BFS(i,n);
	printf("%i\n",ans);
	return 0;
}

Compilation message

bosses.cpp: In function 'void BFS(int, int)':
bosses.cpp:23:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0;i<E[x].size();i++)
           ~^~~~~~~~~~~~
bosses.cpp: In function 'int main()':
bosses.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
bosses.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%i",&sz);
   ~~~~~^~~~~~~~~~
bosses.cpp:43:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   while(sz--) scanf("%i",&x),E[x].push_back(i);
               ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 2 ms 676 KB Output is correct
5 Correct 3 ms 676 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 3 ms 676 KB Output is correct
9 Correct 2 ms 720 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 2 ms 820 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 2 ms 676 KB Output is correct
5 Correct 3 ms 676 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 3 ms 676 KB Output is correct
9 Correct 2 ms 720 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 2 ms 820 KB Output is correct
12 Correct 7 ms 836 KB Output is correct
13 Correct 6 ms 872 KB Output is correct
14 Correct 145 ms 1036 KB Output is correct
15 Correct 16 ms 1036 KB Output is correct
16 Correct 678 ms 1272 KB Output is correct
17 Correct 762 ms 1288 KB Output is correct
18 Correct 811 ms 1408 KB Output is correct