oj.uz

Submission #58106

# Submission time Handle Problem Language Result Execution time Memory
58106 2018-07-16T20:50:36 Z Benq Beautiful row (IZhO12_beauty) C++14
100 / 100
 1204 ms 165032 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
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 528 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 3 ms 684 KB Output is correct
8 Correct 3 ms 684 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 700 KB Output is correct
11 Correct 12 ms 3164 KB Output is correct
12 Correct 13 ms 3296 KB Output is correct
13 Correct 44 ms 10856 KB Output is correct
14 Correct 238 ms 41672 KB Output is correct
15 Correct 245 ms 41732 KB Output is correct
16 Correct 216 ms 41732 KB Output is correct
17 Correct 222 ms 41732 KB Output is correct
18 Correct 252 ms 41732 KB Output is correct
19 Correct 1204 ms 165008 KB Output is correct
20 Correct 964 ms 165032 KB Output is correct