oj.uz

Submission #1112209

# Submission time Handle Problem Language Result Execution time Memory
1112209 2024-11-13T19:45:05 Z Kirill22 Beautiful row (IZhO12_beauty) C++17
100 / 100
 796 ms 172880 KB 
#include "bits/stdc++.h"

using namespace std;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<vector<int>> g(n, vector<int> (n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (__builtin_popcount(a[i]) == __builtin_popcount(a[j])) {
                g[i][j] = 1;
            }
            int x = a[i], y = a[j], s = 0;
            while (x > 0) {
                s += x % 3 == 1;
                x /= 3;
            }
            while (y > 0) {
                s -= y % 3 == 1;
                y /= 3;
            }
            if (s == 0) {
                g[i][j] = 1;
            }
        }
    }
    vector<vector<long long>> dp(n, vector<long long> (1 << n));
    for (int i = 0; i < n; i++) {
        dp[i][1 << i] = 1;
    }
    for (int msk = 0; msk < (1 << n); msk++) {
        for (int v = 0; v < n; v++) {
            for (int u = 0; u < n; u++) {
                if (msk >> v & 1) {
                    if (!(msk >> u & 1)) {
                        if (g[v][u]) {
                            dp[u][msk + (1 << u)] += dp[v][msk];
                        }
                    }
                }
            }
        }
    }
    long long ans = 0;
    for (int v = 0; v < n; v++) {
        ans += dp[v].back();
    }
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 9 ms 2384 KB Output is correct
12 Correct 9 ms 2384 KB Output is correct
13 Correct 41 ms 9040 KB Output is correct
14 Correct 178 ms 39504 KB Output is correct
15 Correct 173 ms 39504 KB Output is correct
16 Correct 177 ms 39504 KB Output is correct
17 Correct 192 ms 39504 KB Output is correct
18 Correct 194 ms 39504 KB Output is correct
19 Correct 796 ms 172868 KB Output is correct
20 Correct 688 ms 172880 KB Output is correct