oj.uz

Submission #691633

# Submission time Handle Problem Language Result Execution time Memory
691633 2023-01-31T11:01:10 Z Dan4Life Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 1239 ms 71640 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back

const int maxn = (int)2e5+10;
const int maxlg = 24;
const int INF = (int)1e9;

bool increasing;
vector<int> adj[maxn];
int n, h[maxn], dis[maxn], pr[maxn], nx[maxn];
int high[maxlg][maxn], low[maxlg][maxn], gis[maxlg][maxn];

int bfs(int s1, int s2, int d1, int d2){
    queue<int> Q;
    while(!Q.empty()) Q.pop();
    for(int i = 0; i < n; i++) dis[i]=INF;
    for(int i = s1; i <= s2; i++) Q.push(i), dis[i]=0;
    while(!Q.empty()){
        int s = Q.front(); Q.pop();
        if(d1<=s and s<=d2) return dis[s];
        for(auto u : adj[s])
            if(dis[u]==INF)
                dis[u] = dis[s]+1, Q.push(u);
    }
    return -1;
}

void calc(int jmp[][maxn]){
    for(int i = 1; i < maxlg; i++)
        for(int j = 0; j < n; j++)
            if(jmp[i-1][j]!=-1) jmp[i][j] = jmp[i-1][jmp[i-1][j]];
}

void init(int N, vector<int> a) {
    n = N; increasing = 1;
    stack<pair<int,int>> S;
    memset(pr,-1,sizeof(pr));
    memset(nx,-1,sizeof(nx));
    memset(gis,-1,sizeof(gis));
    memset(low,-1,sizeof(low));
    memset(high,-1,sizeof(high));
    for(int i = 0; i < (int)a.size(); i++) h[i]=a[i];
    for(int i = 0; i < n; i++){
        increasing&=(!i or a[i]>=a[i-1]);
        while(!S.empty() and S.top().fi<a[i]) S.pop();
        if(!S.empty()) pr[i] = S.top().se;
        S.push({a[i],i});
    }
    while(!S.empty()) S.pop();
    for(int i = n-1; i>=0; i--){
        while(!S.empty() and S.top().fi<a[i]) S.pop();
        if(!S.empty()) nx[i] = S.top().se;
        S.push({a[i],i});
    }
    while(!S.empty()) S.pop();
    for(int i = 0; i < n; i++){
        if(pr[i]!=-1) adj[i].pb(pr[i]), gis[0][i]=pr[i];
        if(nx[i]!=-1) adj[i].pb(nx[i]);
        if(pr[i]!=-1 and nx[i]!=-1){
            if(a[pr[i]]<a[nx[i]]) swap(pr[i],nx[i]);
            high[0][i] = pr[i]; low[0][i] = nx[i];
            if(a[pr[i]]>a[nx[i]]) swap(pr[i],nx[i]);
        }
        else{
            if(pr[i]!=-1) low[0][i] = pr[i];
            else low[0][i] = nx[i];
        }
    }
    calc(high), calc(low), calc(gis);
}

int get_path(int *x, int y, int jmp[][maxn]){
    int tot = 0;
    for(int i = 20; i >= 0; i--)
        if(jmp[i][*x]!=-1 and h[jmp[i][*x]]<=h[y])
            *x = jmp[i][*x], tot+=(1<<i);
    return tot;
}

int sub5(int x, int y){
    int num1 = get_path(&x,y,high);
    int num2 = get_path(&x,y,low);
    return (h[x]==h[y]?num1+num2:-1);
}

int getBest(int x, int y, int z){
    if(x==y) return x;
    for(int i = 20; i >= 0; i--)
        if(gis[i][y]>=x and h[gis[i][y]]<h[z])
            y = gis[i][y];
    return y;
}

