제출 #338462

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

beauty

/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
const int N = 35;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int n, m, k, ans;
vii a(N);
 
int cnt1(int x){
	int cnt = 0;
	while(x){
		if(x%3 == 1) cnt++;
		x/=3;
	}return cnt;
}
 
bool check(vii w){
	for(int i=1;i<n;i++){
		bool ok = 0;
		if(cnt(w[i]) == cnt(w[i-1])) ok = 1;
		if(cnt1(w[i]) == cnt1(w[i-1])) ok = 1;
		if(!ok) return 0;
	}
	return 1;
}
 
ll rec(vii way, set<int> used){
	if(sz(way) == n) return (int)check(way);
	ll ans = 0, sz = sz(used), i = 0;
	auto x = used.begin();
	for(;i<sz;i++){
		int tmp = *x;
		x++;
		used.erase(tmp);
		way.pb(a[tmp]);
		ans += rec(way, used);
		used.insert(tmp);
		way.pop_back();
	}
	return ans;
}
 
void solve(){
	fastios 
	cin>>n;
	set<int>used;
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=0;i<n;i++) used.insert(i);
	
	cout<<rec({}, used)<<"\n";
	return;
}
 
int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

• Subtask 1: 0 / 100