Submission #1013604

#	Time	Username	Problem	Language	Result	Execution time	Memory
1013604		c2zi6	Mechanical Doll (IOI18_doll)	C++14	34 / 100	44 ms	10436 KiB

doll

#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 TEST2 {
    void solve(int M, VI A) {
        VI C, X, Y;
        C = VI(M+1);
        VI cnt(M+1);
        for (int x : A) cnt[x]++;
        VI sw(M+1, -1);
        int u = 0;
        for (int v : A) {
            if (cnt[u] == 2) {
                if (sw[u] == -1) {
                    sw[u] = X.size();
                    C[u] = -(sw[u]+1);
                    X.pb(0);
                    Y.pb(0);
                    X[sw[u]] = v;

                } else {
                    Y[sw[u]] = v;
                }
            } else {
                C[u] = v;
            }
            u = v;
        }
        answer(C, X, Y);
    }
};
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 TEST3 {
    void solve(int M, VI A) {
        VI C, X, Y;
        C = VI(M+1);
        VI cnt(M+1);
        for (int x : A) cnt[x]++;
        VI sw(M+1, -1);
        VI turn(M+1);
        auto trans = [&](int x) {
            return -(x+1);
        };
        int u = 0;
        for (int v : A) {
            if (cnt[u] == 4) {
                if (turn[u] == 0) {
                    sw[u] = X.size();
                    C[u] = trans(sw[u]);
                    X.pb(0), Y.pb(0);
                    X.pb(0), Y.pb(0);
                    X.pb(0), Y.pb(0);
                    X[sw[u]] = trans(sw[u]+1);
                    Y[sw[u]] = trans(sw[u]+2);
                }
                if (turn[u] == 0) {
                    X[sw[u]+1] = v;
                } else if (turn[u] == 1) {
                    X[sw[u]+2] = v;
                } else if (turn[u] == 2) {
                    Y[sw[u]+1] = v;
                } else if (turn[u] == 3) {
                    Y[sw[u]+2] = v;
                }
            } else if (cnt[u] == 3) {
                if (turn[u] == 0) {
                    sw[u] = X.size();
                    C[u] = trans(sw[u]);
                    X.pb(0), Y.pb(0);
                    X.pb(0), Y.pb(0);
                    X.pb(0), Y.pb(0);
                    X[sw[u]] = trans(sw[u]+1);
                    Y[sw[u]] = trans(sw[u]+2);
                    X[sw[u]+1] = trans(sw[u]);
                }
                if (turn[u] == 0) {
                    X[sw[u]+2] = v;
                } else if (turn[u] == 1) {
                    Y[sw[u]+1] = v;
                } else if (turn[u] == 2) {
                    Y[sw[u]+2] = v;
                }
            } else if (cnt[u] == 2) {
                if (turn[u] == 0) {
                    sw[u] = X.size();
                    C[u] = trans(sw[u]);
                    X.pb(0), Y.pb(0);
                }
                if (turn[u] == 0) {
                    X[sw[u]] = v;
                } else if (turn[u] == 1) {
                    Y[sw[u]] = v;
                }
            } else {
                C[u] = v;
            }
            turn[u]++;
            u = v;
        }
        answer(C, X, Y);
    }
};

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

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 10 / 10
• Subtask 4: 0 / 10
• Subtask 5: 18 / 18
• Subtask 6: 0 / 56