# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
141000 | Shelby | Beautiful row (IZhO12_beauty) | C++11 | 7 ms | 504 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 dp[20][1<<20],t[20],b[20],a[20];
bool v[20][20];
int main()
{ int n,i,j,x,tmp,mask;
long long sol=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=__builtin_popcount(a[i]);
x=a[i];
while(x>0)
{
tmp=x%3;
if(tmp==1) t[i]++;
x=x/3;
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if((b[i]==b[j] || t[i]==t[j]) && i!=j) v[i][j]=true;
}
}
for(i=0;i<n;i++) dp[(1<<i)][i]=1;
for(mask=1;mask<(1<<n);mask++)
{
for(i=0;i<n;i++)
{
if(mask&(1<<i))
{
for(j=0;j<n;j++)
{
if( (mask&(1<<j))==0 && v[i][j]==true )
{
dp[mask|(1<<j)][j]+=dp[mask][i];
}
}
}
}
}
for(i=0;i<n;i++) sol+=(long long)dp[(1<<n)-1][i];
printf("%lld\n",sol);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |