oj.uz

답안 #669788

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
669788 2022-12-07T09:24:46 Z sudheerays123 아름다운 순열 (IZhO12_beauty) C++17
0 / 100
 82 ms 102900 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 n;
ll dp[(1ll<<N)+5][N+5];
vector<ll> a(N+5);

ll twocount(ll x){

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

	ll cnt = 0;

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

	return cnt;
}

ll c2[N+5] , c3[N+5];

ll go(ll mask , ll last){

	if(twocount(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[last] == c2[i] || c3[last] == c3[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];
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 102860 KB Output is correct
2 Correct 39 ms 102888 KB Output is correct
3 Correct 38 ms 102772 KB Output is correct
4 Correct 38 ms 102828 KB Output is correct
5 Correct 38 ms 102856 KB Output is correct
6 Correct 38 ms 102828 KB Output is correct
7 Correct 39 ms 102868 KB Output is correct
8 Correct 40 ms 102892 KB Output is correct
9 Correct 39 ms 102784 KB Output is correct
10 Correct 39 ms 102848 KB Output is correct
11 Incorrect 82 ms 102900 KB Output isn't correct
12 Halted 0 ms 0 KB -