oj.uz

답안 #867650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867650 2023-10-29T04:24:56 Z sleepntsheep 아름다운 순열 (IZhO12_beauty) C++17
100 / 100
 1101 ms 164548 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

int n, a[N], b3[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 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)
            {
                if (k & (1 << l))
                {
                    if (beautiful(j, l)) dp[k][j] += 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

# 결과 실행 시간 메모리 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 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 10 ms 4696 KB Output is correct
12 Correct 10 ms 4700 KB Output is correct
13 Correct 45 ms 10872 KB Output is correct
14 Correct 223 ms 42064 KB Output is correct
15 Correct 207 ms 41596 KB Output is correct
16 Correct 231 ms 41560 KB Output is correct
17 Correct 261 ms 41628 KB Output is correct
18 Correct 243 ms 41552 KB Output is correct
19 Correct 1101 ms 164548 KB Output is correct
20 Correct 935 ms 164468 KB Output is correct