oj.uz

Submission #647393

# Submission time Handle Problem Language Result Execution time Memory
647393 2022-10-02T11:24:27 Z Alenygam Zalmoxis (BOI18_zalmoxis) C++14
0 / 100
 421 ms 31684 KB 
#include <bits/stdc++.h>

using namespace std;

struct btNode {
	int value;
	bool left;
	bool right;
};

struct linkedListNode {
	int8_t val;
	linkedListNode *next = nullptr;
	bool inserted = false;
};

linkedListNode preallocLinked[1000001];
int lastNodeLnkd = 0;
static linkedListNode* get_new_lnkd_node() {
	return &preallocLinked[lastNodeLnkd++];
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int N, K;
	cin >> N >> K;
	vector<int> values(N);
	for (auto &i: values) cin >> i;
	values.push_back(30);

	linkedListNode *head = get_new_lnkd_node();
	linkedListNode *tail = head;

	stack<btNode> stck;
	stck.push(btNode{30, 0, 0});

	for (int i = 0; i < N; i++) {
		tail->next = get_new_lnkd_node();
		tail = tail->next;
		tail->val = values[i];
		tail->inserted = false;

		while (values[i] < stck.top().value) {
			btNode &top = stck.top();
			if (top.left) {
				// I have to go right (left completely explored)
				btNode right;
				right.value = top.value - 1;
				top.right = true;
				stck.push(right);
			} else {
				// I can go left
				btNode left;
				left.value = top.value - 1;
				top.left = true;
				stck.push(left);
			}
		}
		stck.pop(); // node is == values[i], algorithm would never run next while loop
		if (i != N - 1) {
			while (stck.size() > 1 && (values[i + 1] >= stck.top().value || (stck.top().right && stck.top().left))) {
				btNode &top = stck.top();
				if (!top.right) {
					tail->next = get_new_lnkd_node();
					tail = tail->next;
					tail->val = top.value - 1;
					tail->inserted = true;
				}
				stck.pop();
			}
		} else {
			while (!stck.empty() && (values[i + 1] >= stck.top().value || (stck.top().right && stck.top().left))) {
				btNode &top = stck.top();
				if (!top.right) {
					tail->next = get_new_lnkd_node();
					tail = tail->next;
					tail->val = top.value - 1;
					tail->inserted = true;
				}
				stck.pop();
			}
		}
	}

	head = head->next;
	while (head != nullptr) {
		cout << (int)head->val << ' ';
		head = head->next;
	}
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 414 ms 31556 KB Unexpected end of file - int32 expected
2 Incorrect 403 ms 31556 KB Unexpected end of file - int32 expected
3 Incorrect 407 ms 31568 KB Unexpected end of file - int32 expected
4 Incorrect 410 ms 31564 KB Unexpected end of file - int32 expected
5 Incorrect 410 ms 31556 KB Unexpected end of file - int32 expected
6 Incorrect 421 ms 31564 KB Unexpected end of file - int32 expected

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 414 ms 31560 KB Unexpected end of file - int32 expected
2 Incorrect 409 ms 31564 KB Unexpected end of file - int32 expected
3 Incorrect 406 ms 31684 KB Unexpected end of file - int32 expected
4 Incorrect 403 ms 31556 KB Unexpected end of file - int32 expected
5 Incorrect 414 ms 31560 KB Unexpected end of file - int32 expected
6 Incorrect 406 ms 31564 KB Unexpected end of file - int32 expected
7 Incorrect 406 ms 31568 KB Unexpected end of file - int32 expected
8 Incorrect 401 ms 31560 KB Unexpected end of file - int32 expected
9 Incorrect 338 ms 30000 KB Unexpected end of file - int32 expected
10 Incorrect 137 ms 26068 KB Unexpected end of file - int32 expected
11 Incorrect 210 ms 27596 KB Unexpected end of file - int32 expected
12 Incorrect 10 ms 23764 KB Unexpected end of file - int32 expected
13 Incorrect 10 ms 23788 KB Unexpected end of file - int32 expected
14 Incorrect 10 ms 23692 KB Unexpected end of file - int32 expected