Submission #483243

#	Time	Username	Problem	Language	Result	Execution time	Memory
483243		dxz05	Beautiful row (IZhO12_beauty)	C++14	100 / 100	699 ms	205528 KiB

beauty

#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 222;

int a[N], b[N];
void solve(int TC) {
    int n;
    cin >> n;

    for (int i = 0; i < n; i++){
        int x;
        cin >> x;
        a[i] = __builtin_popcount(x);
        while (x > 0){
            b[i] += x % 3 == 1;
            x /= 3;
        }
    }

    vector<vector<ll>> dp(1 << n, vector<ll>(n, 0ll));

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

    for (int mask = 1; mask < (1 << n); mask++){
        for (int i = 0; i < n; i++){
            if (!(mask & (1 << i)) || dp[mask][i] == 0) continue;
            for (int j = 0; j < n; j++){
                if ((mask & (1 << j)) || a[i] != a[j] && b[i] != b[j]) continue;

                debug(mask, i, j);

                dp[mask | (1 << j)][j] += dp[mask][i];
            }
        }

    }

//    for (auto x : dp){
//        for (auto y : x) cout << y << ' ';
//        cout << endl;
//    }

    cout << accumulate(all(dp.back()), 0ll);

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Compilation message (stderr)

beauty.cpp: In function 'void solve(int)':
beauty.cpp:68:55: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   68 |                 if ((mask & (1 << j)) || a[i] != a[j] && b[i] != b[j]) continue;
      |                                          ~~~~~~~~~~~~~^~~~~~~~~~~~~~~
beauty.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
beauty.cpp:70:17: note: in expansion of macro 'debug'
   70 |                 debug(mask, i, j);
      |                 ^~~~~

• Subtask 1: 100 / 100