# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173198 | juggernaut | Beautiful row (IZhO12_beauty) | C++14 | 0 ms | 0 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.
//Just try and the idea will come!
#include<bits/stdc++.h>
#define int long long int
using namespace std;
int n,i,a[20],dp[1048576][20],ans,j,tri[20],bin[20],mask;
int main(){
scanf("%lld",&n);
for(;i<n;i++){
scanf("%lld",&a[i]);
dp[1<<i][i]=1;
bin[i]=__builtin_popcount(a[i]);
mask=a[i];
while(mask){
if(mask%3==1)tri[i]++;
mask/=3;
}
}
for(mask=0;mask<(1<<n);mask++)
for(i=0;i<n;i++)
if(mask&(1<<i))
for(j=0;j<n;j++)
if(i!=j)
if(mask&(1<<j)&&(tri[i]==tri[j]||bin[i]==bin[j]))dp[mask][i]+=dp[mask^(1<<i)][j];
for(i=0;i<n;i++)ans+=dp[(1<<n)-1][i];
printf("%lld",ans);
}