제출 #713754

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
713754		PixelCat	자동 인형 (IOI18_doll)	C++14	16 / 100	88 ms	11264 KiB

doll

#ifdef NYAOWO
#include "grader.cpp"
#define OUT_VEC(x) { cout << #x << ":"; { for(auto &IT:x) cout << " " << IT; } cout << "\n"; }
#else
#define OUT_VEC(x)
#endif
#include "doll.h"

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXM = 100010;

void create_circuit(int M, std::vector<int> A) {
    vector<vector<int>> adj(M + 1, vector<int>());
    vector<int> x, y;
    int n = sz(A);
    For(i, 0, n - 2) {
        adj[A[i]].eb(A[i + 1]);
    }
    adj[A.back()].eb(0);
    vector<int> ans(M + 1);
    ans[0] = A[0];
    For(i, 1, M) {
        if(sz(adj[i]) == 0) {
            ans[i] = 0;
        } else if(sz(adj[i]) == 1) {
            ans[i] = adj[i][0];
        } else if(sz(adj[i]) == 2) {
            int tot = sz(adj[i]);
            int now = sz(x) + 1;
            ans[i] = -now;
            For(j, 0, tot - 3) {
                x.eb(adj[i][j]);
                y.eb(-(now + 1));
                now++;
            }
            x.eb(adj[i][tot - 2]);
            y.eb(adj[i][tot - 1]);
        } else {
            auto &v = adj[i];
            int id = sz(x) + 1;
            ans[i] = -id;
            if(sz(adj[i]) == 4) {
                x.eb(-(id + 1));
                y.eb(-(id + 2));
                x.eb(v[0]);
                y.eb(v[2]);
                x.eb(v[1]);
                y.eb(v[3]);
            } else {
                x.eb(-(id + 1));
                y.eb(-(id + 2));
                x.eb(-(id));
                y.eb(v[1]);
                x.eb(v[0]);
                y.eb(v[2]);
            }
        }
    }
    OUT_VEC(ans);
    OUT_VEC(x);
    OUT_VEC(y);
    answer(ans, x, y);
}

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