# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
924421 | Faisal_Saqib | Political Development (BOI17_politicaldevelopment) | C++17 | 3044 ms | 307024 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <bitset>
// any
using namespace std;
const int N=5e4;
bitset<N> ma[N];
int n,k,mx=0;
bitset<N> x;
void recur(int& sz)
{
mx=max(mx,sz);
if(x.none())
return;
sz++;
bitset<N> np=x;
for(int l=np._Find_first();l<N;l=np._Find_next(l))
{
x=np&ma[l];
recur(sz);
}
sz--;
}
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
scanf("%d %d",&n,&k);
for(int i=0;i<n;i++)
{
int d=0;
scanf("%d",&d);
while(d--)
{
int x;
scanf("%d",&x);
ma[i].set(x);
}
}
for(int i=0;i<n;i++)
x[i]=1;
int s=0;
recur(s);
printf("%d",mx);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |