#include<bits/stdc++.h>
using namespace std;
vector<int> binary[33], trinary[33];
vector<int> a;
int n;
int count(int x){
int res = 0;
while(x > 0){
if(x % 3 == 1){
res++;
}
x /= 3;
}
return res;
}
long long dp[(1 << 21)][21];
long long solve(int mask, int last){
if(mask == ((1 << n) - 1)){
return 1;
}
long long ans = 0;
if(mask == 0){
for(int j = 0; j < n; j++){
int curmask = mask | (1 << j);
ans += solve(curmask, j);
}
}
else{
if(dp[mask][last] != -1)return dp[mask][last];
int binaryones = __builtin_popcount(a[last]), trinaryones = count(a[last]);
for(int j = 0; j < binary[binaryones].size(); j++){
int k = binary[binaryones][j];
if(mask & (1 << k))continue;
int curmask = mask | (1 << k);
ans += solve(curmask, k);
}
for(int j = 0; j < trinary[trinaryones].size(); j++){
int k = trinary[trinaryones][j];
if(mask & (1 << k))continue;
int curmask = mask | (1 << k);
if(!(binaryones == __builtin_popcount(a[k])))ans += solve(curmask, k);
}
}
return dp[mask][last] = ans;
}
signed main(){
cin >> n;
a.resize(n);
for(int i = 0; i < n; i++){
cin >> a[i];
int cnt3 = count(a[i]), cnt2 = __builtin_popcount(a[i]);
binary[cnt2].push_back(i);
trinary[cnt3].push_back(i);
}
memset(dp, -1, sizeof dp);
cout << solve(0, -1) << '\n';
}
Compilation message
beauty.cpp: In function 'long long int solve(int, int)':
beauty.cpp:34:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0; j < binary[binaryones].size(); j++){
~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
beauty.cpp:40:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0; j < trinary[trinaryones].size(); j++){
~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
beauty.cpp: In function 'int main()':
beauty.cpp:47:22: warning: array subscript is below array bounds [-Warray-bounds]
return dp[mask][last] = ans;
~~~~~~~~~~~~~^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
231 ms |
262148 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
