Submission #123911

#	Time	Username	Problem	Language	Result	Execution time	Memory
123911		eriksuenderhauf	Mechanical Doll (IOI18_doll)	C++11	100 / 100	169 ms	14108 KiB

doll

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "doll.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
int n, p=1, cnt=1;
bool mrk[MAXN];
vi x, y;

int build(int l, int r) {
	if (l >= r) return 0;
	if (r + n < p) return -1;
	int cur = cnt++;
	int m = (l+r) / 2;
	//x.pb(0), y.pb(0);
	x[cur-1] = build(l, m);
	y[cur-1] = build(m+1, r);
	return -cur;
}

void upd(int i, int j) {
	int &cur = mrk[-i] ? y[-(i+1)] : x[-(i+1)];
	mrk[-i] = !mrk[-i];
	if (!cur)
		cur = j;
	else
		upd(cur, j);
}

void create_circuit(int m, vi a) {
	x.resize(MAXN);
	y.resize(MAXN);
	n = a.size();
	while (p < n) p <<= 1;
	build(0, p - 1);
	for (int i = 1; i < n; i++)
		upd(-1, a[i]);
	if (n & 1)
		upd(-1, -1);
	upd(-1, 0);
	vi c(m+1, -1);
	c[0] = a[0];
	x.resize(cnt);
	y.resize(cnt);
	answer(c, x, y);
}

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