Submission #924413

#	Time	Username	Problem	Language	Result	Execution time	Memory
924413		Faisal_Saqib	Political Development (BOI17_politicaldevelopment)	C++17	62 / 100	3048 ms	306784 KiB

politicaldevelopment

#include <iostream>
#include <bitset> 
// any
using namespace std;
const int N=5e4;
bitset<N> ma[N];
int n,k,mx=0;
void recur(int& sz,bitset<N>&x)
{
	mx=max(mx,sz);	
	if(x.none())
		return;
	sz++;
	for(int l=x._Find_first();l<x.size();l=x._Find_next(l))
	{
		bitset<N> np=(x&ma[l]);
		recur(sz,np);
	}
	sz--;
}
int main()
{
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);
	cin>>n>>k;
	for(int i=0;i<n;i++)
	{
		int d=0;
		cin>>d;
		while(d--)
		{
			int x;
			cin>>x;
			ma[i].set(x);
		}
	}
	bitset<N> tp;
	for(int i=0;i<n;i++)
		tp[i]=1;
	int s=0;		
	recur(s,tp);
	cout<<mx<<'\n';
	return 0;
}

Compilation message (stderr)

politicaldevelopment.cpp: In function 'void recur(int&, std::bitset<50000>&)':
politicaldevelopment.cpp:14:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for(int l=x._Find_first();l<x.size();l=x._Find_next(l))
      |                            ~^~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 12 / 12
• Subtask 3: 23 / 23
• Subtask 4: 0 / 38
• Subtask 5: 23 / 23