/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
const int N = 21;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int n, m, k, ans, a[N];
int path[N][N], dp[(1<<N)][N];
bool cnt1(int x){
int cnt=0;
while(x) cnt += (x%3 == 1), x/=3;
return cnt;
}
void solve(){
fastios
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(cnt(a[i]) == cnt(a[j]) || cnt1(a[i]) == cnt1(a[j])) path[i][j] = 1;
else path[i][j] = 0;
}
}
for(int i=0;i<n;i++) dp[(1<<i)][i] = 1;
for(int i=0;i<(1<<n);i++){
for(int j=0;j<n;j++){
if(i & (1<<j)){
for(int t=0;t<n;t++){
if(t != j && path[j][t] && (i&(1<<t)))
dp[i][j] += dp[i^(1<<j)][t];
}
}
}
}
ll ans = 0;
for(int i=0;i<n;i++) ans += dp[(1<<n)-1][i];
cout<<ans<<"\n";
return;
}
int main(){
fastios
int t = 1;
if(t) solve();
else {
cin>>t;
while (t--) solve();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
