oj.uz

Submission #1086105

# Submission time Handle Problem Language Result Execution time Memory
1086105 2024-09-09T14:56:07 Z TrinhKhanhDung Beautiful row (IZhO12_beauty) C++14
100 / 100
 385 ms 205648 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), vector<ll>(n, 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
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 2652 KB Output is correct
12 Correct 3 ms 2652 KB Output is correct
13 Correct 16 ms 11096 KB Output is correct
14 Correct 70 ms 47452 KB Output is correct
15 Correct 68 ms 47528 KB Output is correct
16 Correct 72 ms 47444 KB Output is correct
17 Correct 72 ms 47452 KB Output is correct
18 Correct 72 ms 47448 KB Output is correct
19 Correct 385 ms 205648 KB Output is correct
20 Correct 355 ms 205396 KB Output is correct