제출 #758334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
758334		Ahmed_Solyman	아름다운 순열 (IZhO12_beauty)	C++14	0 / 100	85 ms	164460 KiB

beauty

#include <bits/stdc++.h>
#include <ext/rope>

using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
int ones2(int n){
    return __builtin_popcount(n);
}
int ones3(int n){
    int cnt=0;
    while(n){
        cnt+=(n%3==1);
        n/=3;
    }
    return cnt;
}
const int N=20;
ll dp[N][(1<<N)],arr[N],n;
int solve(int i,int mask){
    if(ones2(mask)==n){
        return 1;
    }
    ll &ret=dp[i][mask];
    if(~ret)return ret;
    ret=0;
    for(int j=0;j<n;j++){
        if((1<<j)&mask)continue;
        if(mask){
            if(ones2(arr[j])==ones2(arr[i]) || ones3(arr[j])==ones3(arr[i])){
                ret+=solve(j,mask|(1<<j));
            }
        }
        else{
            ret+=solve(j,mask|(1<<j));
        }
    }
    return ret;
}
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    fast
    cin>>n;
    for(int i=0;i<n;i++)cin>>arr[i];
    fil(dp,-1);
    cout<<solve(0,0)<<endl;
    return 0;
}

• Subtask 1: 0 / 100