oj.uz

Submission #867654

# Submission time Handle Problem Language Result Execution time Memory
867654 2023-10-29T04:27:47 Z sleepntsheep Beautiful row (IZhO12_beauty) C++17
100 / 100
 317 ms 164436 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
using ll = long long;
#define N 20
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,sse3,sse4,popcnt,fma")

int n, a[N], b3[N], d[N][N];
ll ans, dp[1<<N][N];

inline int beautiful(int i, int j) { return (__builtin_popcount(a[i]) == __builtin_popcount(a[j])) || b3[i] == b3[j]; }

int main()
{
    ShinLena;
    cin >> n;
    for (int i = 0; i < n; ++i)
    {
        cin >> a[i];
        for (int x = a[i]; x; b3[i] += (x % 3) == 1, x /= 3);
        dp[0][i] = 1;
    }
    for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) d[i][j] = beautiful(i, j);
    for (int k = 0; k < (1 << n); ++k)
    {
        for (int j = 0; j < n; ++j)
        {
            if (!(k&(1<<j))) continue;
            for (int l = 0; l < n; ++l)
                dp[k][j] += ((k >> l) & 1) * d[j][l] * dp[k&~(1<<j)][l];
        }
    }

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

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 4 ms 2904 KB Output is correct
12 Correct 3 ms 2904 KB Output is correct
13 Correct 20 ms 10836 KB Output is correct
14 Correct 72 ms 41300 KB Output is correct
15 Correct 71 ms 41468 KB Output is correct
16 Correct 76 ms 41492 KB Output is correct
17 Correct 69 ms 41300 KB Output is correct
18 Correct 69 ms 41300 KB Output is correct
19 Correct 317 ms 164436 KB Output is correct
20 Correct 309 ms 164436 KB Output is correct