int minimum_jumps(int A, int B, int C, int D) {
    B = getBest(A,B,C);
    D = getBest(C,D,B);
    return sub5(B,D);
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 62868 KB Output is correct
2 Correct 31 ms 62928 KB Output is correct
3 Incorrect 176 ms 69748 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 62820 KB Output is correct
2 Correct 34 ms 62792 KB Output is correct
3 Correct 30 ms 62792 KB Output is correct
4 Correct 27 ms 62928 KB Output is correct
5 Incorrect 27 ms 62904 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 62820 KB Output is correct
2 Correct 34 ms 62792 KB Output is correct
3 Correct 30 ms 62792 KB Output is correct
4 Correct 27 ms 62928 KB Output is correct
5 Incorrect 27 ms 62904 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 62800 KB Output is correct
2 Correct 27 ms 62808 KB Output is correct
3 Correct 30 ms 62832 KB Output is correct
4 Correct 27 ms 62928 KB Output is correct
5 Incorrect 81 ms 69864 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62932 KB Output is correct
2 Correct 25 ms 62928 KB Output is correct
3 Correct 28 ms 62924 KB Output is correct
4 Correct 235 ms 66796 KB Output is correct
5 Correct 861 ms 71428 KB Output is correct
6 Correct 585 ms 64284 KB Output is correct
7 Correct 1008 ms 71524 KB Output is correct
8 Correct 664 ms 65796 KB Output is correct
9 Correct 875 ms 71436 KB Output is correct
10 Correct 772 ms 71568 KB Output is correct
11 Correct 924 ms 71492 KB Output is correct
12 Correct 931 ms 71540 KB Output is correct
13 Correct 930 ms 71552 KB Output is correct
14 Correct 967 ms 71504 KB Output is correct
15 Correct 987 ms 71560 KB Output is correct
16 Correct 780 ms 71552 KB Output is correct
17 Correct 30 ms 62928 KB Output is correct
18 Correct 28 ms 62928 KB Output is correct
19 Correct 27 ms 62928 KB Output is correct
20 Correct 27 ms 62924 KB Output is correct
21 Correct 27 ms 62872 KB Output is correct
22 Correct 28 ms 62856 KB Output is correct
23 Correct 27 ms 62928 KB Output is correct
24 Correct 31 ms 62928 KB Output is correct
25 Correct 27 ms 62868 KB Output is correct
26 Correct 27 ms 62920 KB Output is correct
27 Correct 46 ms 62964 KB Output is correct
28 Correct 42 ms 63008 KB Output is correct
29 Correct 43 ms 62920 KB Output is correct
30 Correct 47 ms 62928 KB Output is correct
31 Correct 48 ms 62980 KB Output is correct
32 Correct 32 ms 62812 KB Output is correct
33 Correct 57 ms 67912 KB Output is correct
34 Correct 81 ms 71532 KB Output is correct
35 Correct 84 ms 71572 KB Output is correct
36 Correct 80 ms 71428 KB Output is correct
37 Correct 83 ms 71456 KB Output is correct
38 Correct 65 ms 71544 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62932 KB Output is correct
2 Correct 25 ms 62928 KB Output is correct
3 Correct 28 ms 62924 KB Output is correct
4 Correct 235 ms 66796 KB Output is correct
5 Correct 861 ms 71428 KB Output is correct
6 Correct 585 ms 64284 KB Output is correct
7 Correct 1008 ms 71524 KB Output is correct
8 Correct 664 ms 65796 KB Output is correct
9 Correct 875 ms 71436 KB Output is correct
10 Correct 772 ms 71568 KB Output is correct
11 Correct 924 ms 71492 KB Output is correct
12 Correct 931 ms 71540 KB Output is correct
13 Correct 930 ms 71552 KB Output is correct
14 Correct 967 ms 71504 KB Output is correct
15 Correct 987 ms 71560 KB Output is correct
16 Correct 780 ms 71552 KB Output is correct
17 Correct 30 ms 62928 KB Output is correct
18 Correct 28 ms 62928 KB Output is correct
19 Correct 27 ms 62928 KB Output is correct
20 Correct 27 ms 62924 KB Output is correct
21 Correct 27 ms 62872 KB Output is correct
22 Correct 28 ms 62856 KB Output is correct
23 Correct 27 ms 62928 KB Output is correct
24 Correct 31 ms 62928 KB Output is correct
25 Correct 27 ms 62868 KB Output is correct
26 Correct 27 ms 62920 KB Output is correct
27 Correct 46 ms 62964 KB Output is correct
28 Correct 42 ms 63008 KB Output is correct
29 Correct 43 ms 62920 KB Output is correct
30 Correct 47 ms 62928 KB Output is correct
31 Correct 48 ms 62980 KB Output is correct
32 Correct 32 ms 62812 KB Output is correct
33 Correct 57 ms 67912 KB Output is correct
34 Correct 81 ms 71532 KB Output is correct
35 Correct 84 ms 71572 KB Output is correct
36 Correct 80 ms 71428 KB Output is correct
37 Correct 83 ms 71456 KB Output is correct
38 Correct 65 ms 71544 KB Output is correct
39 Correct 24 ms 62928 KB Output is correct
40 Correct 25 ms 62856 KB Output is correct
41 Correct 25 ms 62844 KB Output is correct
42 Correct 284 ms 66820 KB Output is correct
43 Correct 1032 ms 71640 KB Output is correct
44 Correct 689 ms 64272 KB Output is correct
45 Correct 806 ms 71444 KB Output is correct
46 Correct 353 ms 65828 KB Output is correct
47 Correct 773 ms 71420 KB Output is correct
48 Correct 1000 ms 71544 KB Output is correct
49 Correct 1091 ms 71492 KB Output is correct
50 Correct 887 ms 71572 KB Output is correct
51 Correct 1026 ms 71480 KB Output is correct
52 Correct 991 ms 71452 KB Output is correct
53 Correct 853 ms 71560 KB Output is correct
54 Correct 995 ms 71556 KB Output is correct
55 Correct 29 ms 62916 KB Output is correct
56 Correct 142 ms 71504 KB Output is correct
57 Correct 1002 ms 71436 KB Output is correct
58 Correct 480 ms 64404 KB Output is correct
59 Correct 1053 ms 71536 KB Output is correct
60 Correct 453 ms 65864 KB Output is correct
61 Correct 1057 ms 71616 KB Output is correct
62 Correct 1070 ms 71560 KB Output is correct
63 Correct 978 ms 71588 KB Output is correct
64 Correct 959 ms 71556 KB Output is correct
65 Correct 953 ms 71412 KB Output is correct
66 Correct 983 ms 71520 KB Output is correct
67 Correct 1136 ms 71560 KB Output is correct
68 Correct 1239 ms 71556 KB Output is correct
69 Correct 28 ms 62916 KB Output is correct
70 Correct 27 ms 62928 KB Output is correct
71 Correct 27 ms 62920 KB Output is correct
72 Correct 27 ms 62932 KB Output is correct
73 Correct 28 ms 62900 KB Output is correct
74 Correct 28 ms 62904 KB Output is correct
75 Correct 31 ms 62904 KB Output is correct
76 Correct 27 ms 62928 KB Output is correct
77 Correct 26 ms 62920 KB Output is correct
78 Correct 29 ms 62928 KB Output is correct
79 Correct 31 ms 62844 KB Output is correct
80 Correct 28 ms 62860 KB Output is correct
81 Correct 31 ms 62928 KB Output is correct
82 Correct 28 ms 62900 KB Output is correct
83 Correct 32 ms 62828 KB Output is correct
84 Correct 26 ms 62928 KB Output is correct
85 Correct 32 ms 62828 KB Output is correct
86 Correct 42 ms 62904 KB Output is correct
87 Correct 46 ms 62920 KB Output is correct
88 Correct 45 ms 62944 KB Output is correct
89 Correct 46 ms 62928 KB Output is correct
90 Correct 46 ms 62920 KB Output is correct
91 Correct 26 ms 62928 KB Output is correct
92 Correct 27 ms 62904 KB Output is correct
93 Correct 44 ms 62928 KB Output is correct
94 Correct 40 ms 62984 KB Output is correct
95 Correct 48 ms 62928 KB Output is correct
96 Correct 50 ms 62960 KB Output is correct
97 Correct 47 ms 62976 KB Output is correct
98 Correct 24 ms 62916 KB Output is correct
99 Correct 96 ms 71444 KB Output is correct
100 Correct 94 ms 71536 KB Output is correct
101 Correct 67 ms 71556 KB Output is correct
102 Correct 103 ms 71412 KB Output is correct
103 Correct 72 ms 71472 KB Output is correct
104 Correct 65 ms 71496 KB Output is correct
105 Correct 23 ms 62928 KB Output is correct
106 Correct 55 ms 67844 KB Output is correct
107 Correct 81 ms 71416 KB Output is correct
108 Correct 88 ms 71580 KB Output is correct
109 Correct 89 ms 71540 KB Output is correct
110 Correct 88 ms 71512 KB Output is correct
111 Correct 70 ms 71528 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 62868 KB Output is correct
2 Correct 31 ms 62928 KB Output is correct
3 Incorrect 176 ms 69748 KB Output isn't correct
4 Halted 0 ms 0 KB -