oj.uz

답안 #363954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363954 2021-02-07T15:38:26 Z AnaM Bosses (BOI16_bosses) C++14
100 / 100
 839 ms 748 KB 
#include<bits/stdc++.h>
using namespace std;
int n,x,sef,mini=-1,trenutniz,di[5005];
vector<int> grane[5005];
queue<int> q;

void bfs(int trenutni)
{
	int vi[5005]={0};
	for(int h=1;h<=n;h++)
	 	di[h]=0;
	vi[trenutni]=1;
	q.push(trenutni);
	while(!(q.empty()))
	{
		trenutni=q.front();
		q.pop();
		for (int h=0;h<grane[trenutni].size();h++)
		{
			x=grane[trenutni][h];
			if (vi[x]==1) continue;
			di[x]=di[trenutni]+1;
			vi[x]=1;
			q.push(x);
		}
	}
}
int main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&x);
		for (int h=1;h<=x;h++)
		{
			scanf("%d",&sef);
			grane[sef].push_back(i);
		}
	}
	for(int i=1;i<=n;i++)
	{
		bfs(i);
		trenutniz=n;
		for (int h=1;h<=n;h++)
		{
			trenutniz+=di[h];
			if ((di[h]==0)&&(h!=i)) {trenutniz=-1; break;}
		}
		if (trenutniz==-1) continue;
		if (mini==-1) {mini=trenutniz; continue;}
		if (trenutniz<mini) mini=trenutniz;
	}
	printf("%d",mini);
}

Compilation message

bosses.cpp: In function 'void bfs(int)':
bosses.cpp:18:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |   for (int h=0;h<grane[trenutni].size();h++)
      |                ~^~~~~~~~~~~~~~~~~~~~~~~
bosses.cpp: In function 'int main()':
bosses.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
bosses.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |   scanf("%d",&x);
      |   ~~~~~^~~~~~~~~
bosses.cpp:36:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |    scanf("%d",&sef);
      |    ~~~~~^~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 8 ms 492 KB Output is correct
13 Correct 6 ms 620 KB Output is correct
14 Correct 178 ms 640 KB Output is correct
15 Correct 19 ms 620 KB Output is correct
16 Correct 742 ms 724 KB Output is correct
17 Correct 839 ms 748 KB Output is correct
18 Correct 817 ms 744 KB Output is correct