oj.uz

Submission #200613

# Submission time Handle Problem Language Result Execution time Memory
200613 2020-02-07T15:27:45 Z TadijaSebez Editor (BOI15_edi) C++11
35 / 100
 3000 ms 4984 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]);
	for(int i=1;i<=n;i++){
		stack<int> stk;
		int ans=0;
		if(i==n||mn>=-1||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 22 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 51 ms 380 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 8 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 1010 ms 3592 KB Output is correct
2 Correct 1329 ms 3680 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 1272 KB Output is correct
2 Correct 63 ms 2552 KB Output is correct
3 Correct 82 ms 3392 KB Output is correct
4 Correct 1229 ms 4984 KB Output is correct
5 Correct 138 ms 4216 KB Output is correct
6 Execution timed out 3069 ms 2424 KB Time limit exceeded

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 22 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 51 ms 380 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 8 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 1010 ms 3592 KB Output is correct
11 Correct 1329 ms 3680 KB Output is correct
12 Correct 55 ms 1272 KB Output is correct
13 Correct 63 ms 2552 KB Output is correct
14 Correct 82 ms 3392 KB Output is correct
15 Correct 1229 ms 4984 KB Output is correct
16 Correct 138 ms 4216 KB Output is correct
17 Execution timed out 3069 ms 2424 KB Time limit exceeded