oj.uz

Submission #92907

# Submission time Handle Problem Language Result Execution time Memory
92907 2019-01-05T14:04:41 Z Pajaraja popa (BOI18_popa) C++17
0 / 100
 160 ms 376 KB 
#include <bits/stdc++.h>
#include "popa.h"
#define MAXN 1007
using namespace std;
int ls[MAXN],rs[MAXN],dml[MAXN],dmr[MAXN];
int rek(int lt,int rt)
{
	if(lt>rt) return -1;
	int l;
	for(int i=lt;i<=rt;i++) {if(dml[i]<=lt && dmr[i]>=rt)  l=i; break;}
	ls[l]=rek(lt,l-1);
	rs[l]=rek(l+1,rt);
	return l;
}
int solve(int N,int* Left,int* Right)
{
	stack<int> st; st.push(-1);	
	for(int i=0;i<N;i++)
	{
		while(st.size()>1) if(query(st.top(),st.top(),st.top(),i)) {dmr[st.top()]=i-1; st.pop(); break;}
		dml[i]=st.top()+1;
		st.push(i);
	}
	while(st.size()>1) {dmr[st.top()]=N-1; st.pop();}
	int a=rek(0,N-1);
	for(int i=0;i<N;i++) Left[i]=ls[i];
	for(int i=0;i<N;i++) Right[i]=rs[i];
	return a;
}

Compilation message

popa.cpp: In function 'int rek(int, int)':
popa.cpp:12:7: warning: 'l' may be used uninitialized in this function [-Wmaybe-uninitialized]
  rs[l]=rek(l+1,rt);
  ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 84 ms 248 KB too many queries
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 160 ms 376 KB too many queries
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 248 KB too many queries
2 Halted 0 ms 0 KB -