oj.uz

답안 #58105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58105 2018-07-16T20:49:40 Z Benq 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 4 ms 928 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N, num2[20], num3[20];
bool ok[20][20];
ll dp[1<<20][20];

int getOnes(int x, int y) {
    int ans = 0;
    while (x) {
        if (x % y == 1) ans ++;
        x /= y;
    }
    return ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N; vi A(N);
    map<int,int> oc;
    F0R(i,N) {
        cin >> A[i];
        oc[A[i]] ++;
    }
    F0R(i,N) {
        num2[i] = getOnes(A[i],2);
        num3[i] = getOnes(A[i],3);
    }
    F0R(i,N) F0R(j,N) if (num2[i] == num2[j] || num3[i] == num3[j]) ok[i][j] = 1;
    
    F0R(i,N) dp[1<<i][i] = 1;
    F0R(i,1<<N) F0R(j,N) if (i&(1<<j)) {
        F0R(k,N) if (!(i&(1<<k))) if (ok[j][k]) {
            dp[i^(1<<k)][k] += dp[i][j];
        }
    }
    
    ll ans = 0; F0R(j,N) ans += dp[(1<<N)-1][j];
    for (auto a: oc) FOR(i,1,a.s+1) ans /= i;
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 3 ms 636 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 2 ms 748 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 3 ms 900 KB Output is correct
7 Correct 3 ms 904 KB Output is correct
8 Correct 2 ms 924 KB Output is correct
9 Incorrect 3 ms 928 KB Output isn't correct
10 Halted 0 ms 0 KB -