oj.uz

Submission #1069021

# Submission time Handle Problem Language Result Execution time Memory
1069021 2024-08-21T14:31:54 Z Joshua_Andersson Mechanical Doll (IOI18_doll) C++14
47 / 100
 111 ms 10576 KB 
#include "doll.h"

#include <bits/stdc++.h>
using namespace std;

const int inf = int(1e9);

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> p2;

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define sz(container) ((int)container.size())
#define all(x) begin(x),end(x)

#if _LOCAL
#define assert(x) if (!(x)) __debugbreak()
#endif

int n;
int ind = 1;
vi state;
vi x, y;
int k=0;
vi exitcnt;
int numexits = 0;
int build_tree(int d, vi& x, vi& y)
{
	int u = ind++;
	if (d==0)
	{
		exitcnt[u] = 2;
		numexits += 2;
		x[u] = inf;
		y[u] = inf;
		return u;
	}
	y[u] = build_tree(d - 1, x, y);
	x[u] = build_tree(d - 1, x, y);
	exitcnt[u] = exitcnt[x[u]] + exitcnt[y[u]];
	return u;
}

void killc(int u, vi& x, vi& y)
{
	if (u == inf) return;
	if (x[u]!=inf)
	{
		exitcnt[x[u]] = 0;
		killc(x[u], x, y);
		x[u] = inf;
	}
	if (y[u]!=inf)
	{
		exitcnt[y[u]] = 0;
		killc(y[u], x, y);
		y[u] = inf;
	}
}

bool kill(int u, vi& x, vi& y)
{
	if (u == inf) return false;
	if (numexits-exitcnt[u]>=n+1)
	{
		numexits -= exitcnt[u];
		killc(u, x, y);
		return true;
	}
	
	if (kill(x[u], x, y))
	{
		exitcnt[u] -= exitcnt[x[u]];
		x[u] = 1;
	}
	if (kill(y[u], x, y))
	{
		exitcnt[u] -= exitcnt[y[u]];
		y[u] = 1;
	}
	exitcnt[u] = 0;
	if (x[u] != inf) exitcnt[u] += exitcnt[x[u]];
	if (y[u] != inf) exitcnt[u] += exitcnt[y[u]];
	return false;
}

int* lastv = 0;
int statesum = 0;
void traverse(int u, int t)
{
	//cout << u << " ";
	int& v = state[u]?y[u]:x[u];
	if (v == -1) return;
	statesum += state[u] == 0 ? 1 : -1;
	state[u] ^= 1;
	if (v==inf)
	{
		lastv = &v;
		v = -t;
		return;
	}
	traverse(v, t);
}

void create_circuit(int m, std::vector<int> a)
{
	n = sz(a);
	vi c(m + 1, -1);
	c[0] = a[0];
	n--;
	a.erase(a.begin());
	while ((1<<(k+1))<=n)
	{
		k++;
	}

	state.resize(1 << (k+1));
	x.resize(1 << (k+1), inf);
	y.resize(1 << (k+1), inf);
	exitcnt.resize(1 << (k+1), 0);
	build_tree(k, x, y);
	kill(1, x, y);
	/*rep(i, sz(x))
	{
		if (x[i]!=inf) cout << (i) << " " << x[i] << "\n";
		if (y[i] != inf) cout << (i) << " " << y[i] << "\n";
	}*/
	rep(i, n)
	{
		traverse(1, a[i]);
		//cout << "\n";
	}
	repp(i, n, (1<<(k+1)))
	{
		traverse(1, -1);
		if (statesum == 0)
		{
			*lastv = 0;
			//cout << "ASD";
			break;
		}
		//cout << "\n";
	}

	rep(i, sz(x)) x[i] *= -1, y[i] *= -1;
	rep(i, sz(x))
	{
		if (x[i] == -inf) x[i] = -1;
		if (y[i] == -inf) y[i] = -1;
	}
	x.erase(x.begin());
	y.erase(y.begin());
	/*int u = sz(x);
	rep(i, sz(x))
	{
		cout << -(i+1) << " " << x[i] << "\n";
		cout << -(i+1) << " " << y[i] << "\n";
	}*/
	answer(c, x, y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Correct 51 ms 5560 KB Output is correct
3 Partially correct 67 ms 9556 KB Output is partially correct
4 Partially correct 87 ms 10220 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Correct 51 ms 5560 KB Output is correct
3 Partially correct 67 ms 9556 KB Output is partially correct
4 Partially correct 87 ms 10220 KB Output is partially correct
5 Partially correct 95 ms 10576 KB Output is partially correct
6 Partially correct 92 ms 10556 KB Output is partially correct
7 Partially correct 106 ms 10552 KB Output is partially correct
8 Partially correct 95 ms 10248 KB Output is partially correct
9 Partially correct 69 ms 9684 KB Output is partially correct
10 Partially correct 111 ms 10320 KB Output is partially correct
11 Partially correct 90 ms 10064 KB Output is partially correct
12 Partially correct 72 ms 9684 KB Output is partially correct
13 Correct 63 ms 5924 KB Output is correct
14 Partially correct 71 ms 9764 KB Output is partially correct
15 Partially correct 78 ms 9784 KB Output is partially correct
16 Partially correct 2 ms 600 KB Output is partially correct
17 Correct 56 ms 5456 KB Output is correct
18 Correct 53 ms 5460 KB Output is correct
19 Partially correct 77 ms 9560 KB Output is partially correct
20 Partially correct 98 ms 10064 KB Output is partially correct
21 Partially correct 90 ms 10064 KB Output is partially correct
22 Partially correct 97 ms 10072 KB Output is partially correct