Submission #380973

#	Time	Username	Problem	Language	Result	Execution time	Memory
380973		SavicS	Beautiful row (IZhO12_beauty)	C++14	100 / 100	840 ms	127760 KiB

beauty

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 20;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
ll niz[maxn];

int A[maxn];
int B[maxn];

ll dp[20][(1 << 20)];

int main() {
	ios::sync_with_stdio(false);
	cout.tie(nullptr);
	cin.tie(nullptr);
	cin >> n;
	ff(i,0,n - 1)cin >> niz[i];
	ff(i,0,n - 1) {
		A[i] = __builtin_popcount(niz[i]);
		ll x = niz[i];
		while(x > 0) {
			int ost = x % 3;
			B[i] += (ost == 1);
			x /= 3;
		}
	}

	ff(i,0,n - 1)dp[i][(1 << i)] = 1;

	ff(mask,0,(1 << n) - 1) {
		ff(i,0,n - 1) {
			if(!(mask & (1 << i))) {
				ff(j,0,n - 1) {
					if((mask & (1 << j)) && (A[i] == A[j] || B[i] == B[j])) {
						dp[i][mask | (1 << i)] += dp[j][mask];
					}
				}
			}
		}
	}

	ll rez = 0;
	ff(i,0,n - 1)rez += dp[i][(1 << n) - 1];

	cout << rez << endl;

	return 0;
}
/**

3
5 1 6

// probati bojenje sahovski ili slicno

**/

• Subtask 1: 100 / 100