oj.uz

Submission #200615

# Submission time Handle Problem Language Result Execution time Memory
200615 2020-02-07T15:30:34 Z TadijaSebez Editor (BOI15_edi) C++11
63 / 100
 113 ms 4216 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=300050;
int a[N];
int main(){
	int n,mn=0;
	scanf("%i",&n);
	for(int i=1;i<=n;i++)scanf("%i",&a[i]),mn=min(mn,a[i]);
	if(mn>=-1){
		stack<int> stk;
		for(int i=1;i<=n;i++){
			if(a[i]>0)stk.push(a[i]);
			else if(stk.size())stk.pop();
			if(stk.size())printf("%i\n",stk.top());
			else printf("0\n");
		}
	}
	else{
		for(int i=1;i<=n;i++){
			stack<int> stk;
			int ans=0;
			if(i==n||n<=5000){
				for(int j=i;j>=1;j--){
					if(stk.size()&&a[j]>stk.top()){
						stk.pop();
					}else{
						if(a[j]>0){ans=a[j];break;}
						stk.push(a[j]);
					}
				}
			}
			printf("%i\n",ans);
		}
	}
	return 0;
}

Compilation message

edi.cpp: In function 'int main()':
edi.cpp:7:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
edi.cpp:8:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++)scanf("%i",&a[i]),mn=min(mn,a[i]);
                       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 24 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 51 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 7 ms 376 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 3448 KB Output is correct
2 Correct 83 ms 3448 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 1276 KB Output is correct
2 Correct 65 ms 1400 KB Output is correct
3 Correct 97 ms 1812 KB Output is correct
4 Correct 89 ms 3448 KB Output is correct
5 Correct 113 ms 2040 KB Output is correct
6 Correct 60 ms 2040 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 24 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 51 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 84 ms 3448 KB Output is correct
11 Correct 83 ms 3448 KB Output is correct
12 Correct 57 ms 1276 KB Output is correct
13 Correct 65 ms 1400 KB Output is correct
14 Correct 97 ms 1812 KB Output is correct
15 Correct 89 ms 3448 KB Output is correct
16 Correct 113 ms 2040 KB Output is correct
17 Correct 60 ms 2040 KB Output is correct
18 Incorrect 111 ms 4216 KB Output isn't correct
19 Halted 0 ms 0 KB -