oj.uz

답안 #1086103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086103 2024-09-09T14:53:19 Z TrinhKhanhDung 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 113 ms 262144 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(998244353)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

void solve(){
    int n; cin >> n;
    vector<int> a(n + 3, 0);
    for(int i=0; i<n; i++){
        cin >> a[i];
    }
    vector<int> two(n + 3), three(n + 3, 0);
    for(int i=0; i<n; i++){
        two[i] = __builtin_popcount(a[i]);
        int x = a[i];
        while(x > 0){
            if(x % 3 == 1) three[i]++;
            x /= 3;
        }
    }

    vector<vector<ll>> f(MASK(n) + 10, vector<ll>(n + 10, 0));
    for(int i=0; i<n; i++){
        f[MASK(i)][i] = 1;
    }

    for(int mask=1; mask<MASK(n); mask++){
        for(int tmp=mask; tmp>0; tmp-=tmp&-tmp){
            int i = __builtin_ctz(tmp);
            if(f[mask][i] > 0){
//                cout << mask << ' ' << i << ' ' << f[mask][i] << '\n';
                for(int pr=MASK(n)-1-mask; pr>0; pr-=pr&-pr){
                    int j = __builtin_ctz(pr);
                    if(two[i] == two[j] || three[i] == three[j]){
                        f[mask | MASK(j)][j] += f[mask][i];
                    }
                }
            }
        }
    }

    ll ans = 0;
    for(int i=0; i<n; i++){
        ans += f[MASK(n) - 1][i];
    }

    cout << ans << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen("numtable.inp","r",stdin);
//    freopen("numtable.out","w",stdout);

    solve();

    return 0;
}

Subtask #1
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 0 ms 348 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 3 ms 4192 KB Output is correct
12 Correct 3 ms 4060 KB Output is correct
13 Correct 20 ms 16376 KB Output is correct
14 Correct 90 ms 68172 KB Output is correct
15 Correct 95 ms 68172 KB Output is correct
16 Correct 87 ms 67924 KB Output is correct
17 Correct 95 ms 68168 KB Output is correct
18 Correct 90 ms 67924 KB Output is correct
19 Runtime error 113 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -