Submission #669755

#	Time	Username	Problem	Language	Result	Execution time	Memory
669755		sudheerays123	Beautiful row (IZhO12_beauty)	C++17	0 / 100	8 ms	1224 KiB

beauty

#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 = 12 , INF = 1e18 , MOD = 1e9+7;

ll n;
ll dp[(1ll<<N)][N];
vector<ll> a(N);

ll twocount(ll x){

	ll s = 1;
	while(s <= x) s *= 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) s *= 3;
	s /= 3;

	ll cnt = 0;

	while(x){
		ll p = x/s;
		x -= p*s;
		if(p == 1) cnt++;
		s /= 3;
	}

	return cnt;
}

ll go(ll mask , ll last){

	if(__builtin_popcountll(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(twocount(a[last]) == twocount(a[i]) || threecount(a[last]) == threecount(a[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];

	memset(dp,-1,sizeof dp);

	cout << go(0,0);
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

• Subtask 1: 0 / 100