oj.uz

답안 #669780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
669780 2022-12-07T09:14:15 Z sudheerays123 아름다운 순열 (IZhO12_beauty) C++17
0 / 100
 242 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 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(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(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.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 82336 KB Output is correct
2 Correct 29 ms 82304 KB Output is correct
3 Correct 29 ms 82324 KB Output is correct
4 Correct 30 ms 82324 KB Output is correct
5 Correct 30 ms 82348 KB Output is correct
6 Correct 33 ms 82292 KB Output is correct
7 Correct 33 ms 82388 KB Output is correct
8 Correct 31 ms 82352 KB Output is correct
9 Correct 32 ms 82368 KB Output is correct
10 Correct 39 ms 82324 KB Output is correct
11 Incorrect 242 ms 82388 KB Output isn't correct
12 Halted 0 ms 0 KB -