# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729172 | MilosMilutinovic | Political Development (BOI17_politicaldevelopment) | C++14 | 1948 ms | 1856 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 <bits/stdc++.h>
using namespace std;
int n,k,id[50005];
vector<int> g[50005];
signed main()
{
scanf("%d%d",&n,&k);
for(int d,i=0;i<n;i++)
{
scanf("%d",&d);
for(int x,j=0;j<d;j++)
{
scanf("%d",&x);
g[i].push_back(x);
g[x].push_back(i);
}
}
for(int i=0;i<n;i++) id[i]=-1;
int ans=1;
for(int i=0;i<n;i++)
{
int deg=(int)g[i].size();
for(int j=0;j<deg;j++) id[g[i][j]]=j;
vector<int> a;
for(int x:g[i])
{
int f=(1<<id[x]);
for(int y:g[x]) if(id[y]!=-1) f+=(1<<id[y]);
a.push_back(f);
}
for(int mask=0;mask<(1<<deg);mask++)
{
bool ok=true;
for(int j=0;j<deg;j++) if(mask>>j&1) if((mask&a[j])!=mask) ok=false;
if(ok) ans=max(ans,__builtin_popcount(mask)+1);
}
for(int j=0;j<deg;j++) id[g[i][j]]=-1;
}
printf("%d\n",ans);
}
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... |