제출 #1013215

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1013215		c2zi6	자동 인형 (IOI18_doll)	C++14	2 / 100	21 ms	5336 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"

void create_circuit(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);
    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;
    }

    /*rep(u, C.size()) cout << u << " -> " << C[u] << endl;*/
    /*rep(u, X.size()) cout << u << " -> " << X[u] << "/" << Y[u] << endl;*/

    answer(C, X, Y);
}

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