Submission #979438

# Submission time Handle Problem Language Result Execution time Memory
979438 2024-05-11T00:42:48 Z vjudge1 Rainforest Jumps (APIO21_jumps) C++17
27 / 100
865 ms 47536 KB
#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;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 9988 KB Output is correct
2 Correct 2 ms 9816 KB Output is correct
3 Correct 126 ms 41672 KB Output is correct
4 Correct 843 ms 47300 KB Output is correct
5 Correct 739 ms 30856 KB Output is correct
6 Correct 824 ms 47292 KB Output is correct
7 Correct 604 ms 38580 KB Output is correct
8 Correct 835 ms 47476 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 9816 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 9816 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 9816 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 Correct 153 ms 30040 KB Output is correct
5 Correct 658 ms 46524 KB Output is correct
6 Correct 401 ms 17496 KB Output is correct
7 Correct 683 ms 46864 KB Output is correct
8 Correct 403 ms 25092 KB Output is correct
9 Correct 636 ms 46524 KB Output is correct
10 Correct 809 ms 47452 KB Output is correct
11 Correct 725 ms 46780 KB Output is correct
12 Correct 790 ms 47136 KB Output is correct
13 Correct 664 ms 46512 KB Output is correct
14 Correct 777 ms 46928 KB Output is correct
15 Correct 646 ms 47284 KB Output is correct
16 Correct 680 ms 47400 KB Output is correct
17 Correct 2 ms 9816 KB Output is correct
18 Correct 2 ms 9676 KB Output is correct
19 Correct 2 ms 9816 KB Output is correct
20 Correct 3 ms 9816 KB Output is correct
21 Correct 3 ms 9816 KB Output is correct
22 Correct 3 ms 9816 KB Output is correct
23 Correct 4 ms 9816 KB Output is correct
24 Correct 3 ms 9816 KB Output is correct
25 Correct 2 ms 9816 KB Output is correct
26 Correct 2 ms 9816 KB Output is correct
27 Correct 11 ms 10072 KB Output is correct
28 Correct 13 ms 10072 KB Output is correct
29 Correct 12 ms 10072 KB Output is correct
30 Correct 12 ms 10072 KB Output is correct
31 Correct 13 ms 10324 KB Output is correct
32 Correct 2 ms 9816 KB Output is correct
33 Correct 37 ms 32892 KB Output is correct
34 Correct 75 ms 46528 KB Output is correct
35 Correct 64 ms 47292 KB Output is correct
36 Correct 80 ms 46768 KB Output is correct
37 Correct 71 ms 47224 KB Output is correct
38 Correct 70 ms 47236 KB Output is correct
# Verdict Execution time Memory 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 Correct 153 ms 30040 KB Output is correct
5 Correct 658 ms 46524 KB Output is correct
6 Correct 401 ms 17496 KB Output is correct
7 Correct 683 ms 46864 KB Output is correct
8 Correct 403 ms 25092 KB Output is correct
9 Correct 636 ms 46524 KB Output is correct
10 Correct 809 ms 47452 KB Output is correct
11 Correct 725 ms 46780 KB Output is correct
12 Correct 790 ms 47136 KB Output is correct
13 Correct 664 ms 46512 KB Output is correct
14 Correct 777 ms 46928 KB Output is correct
15 Correct 646 ms 47284 KB Output is correct
16 Correct 680 ms 47400 KB Output is correct
17 Correct 2 ms 9816 KB Output is correct
18 Correct 2 ms 9676 KB Output is correct
19 Correct 2 ms 9816 KB Output is correct
20 Correct 3 ms 9816 KB Output is correct
21 Correct 3 ms 9816 KB Output is correct
22 Correct 3 ms 9816 KB Output is correct
23 Correct 4 ms 9816 KB Output is correct
24 Correct 3 ms 9816 KB Output is correct
25 Correct 2 ms 9816 KB Output is correct
26 Correct 2 ms 9816 KB Output is correct
27 Correct 11 ms 10072 KB Output is correct
28 Correct 13 ms 10072 KB Output is correct
29 Correct 12 ms 10072 KB Output is correct
30 Correct 12 ms 10072 KB Output is correct
31 Correct 13 ms 10324 KB Output is correct
32 Correct 2 ms 9816 KB Output is correct
33 Correct 37 ms 32892 KB Output is correct
34 Correct 75 ms 46528 KB Output is correct
35 Correct 64 ms 47292 KB Output is correct
36 Correct 80 ms 46768 KB Output is correct
37 Correct 71 ms 47224 KB Output is correct
38 Correct 70 ms 47236 KB Output is correct
39 Correct 2 ms 9816 KB Output is correct
40 Correct 2 ms 7768 KB Output is correct
41 Correct 2 ms 7768 KB Output is correct
42 Correct 159 ms 30040 KB Output is correct
43 Correct 693 ms 46416 KB Output is correct
44 Correct 422 ms 17460 KB Output is correct
45 Correct 641 ms 46512 KB Output is correct
46 Correct 371 ms 24920 KB Output is correct
47 Correct 653 ms 46672 KB Output is correct
48 Correct 865 ms 47536 KB Output is correct
49 Correct 729 ms 46904 KB Output is correct
50 Correct 856 ms 47364 KB Output is correct
51 Correct 614 ms 46508 KB Output is correct
52 Correct 770 ms 47024 KB Output is correct
53 Correct 695 ms 47288 KB Output is correct
54 Correct 638 ms 47288 KB Output is correct
55 Correct 2 ms 7768 KB Output is correct
56 Incorrect 108 ms 46868 KB Output isn't correct
57 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 3 ms 9988 KB Output is correct
2 Correct 2 ms 9816 KB Output is correct
3 Correct 126 ms 41672 KB Output is correct
4 Correct 843 ms 47300 KB Output is correct
5 Correct 739 ms 30856 KB Output is correct
6 Correct 824 ms 47292 KB Output is correct
7 Correct 604 ms 38580 KB Output is correct
8 Correct 835 ms 47476 KB Output is correct
9 Incorrect 2 ms 9816 KB Output isn't correct
10 Halted 0 ms 0 KB -