#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 21 , INF = 1e9 , MOD = 1e9+7;
ll n;
ll dp[(1ll<<N)+5][N+5];
vector<ll> a(N+5);
ll twocount(ll x){
ll s = 1;
while(s <= (x/2)) s *= 2;
ll cnt = 0;
while(x){
ll p = x/s;
x -= p*s;
if(p == 1) cnt++;
s /= 2;
}
return cnt;
}
ll threecount(ll x){
ll s = 1;
while(s <= (x/3)) s *= 3;
ll cnt = 0;
while(x){
ll p = x/s;
x -= p*s;
if(p == 1) cnt++;
s /= 3;
}
return cnt;
}
ll c2[N+5] , c3[N+5];
ll go(ll mask , ll last){
if(twocount(mask) == n) return 1;
if(dp[mask][last] != -1) return dp[mask][last];
ll ans = 0;
for(ll i = 1; i <= n; i++){
if(mask&(1ll<<i)) continue;
if(last == 0) ans += go(mask|(1ll<<i),i);
else if(c2[last] == c2[i] || c3[last] == c3[i]) ans += go(mask|(1ll<<i),i);
}
return dp[mask][last] = ans;
}
void solve(){
cin >> n;
for(ll i = 1; i <= n; i++){
cin >> a[i];
c2[i] = twocount(a[i]);
c3[i] = threecount(a[i]);
}
memset(dp,-1,sizeof dp);
cout << go(0,0);
}
int main(){
fast;
ll tc = 1;
// cin >> tc;
while(tc--) solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
101 ms |
262144 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
