oj.uz

Submission #522432

# Submission time Handle Problem Language Result Execution time Memory
522432 2022-02-05T02:47:58 Z ntabc05101 popa (BOI18_popa) C++14
100 / 100
 96 ms 288 KB 
#include<bits/stdc++.h>
#include "popa.h"
using namespace std;

#define taskname ""

int solve(int N, int *Left, int *Right) {
	for (int i = 0; i < N; i++) {
		Left[i] = Right[i] = -1;
	}

	vector<int> st(1, 0);
	for (int i = 1; i < N; i++) {
		int y = -1;
		while (!st.empty()) {
			int x = st.back();
			while (~Left[x]) {
				x = Left[x];
			}

			if (query(st.back(), st.back(), x, i)) {
				break;
			}
			y = st.back(); st.pop_back();
		}

		if (!st.empty()) {
			Right[st.back()] = i;
		}
		Left[i] = y;
		st.push_back(i);
	}	

	while (st.size() > 1) {
		st.pop_back();
	}
	return st.back();
}

Subtask #1
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 200 KB Output is correct
2 Correct 10 ms 200 KB Output is correct
3 Correct 8 ms 200 KB Output is correct
4 Correct 8 ms 280 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 280 KB Output is correct
2 Correct 75 ms 272 KB Output is correct
3 Correct 56 ms 200 KB Output is correct
4 Correct 75 ms 288 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 284 KB Output is correct
2 Correct 50 ms 288 KB Output is correct
3 Correct 86 ms 200 KB Output is correct
4 Correct 96 ms 284 KB Output is correct