oj.uz

답안 #335905

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335905 2020-12-14T08:21:50 Z IZhO_2021_I_want_Silver 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 9 ms 1644 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
#define fo(a, b, c, d) for(int (a) = (b); (a) <= (c); (a) += (d))
#define foo(a, b, c ,d) for(int (a) = (b); (a) >= (c); (a) -= (d))
//#define int ll

const int N = (1 << 20);

int n, dp[N][21], cnt2[21], cnt3[21];

void solve() {
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        cnt2[i] = __builtin_popcount(x);
        while (x) {
            if (x % 3 == 1) { ++cnt3[i]; }
            x /= 3;
        }
    }

    for (int i = 0; i < n; ++i) { dp[(1 << i)][i] = 1; }

    for (int mask = 1; mask < (1 << n); ++mask) {
        for (int last = 0; last < n; ++last) {
            if (!((mask >> last) & 1)) { continue; }
            for (int i = 0; i < n; ++i) {
                if ((mask >> i) & 1) { continue; }
                if (cnt2[last] == cnt2[i] || cnt3[last] == cnt3[i]) {
                    dp[(mask ^ (1 << i))][i] += dp[mask][last];
                }
            }
        }
    }

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

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message

beauty.cpp:77:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   77 |  main () {
      |        ^

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Incorrect 9 ms 1644 KB Output isn't correct
12 Halted 0 ms 0 KB -