oj.uz

Submission #1059805

# Submission time Handle Problem Language Result Execution time Memory
1059805 2024-08-15T08:22:30 Z jerzyk Mechanical Doll (IOI18_doll) C++17
0 / 100
 1 ms 4536 KB 
#include <bits/stdc++.h>
#include "doll.h"

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const ll M = 1000LL * 1000LL * 1000LL + 7LL;
const int N = 1000 * 1000 + 7;
int L, lft;
int tab[N];
int l[N], r[N], num[N], cnt = 0;
vector<pair<int, int>> pos;

void Rem(int v, int siz)
{
	if(lft == 0 || siz == 1) return;
	if(siz / 2 <= lft)
	{
		l[v] = -1;
		lft -= siz / 2;
	}
	if(l[v] != -1)
		Rem(v * 2, siz / 2);
	else
		Rem(v * 2 + 1, siz / 2);
}

void FindPos(int v, int num, int wys)
{
	if(v >= L)
	{
		pos.pb(make_pair(num, v));
		return;
	}
	if(l[v] != -1)
		FindPos(v * 2, num, wys + 1);
	FindPos(v * 2 + 1, num + (1<<wys), wys + 1);
}

void Fin(int v)
{
	--cnt; num[v] = cnt;
	if(l[v] == 0 && v * 2 < L)
	{
		Fin(v * 2);
		l[v] = num[v * 2];
	}
	if(r[v] == 0 && v * 2 < L)
	{
		Fin(v * 2 + 1);
		r[v] = num[v * 2 + 1];
	}
}

void DoB(int n)
{
	L = 2;
	while(L < n)
		L *= 2;
	lft = L - n;
	Rem(1, L);
	FindPos(1, 0, 0);
	sort(pos.begin(), pos.end());
	for(int i = 1; i <= n; ++i)
	{
		int o = pos[i - 1].nd / 2;
		if(pos[i - 1].nd % 2 == 0)
			l[o] = tab[i];
		else
			r[o] = tab[i];
	}
	Fin(1);
}

void create_circuit(int M, vector<int> A)
{
	int n = A.size();
	vector<int> C, X, Y;
	for(int i = 1; i < n; ++i)
		tab[i] = A[i];
	C.pb(A[0]);
	for(int i = 1; i <= M; ++i)
		C.pb(-1);
	DoB(n);
	for(int i = 1; i <= L; ++i)
	{
		if(num[i] < 0)
		{
			X.pb(l[i]);
			Y.pb(r[i]);
		}
	}
	answer(C, X, Y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4536 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB wrong motion
2 Halted 0 ms 0 KB -