oj.uz

Submission #75920

# Submission time Handle Problem Language Result Execution time Memory
75920 2018-09-11T14:51:26 Z ainta Mechanical Doll (IOI18_doll) C++17
85.553 / 100
 118 ms 18500 KB 
#include "doll.h"
#include<cstdio>
#include<algorithm>
#include<queue>
#define N_ 101000
using namespace std;

int n, m, Out[N_], cnt, chk[N_*10], PV;

int RR[N_ * 10][2], vv[N_*10], Num[N_*10], ReNum[N_*10];

vector<int>E[N_], TP;

void Go(int a, int L, int cur, int ed) {
	if (L == 1) {
		if (RR[a][cur & 1]) {
			RR[RR[a][cur & 1]][0] = ed;
			return;
		}
		RR[a][cur & 1] = ed;
		return;
	}
	if (!RR[a][cur & 1])RR[a][cur & 1] = ++cnt;
	Go(RR[a][cur & 1], L - 1, cur >> 1, ed);
}

int Make() {
	int ret = cnt + 1;
	int i, sz = 1, cc = 0, j;
	int L = TP.size();
	while (sz < L) sz *= 2, cc++;
	
	for (i = 1; i < sz/2; i++) {
		RR[cnt + i][0] = cnt + i * 2;
		RR[cnt + i][1] = cnt + i * 2 + 1;
	}
	

	int ccc = 0;

	for (i = 0; i < sz; i++) {
		int t = 0;
		for (j = 0; j < cc; j++) {
			t = t * 2 + ((i >> j) & 1);
		}
		int nxt;
		if (t < sz - L) {
			nxt = ret;
		}
		if (t >= sz - L) {
			nxt = -TP[ccc++];
		}
		RR[cnt + sz / 2 + (t >> 1)][t & 1] = nxt;
	}

	for (i = cnt + sz - 1; i >= ret; i--) {
		int x = i - cnt;
		if (RR[i][0] >= 0 && RR[i][1] >= 0 && RR[i][0] == ret && RR[i][1] == ret) {
			RR[cnt + x / 2][x & 1] = ret;
			vv[i] = 1;
		}
	}

	cnt += sz - 1;



	return -ret;
}

void create_circuit(int M, std::vector<int> A) {
	n = A.size();
	m = M;
	E[0].push_back(A[0]);
	int i;
	for (i = 0; i < n - 1; i++) {
		E[A[i]].push_back(A[i + 1]);
	}
	E[A[n - 1]].push_back(0);
	for (i = 0; i <= M; i++) {
		if (E[i].size() == 0) Out[i] = 0;
		else if (E[i].size() == 1)Out[i] = E[i][0];
		else {
			TP = E[i];
			Out[i] = Make();
		}
	}
	int ct = 0;
	for (i = 1; i <= cnt; i++) {
		if (!vv[i]) {
			Num[i] = ++ct;
			ReNum[ct] = i;
		}
	}
	vector<int>C(m+1), X(ct), Y(ct);
	for (i = 0; i <= m; i++) {
		C[i] = Out[i];
		if (C[i] < 0)C[i] = -Num[-Out[i]];
	}
	for (i = 0; i < ct; i++) {
		int x = RR[ReNum[i + 1]][0];
		int y = RR[ReNum[i + 1]][1];
		if (x > 0)x = Num[x];
		if (y > 0)y = Num[y];
		x = -x, y = -y;
		X[i] = x, Y[i] = y;
	}
	answer(C, X, Y);

}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 32 ms 6772 KB Output is correct
3 Correct 26 ms 6220 KB Output is correct
4 Correct 2 ms 2616 KB Output is correct
5 Correct 45 ms 4172 KB Output is correct
6 Correct 43 ms 8132 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 32 ms 6772 KB Output is correct
3 Correct 26 ms 6220 KB Output is correct
4 Correct 2 ms 2616 KB Output is correct
5 Correct 45 ms 4172 KB Output is correct
6 Correct 43 ms 8132 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 74 ms 9376 KB Output is correct
9 Correct 64 ms 9668 KB Output is correct
10 Correct 106 ms 12856 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 3 ms 2636 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 32 ms 6772 KB Output is correct
3 Correct 26 ms 6220 KB Output is correct
4 Correct 2 ms 2616 KB Output is correct
5 Correct 45 ms 4172 KB Output is correct
6 Correct 43 ms 8132 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 74 ms 9376 KB Output is correct
9 Correct 64 ms 9668 KB Output is correct
10 Correct 106 ms 12856 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 3 ms 2636 KB Output is correct
14 Correct 108 ms 15224 KB Output is correct
15 Correct 54 ms 9028 KB Output is correct
16 Correct 91 ms 12404 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 3 ms 2636 KB Output is correct
19 Correct 3 ms 2636 KB Output is correct
20 Correct 110 ms 13880 KB Output is correct
21 Correct 3 ms 2636 KB Output is correct
22 Correct 3 ms 2636 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 52 ms 9928 KB Output is correct
3 Correct 58 ms 12128 KB Output is correct
4 Correct 89 ms 14572 KB Output is correct

Subtask #6
41.5530038336 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 52 ms 9928 KB Output is correct
3 Correct 58 ms 12128 KB Output is correct
4 Correct 89 ms 14572 KB Output is correct
5 Partially correct 118 ms 18028 KB Output is partially correct
6 Partially correct 108 ms 18500 KB Output is partially correct
7 Partially correct 106 ms 18296 KB Output is partially correct
8 Partially correct 100 ms 18452 KB Output is partially correct
9 Partially correct 57 ms 11188 KB Output is partially correct
10 Partially correct 91 ms 16788 KB Output is partially correct
11 Partially correct 81 ms 17860 KB Output is partially correct
12 Partially correct 54 ms 12672 KB Output is partially correct
13 Partially correct 70 ms 13044 KB Output is partially correct
14 Partially correct 72 ms 12852 KB Output is partially correct
15 Partially correct 79 ms 12780 KB Output is partially correct
16 Partially correct 4 ms 2892 KB Output is partially correct
17 Partially correct 101 ms 11452 KB Output is partially correct
18 Partially correct 55 ms 11380 KB Output is partially correct
19 Partially correct 52 ms 11644 KB Output is partially correct
20 Partially correct 85 ms 15480 KB Output is partially correct
21 Partially correct 86 ms 16632 KB Output is partially correct
22 Partially correct 80 ms 14844 KB Output is partially correct