oj.uz

Submission #793911

# Submission time Handle Problem Language Result Execution time Memory
793911 2023-07-26T08:00:58 Z Sohsoh84 Mechanical Doll (IOI18_doll) C++17
100 / 100
 72 ms 11892 KB 
#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

#define all(x)		(x).begin(), (x).end()
#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;

const int MAXN = 1e6 + 10;

int s = 1, n, fake_vert;
vector<int> C, X, Y, A;

inline int create_switch(int x, int y) {
	X.push_back(x);
	Y.push_back(y);
	s++;
	return -(s - 1);
}

inline int create_trigger(int x) {
	X.push_back(-s);
	Y.push_back(x);
	
	s++;
	return -(s - 1); 
}

int build(int l = 0, int r = n - 1) {
	if (A[l] == fake_vert && A[r] == fake_vert) return fake_vert;
	if (l == r) return A[l];
	else {
		int mid = (l + r) >> 1;
		int a = build(l, mid);
		int b = build(mid + 1, r);

		//cerr << l << sep << r << sep << -s << sep << a << sep << b << endl;
		return create_switch(a, b);
	}
}

inline int f(int ind, int lg) {
	int ans = 0;
	while (lg--) {
		ans = (ans << 1 | (ind & 1));
		ind >>= 1;
	}

	return ans;
}

inline void print() {
	debug("print")
	for (int i = 0; i < int(C.size()); i++)
		cerr << i << ": " << C[i] << endl;

	cerr << endl;
	cerr << endl;

	for (int i = 0; i < int(X.size()); i++)
		cerr << -(i + 1) << ": " <<  X[i] << sep << Y[i] << endl;

	cerr << endl;
	cerr << endl;
}

void create_circuit(int m, vector<int> A_) {
	A = A_;
	A.push_back(0);
	A_.push_back(0);

	C.resize(m + 1);
	C[0] = A.front();
	A.erase(A.begin());
	A_.erase(A_.begin());

	fake_vert = create_trigger(-1);		
	reverse(all(A));
	while (__builtin_popcount(int(A.size())) > 1) A.push_back(fake_vert);
	reverse(all(A));

	n = A.size();
	int lg = __builtin_ctz(n);

	vector<pair<int, int>> tmp;
	int ind = n - 1;
	while (ind >= 0 && A[ind] >= 0) {
		tmp.push_back({f(ind, lg), ind});
		ind--;
	}

	sort(all(tmp));	
	for (int i = 0; i < int(A_.size()); i++)
		A[tmp[i].second] = A_[i];

	int root = build(0, n - 1);
	Y[0] = root;

	while (A.back() < 0) A.pop_back();
	
	for (int i = 1; i <= m; i++) C[i] = root;

//	assert(X.size() <= 2 * n);
//	print();
	answer(C, X, Y);
}

// TODO: change destincation of fake_vert to root

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 4752 KB Output is correct
3 Correct 25 ms 5180 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 1484 KB Output is correct
6 Correct 40 ms 7516 KB Output is correct
7 Correct 1 ms 300 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 4752 KB Output is correct
3 Correct 25 ms 5180 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 1484 KB Output is correct
6 Correct 40 ms 7516 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 44 ms 7664 KB Output is correct
9 Correct 51 ms 9184 KB Output is correct
10 Correct 72 ms 11892 KB Output is correct
11 Correct 0 ms 300 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 4752 KB Output is correct
3 Correct 25 ms 5180 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 1484 KB Output is correct
6 Correct 40 ms 7516 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 44 ms 7664 KB Output is correct
9 Correct 51 ms 9184 KB Output is correct
10 Correct 72 ms 11892 KB Output is correct
11 Correct 0 ms 300 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 70 ms 11092 KB Output is correct
15 Correct 43 ms 7680 KB Output is correct
16 Correct 67 ms 11032 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 72 ms 11712 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 38 ms 6224 KB Output is correct
3 Correct 38 ms 6748 KB Output is correct
4 Correct 61 ms 9724 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 38 ms 6224 KB Output is correct
3 Correct 38 ms 6748 KB Output is correct
4 Correct 61 ms 9724 KB Output is correct
5 Correct 72 ms 10460 KB Output is correct
6 Correct 66 ms 10224 KB Output is correct
7 Correct 69 ms 10356 KB Output is correct
8 Correct 66 ms 10024 KB Output is correct
9 Correct 39 ms 6732 KB Output is correct
10 Correct 63 ms 9900 KB Output is correct
11 Correct 62 ms 9640 KB Output is correct
12 Correct 40 ms 6728 KB Output is correct
13 Correct 40 ms 6536 KB Output is correct
14 Correct 46 ms 7072 KB Output is correct
15 Correct 42 ms 7232 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 39 ms 6224 KB Output is correct
18 Correct 38 ms 6224 KB Output is correct
19 Correct 45 ms 6744 KB Output is correct
20 Correct 63 ms 9820 KB Output is correct
21 Correct 62 ms 9732 KB Output is correct
22 Correct 61 ms 9736 KB Output is correct