#include <bits/stdc++.h>
using namespace std;
#define file ""
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
return l + rd() % (r - l + 1);
}
const int N = 20;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;
template<class X, class Y> bool mini(X &a, Y b) {
return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
a += b;
if (a >= mod) a -= mod;
if (a < 0) a += mod;
}
int n;
int a[N], b[N];
long long f[N][1 << N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
a[i] = popcount(x);
while (x) {
b[i] = x % 3;
x /= 3;
}
}
f[0][0] = 0;
for (int i = 0; i < n; ++i) f[i][bit(i)] = 1;
for (int mask = 0; mask < bit(n); ++mask) {
for (int i = 0; i < n; ++i) if (getbit(mask, i)) {
for (int j = 0; j < n; ++j) if (getbit(mask, j)) {
if (a[i] == a[j] || b[i] == b[j])
f[i][mask] += f[j][mask ^ bit(i)];
}
}
}
long long res = 0;
for (int i = 0; i < n; ++i) res += f[i][bit(n) - 1];
cout << res;
return 0;
}
/*
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2648 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
4440 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
