Submission #292116

#	Time	Username	Problem	Language	Result	Execution time	Memory
292116		SamAnd	Mechanical Doll (IOI18_doll)	C++17	6 / 100	140 ms	17236 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const int N = 200005;

int n, m;

int z;
vector<int> ans;
vector<int> ansx;
vector<int> ansy;

bool stg0(int x)
{
    while (x % 2 == 0)
        x /= 2;
    return x == 1;
}

vector<int> v[N];

int bil(int l, int r, int pos, int d, int x)
{
    if (l == r)
    {
        return v[x][pos];
    }
    int m = (l + r) / 2;
    int u = --z;
    ansx.push_back(0);
    ansy.push_back(0);
    ansx[-u - 1] = bil(l, m, pos, d + 1, x);
    /*if (u == -2)
    {
        printf("%d %d\n", ansx[-u - 1], ansy[-u - 1]);
    }*/
    ansy[-u - 1] = bil(m + 1, r, pos + (1 << d), d + 1, x);
    return u;
}

void create_circuit(int M_, std::vector<int> A)
{
    n = sz(A);
    m = M_;

    for (int i = 0; i < n; ++i)
    {
        if (i < n - 1)
            v[A[i]].push_back(A[i + 1]);
        else
            v[A[i]].push_back(0);
    }

    ans.push_back(A[0]);
    for (int x = 1; x <= m; ++x)
    {
        if (v[x].empty())
        {
            ans.push_back(0);
            continue;
        }
        else if (sz(v[x]) == 1)
        {
            ans.push_back(v[x][0]);
            continue;
        }
        reverse(all(v[x]));
        while (!stg0(sz(v[x])))
        {
            --z;
            ansx.push_back(0);
            ansy.push_back(0);
            v[x].push_back(z);
        }
        reverse(all(v[x]));
        int u = bil(0, sz(v[x]) - 1, 0, 0, x);
        for (int i = 0; i < sz(v[x]); ++i)
        {
            if (v[x][i] < 0)
            {
                ansx[-v[x][i] - 1] = v[x][i];
                ansy[-v[x][i] - 1] = u;
            }
        }
        ans.push_back(u);
    }
    answer(ans, ansx, ansy);
}

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