oj.uz

답안 #1014164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014164 2024-07-04T13:13:40 Z c2zi6 자동 인형 (IOI18_doll) C++14
46 / 100
 60 ms 12892 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "doll.h"

namespace TEST5 {
    void solve(int M, VI A) {
        int N = A.size();
        VI C;
        VI X;
        VI Y;
        if (A.size() == 1) {
            C.pb(1);
            C.pb(0);
            answer(C, X, Y);
            return;
        }
        C.pb(1);
        C.pb(-1);
        int s = 0;
        while ((1<<s) < N) s++;
        replr(i, 2, s+1) {
            X.pb(-1);
            Y.pb(-i);
        }
        Y.back() = 0;
        int n = N-1;
        rep(i, s) {
            if (n & (1<<i)) {
                X[s-1-i] = 1;
            }
        }
        answer(C, X, Y);
    }
};
namespace TEST6 {
    typedef VI::iterator VIT;
    void solve(int M, VI A) { int N = A.size();
        VI C, X, Y;
        X.reserve(2*A.size());
        Y.reserve(2*A.size());
        C = VI(M+1);
        
        VI cnt(M+1);
        for (int x : A) cnt[x]++;
        VI lwb(N+1);
        replr(i, 0, N) {
            int x = 0;
            while ((1<<x) < i) x++;
            lwb[i] = x;
        }

        VI sw(M+1, -1);
        vector<vector<VIT>> order(M+1);
        auto trans = [&](int x) {
            return -(x+1);
        };
        auto flip = [&](int x, int s) {
            rep(i, s/2) {
                int ch = bool(x&(1<<i))^bool(x&(1<<(s-1-i)));
                x ^= (ch<<i);
                x ^= (ch<<(s-1-i));
            }
            return x;
        };
        auto print = [&](VIT it) {
            if (X.begin() <= it && it < X.end()) {
                cout << "X[" << it-X.begin() << "]";
            } else {
                cout << "Y[" << it-Y.begin() << "]";
            }
        };
        VI turn(M+1);
        int u = 0;
        for (int v : A) {
            if (cnt[u] > 1) {
                int sz = lwb[cnt[u]];
                if (sw[u] == -1) {
                    sw[u] = X.size();
                    C[u] = trans(sw[u]);
                    int l = (1<<(sz-1))-1;
                    int r = (1<<sz)-2;
                    replr(i, 0, r) {
                        X.pb(0), Y.pb(0);
                    }
                    replr(i, 0, l-1) {
                        /*cout << trans(sw[u]+2*i+1) << endl;*/
                        /*cout << trans(sw[u]+2*i+2) << endl;*/
                        X[sw[u]+i] = trans(sw[u] + 2*i+1);
                        Y[sw[u]+i] = trans(sw[u] + 2*i+2);
                    }
                    order[u] = vector<VIT>(1<<sz);
                    replr(i, l, r) {
                        order[u][flip(i*2+1-(r+1), sz)] = X.begin() + sw[u]+i;
                        order[u][flip(i*2+2-(r+1), sz)] = Y.begin() + sw[u]+i;
                    }
                    rep(i, (1<<sz)-cnt[u]) {
                        *(order[u][i]) = trans(sw[u]);
                    }
                    turn[u] = (1<<sz)-cnt[u];
                }
                *(order[u][turn[u]++]) = v;
            } else {
                C[u] = v;
            }
            u = v;
        }
        /*rep(u, C.size()) cout << u << ": " << C[u] << endl;*/
        /*rep(u, X.size()) cout << trans(u) << ": " << X[u] << ", " << Y[u] << endl;*/
        answer(C, X, Y);
    }
};
namespace TEST4 {
    typedef VI::iterator VIT;
    void solve(int M, VI A) { int N = A.size();
        VI C, X, Y;
        X.reserve(2*A.size());
        Y.reserve(2*A.size());
        C = VI(M+1);
        auto trans = [&](int x) {
            return -(x+1);
        };
        auto flip = [&](int x, int s) {
            rep(i, s/2) {
                int ch = bool(x&(1<<i))^bool(x&(1<<(s-1-i)));
                x ^= (ch<<i);
                x ^= (ch<<(s-1-i));
            }
            return x;
        };
        auto print = [&](VIT it) {
            if (X.begin() <= it && it < X.end()) {
                cout << "X[" << it-X.begin() << "]";
            } else {
                cout << "Y[" << it-Y.begin() << "]";
            }
        };
        VI turn(M+1);

        int sz = 0;
        while ((1<<sz) <= N) sz++;

        replr(u, 0, M) C[u] = trans(0);

        int l = (1<<(sz-1))-1;
        int r = (1<<sz)-2;
        replr(i, 0, r) {
            X.pb(0), Y.pb(0);
        }
        replr(i, 0, l-1) {
            X[i] = trans(2*i+1);
            Y[i] = trans(2*i+2);
        }
        vector<VIT> order(1<<sz);
        replr(i, l, r) {
            order[flip(i*2+1-(r+1), sz)] = X.begin() + i;
            order[flip(i*2+2-(r+1), sz)] = Y.begin() + i;
        }
        replr(i, 0, N-1) {
            *(order[i]) = A[i];
        }
        replr(i, N, (1<<sz)-2) {
            *(order[i]) = trans(0);
        }
        /*rep(u, C.size()) cout << u << ": " << C[u] << endl;*/
        /*rep(u, X.size()) cout << trans(u) << ": " << X[u] << ", " << Y[u] << endl;*/
        answer(C, X, Y);
    }
};

void create_circuit(int M, VI A) {
    if (M == 1) TEST5::solve(M, A);
    else TEST4::solve(M, A);
}

Compilation message

doll.cpp: In function 'void TEST6::solve(int, VI)':
doll.cpp:94:14: warning: variable 'print' set but not used [-Wunused-but-set-variable]
   94 |         auto print = [&](VIT it) {
      |              ^~~~~
doll.cpp: In function 'void TEST4::solve(int, VI)':
doll.cpp:159:14: warning: variable 'print' set but not used [-Wunused-but-set-variable]
  159 |         auto print = [&](VIT it) {
      |              ^~~~~

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 10 ms 2860 KB Output is correct
3 Correct 8 ms 2908 KB Output is correct
4 Correct 17 ms 4184 KB Output is correct

Subtask #6
28.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 10 ms 2860 KB Output is correct
3 Correct 8 ms 2908 KB Output is correct
4 Correct 17 ms 4184 KB Output is correct
5 Partially correct 52 ms 12884 KB Output is partially correct
6 Partially correct 48 ms 12640 KB Output is partially correct
7 Partially correct 51 ms 12892 KB Output is partially correct
8 Partially correct 46 ms 12636 KB Output is partially correct
9 Partially correct 42 ms 11096 KB Output is partially correct
10 Partially correct 46 ms 12368 KB Output is partially correct
11 Partially correct 49 ms 12380 KB Output is partially correct
12 Partially correct 40 ms 11100 KB Output is partially correct
13 Partially correct 42 ms 11356 KB Output is partially correct
14 Partially correct 43 ms 11344 KB Output is partially correct
15 Partially correct 43 ms 11356 KB Output is partially correct
16 Partially correct 1 ms 600 KB Output is partially correct
17 Correct 24 ms 6984 KB Output is correct
18 Partially correct 40 ms 11068 KB Output is partially correct
19 Partially correct 40 ms 11096 KB Output is partially correct
20 Partially correct 48 ms 12468 KB Output is partially correct
21 Partially correct 51 ms 12372 KB Output is partially correct
22 Partially correct 60 ms 12324 KB Output is partially correct