oj.uz

Submission #669831

# Submission time Handle Problem Language Result Execution time Memory
669831 2022-12-07T12:09:48 Z sudheerays123 Beautiful row (IZhO12_beauty) C++17
0 / 100
 40 ms 82388 KB 
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll int
const ll N = 20 , INF = 1e9 , MOD = 1e9+7;

ll twocount(ll x){

	ll cnt = 0;

	while(x){
		if(x%2 == 1) cnt++;
		x /= 2;
	}

	return cnt;
}

ll threecount(ll x){

	ll cnt = 0;

	while(x){
		if(x%3 == 1) cnt++;
		x /= 3;
	}

	return cnt;
}

ll c2[N],c3[N];
ll n;
ll dp[(1ll<<N)][N];

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(c2[i] == c2[last] || c3[i] == c3[last]) ans += go(mask|(1ll<<i),i);
	}

	return dp[mask][last] = ans;
}

void solve(){

	cin >> n;

	vector<ll> a(n+5);

	for(ll i = 1; i <= n; i++){
		cin >> a[i];
		c2[i] = twocount(a[i]);
		c3[i] = threecount(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.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 82252 KB Output is correct
2 Correct 32 ms 82380 KB Output is correct
3 Correct 32 ms 82372 KB Output is correct
4 Correct 32 ms 82288 KB Output is correct
5 Correct 31 ms 82344 KB Output is correct
6 Correct 31 ms 82388 KB Output is correct
7 Correct 31 ms 82256 KB Output is correct
8 Correct 31 ms 82384 KB Output is correct
9 Correct 31 ms 82388 KB Output is correct
10 Correct 32 ms 82388 KB Output is correct
11 Incorrect 40 ms 82320 KB Output isn't correct
12 Halted 0 ms 0 KB -