oj.uz

Submission #95897

# Submission time Handle Problem Language Result Execution time Memory
95897 2019-02-03T12:37:27 Z JustInCase popa (BOI18_popa) C++17
0 / 100
 27 ms 248 KB 
#include <bits/stdc++.h>
#include "popa.h"

#define int32_t int
#define int64_t long long
#define Solve solve
#define Query query

const int32_t MAX_N = 1000;

int32_t parent[MAX_N + 5];

/**
int32_t Query(int32_t a, int32_t b, int32_t c, int32_t d) {
	std::cout << a << " " << b << " " << c << " " << d << '\n' << std::flush;

	int32_t res;
	std::cin >> res;

	return res;
}
*/

int32_t Solve(int32_t n, int32_t *left, int32_t *right) {
	memset(parent, -1, sizeof(parent));
	
	int32_t root = 0;
	for(int32_t i = 1; i < n; i++) {
		if(Query(0, i, i, i)) {
			parent[root] = i;
			left[i] = root;
			root = i;
			continue;
		}

		int32_t curr = i - 1, possibleParent = -1;
		while(curr != -1) {
			if(Query(curr, curr, curr, i)) {
				possibleParent = curr;	
			}

			curr = parent[curr];
		}

		if(possibleParent == -1) {
			left[i] = root;
			root = i;
		}
		else {
			right[possibleParent] = i;
			parent[i] = possibleParent;
		}
	}

	return root;
}

/**
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int32_t left[6], right[6];
	int32_t ans = Solve(6, left, right);
	
	std::cout << ans << '\n';
	for(int32_t i = 0; i < 6; i++) {
		std::cout << left[i] << " " << right[i] << '\n';
	}
}
*/

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 248 KB not a binary tree
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 248 KB not a binary tree
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 248 KB too many queries
2 Halted 0 ms 0 KB -