제출 #683848

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
683848		vovamr	아름다운 순열 (IZhO12_beauty)	C++17	100 / 100	935 ms	205520 KiB

beauty

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n;
	cin >> n;
	ve<pii> a(n);
	for (int i = 0; i < n; ++i) {
		int x;
		cin >> x;

		a[i].fi = __builtin_popcount(x);

		int cnt = 0;
		while (x > 0) {
			cnt += (x % 3 == 1);
			x /= 3;
		}
		a[i].se = cnt;
	}

	ve<ve<ll>> dp(1 << n, ve<ll> (n));
	for (int i = 0; i < n; ++i) dp[1 << i][i] = 1;

	for (int ma = 0; ma < (1 << n); ++ma) {
		for (int i = 0; i < n; ++i) {
			if (ma >> i & 1 ^ 1) continue;
			for (int j = 0; j < n; ++j) {
				if (ma >> j & 1) continue;
				if (a[i].fi == a[j].fi || a[i].se == a[j].se) {
					dp[ma | (1 << j)][j] += dp[ma][i];
				}
			}
		}
	}

	ll ans = 0;
	for (int i = 0; i < n; ++i) ans += dp[(1 << n) - 1][i];

	cout << ans;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

beauty.cpp: In function 'void solve()':
beauty.cpp:46:16: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   46 |    if (ma >> i & 1 ^ 1) continue;
      |        ~~~~~~~~^~~

• Subtask 1: 100 / 100