oj.uz

Submission #1014576

# Submission time Handle Problem Language Result Execution time Memory
1014576 2024-07-05T07:40:22 Z qnicondavid23 Bosses (BOI16_bosses) C++14
67 / 100
 1500 ms 856 KB 
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
int n;
int x,a;
vector<vector<int>> A;
vector<bool> fr;
vector<vector<int>> G;
void bfs(int nod)
{
	queue<int> Q;
	Q.push(nod);
	fr[nod]=1;
	while(!Q.empty())
	{
       int cap=Q.front();
	   Q.pop();
	   for(int i=0;i<A[cap].size();i++)
	   {
		   int vecin=A[cap][i];
		   if(!fr[vecin])
		   {
			   G[cap].push_back(vecin);
			   fr[vecin]=1;
			   Q.push(vecin);
		   }
	   }
	} 
}
int sum=0;
int dfs(int nod)
{
	int s=0;
    for(int i=0;i<G[nod].size();i++)
	{
		int vecin=G[nod][i];
		s=s+dfs(vecin);
	}
	sum=sum+s+1;
	return s+1;
}
int main() {
	cin>>n;
	A.resize(n+1);
	for(int i=1;i<=n;i++)
	{
         cin>>x;
		 for(int j=0;j<x;j++)
		 {
			 cin>>a;
			 A[a].push_back(i);
		 }
	}
	int mini=0x3f3f3f3f;
	for(int i=1;i<=n;i++)
	{
         fr.resize(0);
		 fr.resize(n+1);
		 G.resize(0);
		 G.resize(n+1);
		 sum=0;
		 bfs(i);
		 bool ok=1;
		 for(int j=1;j<=n;j++)
		    if(!fr[j])
			  {
				  ok=0;
				  break;
			  }
		if(!ok)
		  continue;
		 dfs(i);
		 mini=min(mini,sum);
	}
	cout<<mini;
return 0;
}

Compilation message

bosses.cpp: In function 'void bfs(int)':
bosses.cpp:19:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i=0;i<A[cap].size();i++)
      |                 ~^~~~~~~~~~~~~~
bosses.cpp: In function 'int dfs(int)':
bosses.cpp:35:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i=0;i<G[nod].size();i++)
      |                 ~^~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 313 ms 836 KB Output is correct
15 Correct 49 ms 804 KB Output is correct
16 Correct 953 ms 856 KB Output is correct
17 Execution timed out 1531 ms 856 KB Time limit exceeded
18 Halted 0 ms 0 KB -