#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>adj[200100];
int vis[200100],d[200100],n,h[200100],rbj[200100][20],obj[200100][20];
vector<int> v;
void init(int N, std::vector<int> H) {
stack<int> stk;
for(int i=0;i<N;i++)
h[i+1]=H[i];
h[0]=1e9;
n=N;
for(int i=0;i<N;i++){
while(stk.size()&&H[stk.top()]<=H[i])
stk.pop();
if(stk.size())
adj[i+1].push_back(stk.top()+1);
stk.push(i);
}
while(stk.size())stk.pop();
for(int i=N;i--;){
while(stk.size()&&H[stk.top()]<=H[i])
stk.pop();
if(stk.size())
adj[i+1].push_back(rbj[i+1][0]=stk.top()+1);
stk.push(i);
}
for(int i=1;i<=N;i++)if(adj[i].size()>1)
obj[i][0]=adj[i][H[adj[i][0]]>H[adj[i][1]]];
else if(adj[i].size())
obj[i][0]=adj[i][0];
for(int j=1;j<20;j++)
for(int i=1;i<=N;i++)
rbj[i][j]=rbj[rbj[i][j-1]][j-1],
obj[i][j]=obj[obj[i][j-1]][j-1];
}
int minimum_jumps(int A, int B, int C, int D) {
A++,B++,C++,D++;
A=B;
int a=A,c=C,d=0;
for(int i=20;i--;)
if(h[rbj[a][i]]<=h[c])
a=rbj[a][i];
if(a-c)
return -1;
a=A;
for(int i=20;i--;)
if(h[obj[a][i]]<=h[c])
a=obj[a][i],d+=1<<i;
for(int i=20;i--;)
if(h[rbj[a][i]]<=h[c])
a=rbj[a][i],d+=1<<i;
return d;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
9816 KB |
Output is correct |
2 |
Correct |
2 ms |
9912 KB |
Output is correct |
3 |
Correct |
153 ms |
41576 KB |
Output is correct |
4 |
Correct |
978 ms |
47448 KB |
Output is correct |
5 |
Correct |
875 ms |
30780 KB |
Output is correct |
6 |
Correct |
988 ms |
47368 KB |
Output is correct |
7 |
Correct |
795 ms |
38488 KB |
Output is correct |
8 |
Correct |
1022 ms |
47464 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
9816 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
9816 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
9816 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
9816 KB |
Output is correct |
2 |
Correct |
2 ms |
7768 KB |
Output is correct |
3 |
Correct |
2 ms |
7768 KB |
Output is correct |
4 |
Incorrect |
185 ms |
29988 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
9816 KB |
Output is correct |
2 |
Correct |
2 ms |
7768 KB |
Output is correct |
3 |
Correct |
2 ms |
7768 KB |
Output is correct |
4 |
Incorrect |
185 ms |
29988 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
9816 KB |
Output is correct |
2 |
Correct |
2 ms |
9912 KB |
Output is correct |
3 |
Correct |
153 ms |
41576 KB |
Output is correct |
4 |
Correct |
978 ms |
47448 KB |
Output is correct |
5 |
Correct |
875 ms |
30780 KB |
Output is correct |
6 |
Correct |
988 ms |
47368 KB |
Output is correct |
7 |
Correct |
795 ms |
38488 KB |
Output is correct |
8 |
Correct |
1022 ms |
47464 KB |
Output is correct |
9 |
Incorrect |
2 ms |
9816 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |