# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
82470 | Just_Solve_The_Problem | Beautiful row (IZhO12_beauty) | C++11 | 2 ms | 500 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
using namespace std;
#define int long long
#define ll long long
int a[22];
int n;
int ok[22][22];
int get(int x) {
int res = 0;
while (x) {
res += (x % 3 == 1);
x /= 3;
}
return res;
}
int get1(int x) {
int res = 0;
while (x) {
res += (x % 2 == 1);
x /= 2;
}
return res;
}
int dp[1 << 20];
main() {
int n;
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%lld", &x);
a[i] = x;
dp[1 << i]++;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
ok[i][j] = (get(a[i]) == get(a[j]) || get1(a[i]) == get1(a[j]));
}
}
for (int mask = 1; mask < (1 << n); mask++) {
for (int j = 0; j < n; j++) {
if ((mask >> j) & 1 ^ 1) continue;
for (int k = 0; k < n; k++) {
if (((mask >> k) & 1 ^ 1) && ok[j][k]) {
dp[mask | (1 << k)] += dp[mask];
}
}
}
}
int ans = 0;
ans += dp[(1 << n) - 1];
printf("%lld", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |