#include <bits/stdc++.h>
using namespace std;
#define F first
#define pb push_back
#define S second
#define pii pair<int,int>
#define int long long
int n;
vector<int> v;
vector<int> adj[30];
int dp[21][1LL<<21];
pair<int,int> f(int x){
int a1 = 0 , a2 = 0;
int z =x;
while(z > 0){
if(z%2 == 1) a1++;
z/= 2;
}
z = x;
while(z > 0){
if(z%3 == 1) a2++;
z/=3;
}
return pair<int,int>(a1, a2);
}
int solve(int i , int mask){
if(dp[i][mask] != -1) return dp[i][mask];
int maxxi = 1<<n;
maxxi--;
if(mask == maxxi) return 1;
dp[i][mask] = 0;
for(int j = 0 ; j < adj[i].size() ; j++){
int v = adj[i][j];
if(mask & 1<<v) continue;
dp[i][mask] += solve(v , 1<<v | mask);
}
return dp[i][mask];
}
int32_t main(){
cin>>n;
v.resize(n);
for(int i = 0 ; i < n ;i++) cin>>v[i];
for(int i = 0 ; i <n; i++){
for(int j = i + 1 ; j < n;j++){
if(f(v[i]).F == f(v[j]).F || f(v[i]).S ==f(v[j]).S){
adj[i].pb(j);
adj[j].pb(i);
}
}
}
int ans = 0;
for(int i = 0 ; i < n ; i++){
memset(dp , -1 , sizeof dp);
ans+= solve(i , 1<<i);
}
cout<<ans<<endl;
}
Compilation message
beauty.cpp: In function 'long long int solve(long long int, long long int)':
beauty.cpp:34:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0 ; j < adj[i].size() ; j++){
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
128 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
