oj.uz

Submission #951501

# Submission time Handle Problem Language Result Execution time Memory
951501 2024-03-22T04:02:09 Z Trisanu_Das Editor (BOI15_edi) C++17
100 / 100
 168 ms 51328 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=300050;
const int L=19;
int a[N],go[N][L],mn[N][L],ans[N];
int main(){
	int n;
	scanf("%i",&n);
	for(int i=1;i<=n;i++){
		scanf("%i",&a[i]);
		if(a[i]>0)ans[i]=a[i];
		else{
			int x=-a[i];
			int j=i-1;
			for(int k=L-1;~k;k--)if(mn[j][k]>=x)j=go[j][k];
			ans[i]=ans[j-1];
			go[i][0]=j-1;
			mn[i][0]=x;
			for(int k=1;k<L;k++){
				go[i][k]=go[go[i][k-1]][k-1];
				mn[i][k]=min(mn[i][k-1],mn[go[i][k-1]][k-1]);
			}
		}
		printf("%i\n",ans[i]);
	}
	return 0;
}

Compilation message

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

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2492 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 50348 KB Output is correct
2 Correct 82 ms 50220 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 16720 KB Output is correct
2 Correct 44 ms 22096 KB Output is correct
3 Correct 157 ms 43856 KB Output is correct
4 Correct 85 ms 50256 KB Output is correct
5 Correct 80 ms 50544 KB Output is correct
6 Correct 92 ms 48468 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2492 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 83 ms 50348 KB Output is correct
11 Correct 82 ms 50220 KB Output is correct
12 Correct 39 ms 16720 KB Output is correct
13 Correct 44 ms 22096 KB Output is correct
14 Correct 157 ms 43856 KB Output is correct
15 Correct 85 ms 50256 KB Output is correct
16 Correct 80 ms 50544 KB Output is correct
17 Correct 92 ms 48468 KB Output is correct
18 Correct 76 ms 31256 KB Output is correct
19 Correct 76 ms 31664 KB Output is correct
20 Correct 168 ms 50000 KB Output is correct
21 Correct 80 ms 50772 KB Output is correct
22 Correct 91 ms 51328 KB Output is correct