oj.uz

Submission #691636

# Submission time Handle Problem Language Result Execution time Memory
691636 2023-01-31T11:03:11 Z Dan4Life Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 1458 ms 71624 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]; h[n]=INF;
    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) {
    D = getBest(C,D,n);
    B = getBest(A,B,D);
    return sub5(B,D);
}

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:46:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   46 |     for(int i = 0; i < (int)a.size(); i++) h[i]=a[i]; h[n]=INF;
      |     ^~~
jumps.cpp:46:55: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   46 |     for(int i = 0; i < (int)a.size(); i++) h[i]=a[i]; h[n]=INF;
      |                                                       ^

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 62884 KB Output is correct
2 Correct 26 ms 62796 KB Output is correct
3 Incorrect 197 ms 69752 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 62868 KB Output is correct
2 Correct 28 ms 62820 KB Output is correct
3 Correct 29 ms 62960 KB Output is correct
4 Correct 35 ms 62940 KB Output is correct
5 Incorrect 26 ms 62960 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 62868 KB Output is correct
2 Correct 28 ms 62820 KB Output is correct
3 Correct 29 ms 62960 KB Output is correct
4 Correct 35 ms 62940 KB Output is correct
5 Incorrect 26 ms 62960 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 62836 KB Output is correct
2 Correct 29 ms 62900 KB Output is correct
3 Correct 29 ms 62820 KB Output is correct
4 Correct 26 ms 62928 KB Output is correct
5 Correct 73 ms 69744 KB Output is correct
6 Correct 101 ms 71544 KB Output is correct
7 Correct 65 ms 67236 KB Output is correct
8 Correct 109 ms 71448 KB Output is correct
9 Correct 47 ms 64248 KB Output is correct
10 Correct 88 ms 71460 KB Output is correct
11 Incorrect 99 ms 71552 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 62824 KB Output is correct
2 Correct 27 ms 62960 KB Output is correct
3 Correct 33 ms 62860 KB Output is correct
4 Correct 288 ms 66796 KB Output is correct
5 Correct 1097 ms 71544 KB Output is correct
6 Correct 608 ms 64260 KB Output is correct
7 Correct 1092 ms 71508 KB Output is correct
8 Correct 650 ms 65860 KB Output is correct
9 Correct 1037 ms 71512 KB Output is correct
10 Correct 1178 ms 71468 KB Output is correct
11 Correct 965 ms 71468 KB Output is correct
12 Correct 1132 ms 71544 KB Output is correct
13 Correct 1014 ms 71496 KB Output is correct
14 Correct 1409 ms 71488 KB Output is correct
15 Correct 942 ms 71560 KB Output is correct
16 Correct 1302 ms 71572 KB Output is correct
17 Correct 29 ms 62828 KB Output is correct
18 Correct 29 ms 62920 KB Output is correct
19 Correct 27 ms 62932 KB Output is correct
20 Correct 28 ms 62920 KB Output is correct
21 Correct 28 ms 62868 KB Output is correct
22 Correct 26 ms 62908 KB Output is correct
23 Correct 26 ms 62928 KB Output is correct
24 Correct 28 ms 62852 KB Output is correct
25 Correct 24 ms 62928 KB Output is correct
26 Correct 26 ms 62928 KB Output is correct
27 Correct 42 ms 62964 KB Output is correct
28 Correct 47 ms 62996 KB Output is correct
29 Correct 39 ms 62916 KB Output is correct
30 Correct 37 ms 62960 KB Output is correct
31 Correct 40 ms 63000 KB Output is correct
32 Correct 31 ms 62868 KB Output is correct
33 Correct 91 ms 67912 KB Output is correct
34 Correct 82 ms 71540 KB Output is correct
35 Correct 73 ms 71552 KB Output is correct
36 Correct 103 ms 71432 KB Output is correct
37 Correct 90 ms 71624 KB Output is correct
38 Correct 75 ms 71504 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 62824 KB Output is correct
2 Correct 27 ms 62960 KB Output is correct
3 Correct 33 ms 62860 KB Output is correct
4 Correct 288 ms 66796 KB Output is correct
5 Correct 1097 ms 71544 KB Output is correct
6 Correct 608 ms 64260 KB Output is correct
7 Correct 1092 ms 71508 KB Output is correct
8 Correct 650 ms 65860 KB Output is correct
9 Correct 1037 ms 71512 KB Output is correct
10 Correct 1178 ms 71468 KB Output is correct
11 Correct 965 ms 71468 KB Output is correct
12 Correct 1132 ms 71544 KB Output is correct
13 Correct 1014 ms 71496 KB Output is correct
14 Correct 1409 ms 71488 KB Output is correct
15 Correct 942 ms 71560 KB Output is correct
16 Correct 1302 ms 71572 KB Output is correct
17 Correct 29 ms 62828 KB Output is correct
18 Correct 29 ms 62920 KB Output is correct
19 Correct 27 ms 62932 KB Output is correct
20 Correct 28 ms 62920 KB Output is correct
21 Correct 28 ms 62868 KB Output is correct
22 Correct 26 ms 62908 KB Output is correct
23 Correct 26 ms 62928 KB Output is correct
24 Correct 28 ms 62852 KB Output is correct
25 Correct 24 ms 62928 KB Output is correct
26 Correct 26 ms 62928 KB Output is correct
27 Correct 42 ms 62964 KB Output is correct
28 Correct 47 ms 62996 KB Output is correct
29 Correct 39 ms 62916 KB Output is correct
30 Correct 37 ms 62960 KB Output is correct
31 Correct 40 ms 63000 KB Output is correct
32 Correct 31 ms 62868 KB Output is correct
33 Correct 91 ms 67912 KB Output is correct
34 Correct 82 ms 71540 KB Output is correct
35 Correct 73 ms 71552 KB Output is correct
36 Correct 103 ms 71432 KB Output is correct
37 Correct 90 ms 71624 KB Output is correct
38 Correct 75 ms 71504 KB Output is correct
39 Correct 30 ms 62804 KB Output is correct
40 Correct 34 ms 62816 KB Output is correct
41 Correct 29 ms 62860 KB Output is correct
42 Correct 292 ms 67072 KB Output is correct
43 Correct 827 ms 71616 KB Output is correct
44 Correct 690 ms 64316 KB Output is correct
45 Correct 945 ms 71448 KB Output is correct
46 Correct 677 ms 65864 KB Output is correct
47 Correct 971 ms 71428 KB Output is correct
48 Correct 1077 ms 71556 KB Output is correct
49 Correct 1159 ms 71484 KB Output is correct
50 Correct 1016 ms 71556 KB Output is correct
51 Correct 1008 ms 71428 KB Output is correct
52 Correct 1082 ms 71480 KB Output is correct
53 Correct 907 ms 71552 KB Output is correct
54 Correct 678 ms 71624 KB Output is correct
55 Correct 27 ms 62856 KB Output is correct
56 Correct 138 ms 71424 KB Output is correct
57 Correct 1014 ms 71536 KB Output is correct
58 Correct 386 ms 64336 KB Output is correct
59 Correct 957 ms 71440 KB Output is correct
60 Correct 471 ms 65988 KB Output is correct
61 Correct 974 ms 71444 KB Output is correct
62 Correct 1121 ms 71496 KB Output is correct
63 Correct 1081 ms 71508 KB Output is correct
64 Correct 928 ms 71556 KB Output is correct
65 Correct 1095 ms 71428 KB Output is correct
66 Correct 1458 ms 71456 KB Output is correct
67 Correct 1214 ms 71544 KB Output is correct
68 Correct 1190 ms 71452 KB Output is correct
69 Correct 24 ms 62856 KB Output is correct
70 Correct 29 ms 62884 KB Output is correct
71 Correct 37 ms 62848 KB Output is correct
72 Correct 30 ms 62828 KB Output is correct
73 Correct 31 ms 63012 KB Output is correct
74 Correct 31 ms 62912 KB Output is correct
75 Correct 35 ms 62812 KB Output is correct
76 Correct 27 ms 62928 KB Output is correct
77 Correct 30 ms 62904 KB Output is correct
78 Correct 31 ms 62896 KB Output is correct
79 Correct 30 ms 62808 KB Output is correct
80 Correct 28 ms 62912 KB Output is correct
81 Correct 27 ms 62876 KB Output is correct
82 Correct 32 ms 62888 KB Output is correct
83 Correct 28 ms 62920 KB Output is correct
84 Correct 27 ms 62920 KB Output is correct
85 Correct 35 ms 62920 KB Output is correct
86 Correct 45 ms 62928 KB Output is correct
87 Correct 43 ms 62952 KB Output is correct
88 Correct 45 ms 62928 KB Output is correct
89 Correct 35 ms 62912 KB Output is correct
90 Correct 47 ms 62952 KB Output is correct
91 Correct 25 ms 62896 KB Output is correct
92 Correct 28 ms 62904 KB Output is correct
93 Correct 52 ms 62936 KB Output is correct
94 Correct 45 ms 62948 KB Output is correct
95 Correct 49 ms 62992 KB Output is correct
96 Correct 44 ms 62928 KB Output is correct
97 Correct 45 ms 62996 KB Output is correct
98 Correct 26 ms 62848 KB Output is correct
99 Correct 92 ms 71408 KB Output is correct
100 Correct 81 ms 71448 KB Output is correct
101 Correct 71 ms 71452 KB Output is correct
102 Correct 90 ms 71460 KB Output is correct
103 Correct 88 ms 71456 KB Output is correct
104 Correct 83 ms 71480 KB Output is correct
105 Correct 29 ms 62916 KB Output is correct
106 Correct 57 ms 67844 KB Output is correct
107 Correct 98 ms 71548 KB Output is correct
108 Correct 81 ms 71568 KB Output is correct
109 Correct 81 ms 71456 KB Output is correct
110 Correct 81 ms 71460 KB Output is correct
111 Correct 77 ms 71576 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 62884 KB Output is correct
2 Correct 26 ms 62796 KB Output is correct
3 Incorrect 197 ms 69752 KB Output isn't correct
4 Halted 0 ms 0 KB -