oj.uz

답안 #807694

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807694 2023-08-04T21:40:12 Z SorahISA Cheerleaders (info1cup20_cheerleaders) C++17
100 / 100
 1423 ms 2376 KB 
#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA

void solve() {
    int N; cin >> N;
    int64_t NN = (1 << N);
    
    vector<int> A(NN);
    for (int i = 0; i < NN; ++i) cin >> A[i];
    
    auto ch1 = [&](vector<int> &Z) {
        for (int i = 0; i < NN/2; ++i) swap(Z[i], Z[i+NN/2]);
        // cerr << "\u001b[34m";
        // for (int i = 0; i < NN; ++i) cerr << Z[i] << " \n"[i == NN-1];
        // cerr << "\u001b[0m";
    };
    
    auto ch2 = [&](vector<int> &Z) {
        static vector<int> B(NN);
        for (int i = 0; i < NN; i += 2) B[i/2] = Z[i];
        for (int i = 1; i < NN; i += 2) B[i/2+NN/2] = Z[i];
        Z = B;
        // cerr << "\u001b[35m";
        // for (int i = 0; i < NN; ++i) cerr << Z[i] << " \n"[i == NN-1];
        // cerr << "\u001b[0m";
    };
    
    auto calc_inv = [&](vector<int> &id) -> int64_t {
        static vector<int> BIT(NN+1);
        fill(ALL(BIT), 0);
        int64_t cnt = 0;
        for (int i = NN-1; i >= 0; --i) {
            for (int j = A[id[i]]+1; j >   0; j -= j&-j) cnt += BIT[j];
            for (int j = A[id[i]]+1; j <= NN; j += j&-j) ++BIT[j];
        }
        return cnt;
    };
    
    int64_t min_inv = NN * (NN-1) / 2;
    string min_ans;
    
    for (int op2 = 0; op2 < N; ++op2) {
        // debug(op2);
        
        vector<int> id(NN); iota(ALL(id), 0);
        for (int i = 0; i < op2; ++i) ch2(id);
        // for (int i = 0; i < NN; ++i) cerr << id[i] << " \n"[i == NN-1];
        
        int64_t OLD = calc_inv(id);
        for (int bit = 0; bit < N; ++bit) {
            for (int &x : id) x ^= (1 << bit);
            int64_t NEW = calc_inv(id);
            if (OLD < NEW) for (int &x : id) x ^= (1 << bit);
            else OLD = NEW;
        }
        // debug(calc_inv(id));
        // for (int i = 0; i < NN; ++i) cerr << id[i] << " \n"[i == NN-1];
        
        int C = 0;
        for (int i = 0; i < NN; ++i) {
            if (id[i] == 0) C = i;
        }
        // debug(C);
        
        string ans(op2, '2');
        for (int i = 0; i < N; ++i) {
            ans += "2";
            if (C >> i & 1) ans += "1";
        }
        if (chmin(min_inv, calc_inv(id))) min_ans = ans;
    }
    
    cout << min_inv << "\n";
    cout << min_ans << "\n";
}

/*
2
0 3 1 2

3
2 3 7 6 1 4 5 0

4
1 4 8 5 3 6 12 13 10 11 2 9 14 0 15 7

2
1 0 3 2

3
6 2 7 3 4 0 5 1
*/

int32_t main() {
    fastIO();
    
    int t = 1; // cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        solve();
    }
    
    return 0;
}

#else

#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

// #define int int64_t
// #define double __float80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;

// #define X first
// #define Y second
#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    fprintf(stderr, "%sAt [%s], line %d: (%s) = ", "\u001b[33m", __FUNCTION__, __LINE__, #__VA_ARGS__), \
    _do(__VA_ARGS__), fprintf(stderr, "%s", "\u001b[0m")
template <typename T> void _do(T &&_t) {cerr << _t << "\n";}
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) {cerr << _t << ", ", _do(_u...);}
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template <typename T, typename U> bool chmin(T &lhs, U rhs) {return lhs > rhs ? lhs = rhs, 1 : 0;}
template <typename T, typename U> bool chmax(T &lhs, U rhs) {return lhs < rhs ? lhs = rhs, 1 : 0;}

#endif

Compilation message

cheerleaders.cpp: In function 'void solve()':
cheerleaders.cpp:12:10: warning: variable 'ch1' set but not used [-Wunused-but-set-variable]
   12 |     auto ch1 = [&](vector<int> &Z) {
      |          ^~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Correct!
2 Correct 0 ms 212 KB Correct!
3 Correct 0 ms 212 KB Correct!
4 Correct 0 ms 212 KB Correct!

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Correct!
2 Correct 1 ms 212 KB Correct!
3 Correct 1 ms 212 KB Correct!
4 Correct 1 ms 212 KB Correct!

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 340 KB Correct!
2 Correct 7 ms 360 KB Correct!
3 Correct 6 ms 340 KB Correct!
4 Correct 6 ms 340 KB Correct!

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 724 KB Correct!
2 Correct 131 ms 848 KB Correct!
3 Correct 324 ms 1360 KB Correct!

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1263 ms 2376 KB Correct!
2 Correct 1292 ms 2368 KB Correct!
3 Correct 1423 ms 2372 KB Correct!
4 Correct 1413 ms 2372 KB Correct!
5 Correct 1419 ms 2248 KB Correct!