Submission #951493

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
951493	2024-03-22T03:47:00 Z	Trisanu_Das	Editor (BOI15_edi)	C++17	63 / 100	264 ms	90448 KB

edi

#include <bits/stdc++.h>
using namespace std;
int arr[400000];
 
int calculate(int x){
	if(arr[x]>=0)return x;
	stack<int> q;
	q.push(arr[x]);
	for(int i = x - 1; i > 0; i--){
		if(arr[i] > q.top()) q.pop();
		else q.push(arr[i]);
		if(q.empty()) return calculate(i - 1);
	}
	return 0;
}

int main(){
	int n; cin >> n;
	n++;
	arr[0] = 0;
	for(int i = 1; i < n; i++) cin >> arr[i];
	if(n <= 6000){
		for(int i = 1; i < n; i++) cout << arr[calculate(i)] << '\n';
		return 0;
	}
	int mn = 0;
	for(int i = 1; i < n; i++) mn = min(mn, arr[i]);
	if(mn >= -1){
		stack<int> q;
		q.push(0);
		for(int i = 1; i < n; i++){
			if(arr[i] > 0) q.push(arr[i]); 
			else q.pop();
			cout << q.top() << '\n';
		}
	}else{
		for(int i = 1; i < n - 1; i++) cout << "1\n";
		cout << arr[calculate(n - 1)] << '\n';
	}
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	12 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	264 ms	2184 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	75 ms	3424 KB	Output is correct
2	Correct	74 ms	3408 KB	Output is correct

Subtask #3

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	44 ms	1436 KB	Output is correct
2	Correct	42 ms	1544 KB	Output is correct
3	Correct	109 ms	90448 KB	Output is correct
4	Correct	76 ms	4948 KB	Output is correct
5	Correct	75 ms	4180 KB	Output is correct
6	Correct	63 ms	2896 KB	Output is correct

Subtask #4

0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	12 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	264 ms	2184 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	75 ms	3424 KB	Output is correct
11	Correct	74 ms	3408 KB	Output is correct
12	Correct	44 ms	1436 KB	Output is correct
13	Correct	42 ms	1544 KB	Output is correct
14	Correct	109 ms	90448 KB	Output is correct
15	Correct	76 ms	4948 KB	Output is correct
16	Correct	75 ms	4180 KB	Output is correct
17	Correct	63 ms	2896 KB	Output is correct
18	Incorrect	71 ms	4256 KB	Output isn't correct
19	Halted	0 ms	0 KB	-