oj.uz

Submission #489077

# Submission time Handle Problem Language Result Execution time Memory
489077 2021-11-21T07:08:02 Z Theo830 Rainforest Jumps (APIO21_jumps) C++17
27 / 100
 1374 ms 113836 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///APIO 2021 vc
//#include "jumps.h"
vector<vector<ll> >adj;
ll L[200005],R[200005];
ll l[200005][20],r[200005][20];
ll maxi[200005][20];
vector<int>arr;
ll n;
void init(int N, std::vector<int> H){
    n = N;
    arr = H;
    priority_queue<ii>pq;
    f(i,0,N){
        L[i] = R[i] = INF;
    }
    f(i,0,N){
        while(!pq.empty() && -pq.top().F < H[i]){
            R[pq.top().S] = i;
            pq.pop();
        }
        pq.push(ii(-H[i],i));
    }
    while(!pq.empty()){
        pq.pop();
    }
    for(ll i = N-1;i >= 0;i--){
        while(!pq.empty() && -pq.top().F < H[i]){
            L[pq.top().S] = i;
            pq.pop();
        }
        pq.push(ii(-H[i],i));
    }
    adj.assign(N+5,vll());
    f(i,0,N){
        if(L[i] != INF){
            adj[i].pb(L[i]);
        }
        if(R[i] != INF){
            adj[i].pb(R[i]);
        }
    }
    f(i,0,N){
        l[i][0] = L[i];
        r[i][0] = R[i];
        if(max(L[i],R[i]) == INF){
            maxi[i][0] = INF;
        }
        else if(H[L[i]] > H[R[i]]){
            maxi[i][0] = L[i];
        }
        else{
            maxi[i][0] = R[i];
        }
    }
    f(j,1,20){
        f(i,0,N){
            if(l[i][j-1] == INF){
                l[i][j] = INF;
            }
            else{
                l[i][j] = l[l[i][j-1]][j-1];
            }
            if(r[i][j-1] == INF){
                r[i][j] = INF;
            }
            else{
                r[i][j] = r[r[i][j-1]][j-1];
            }
            ll v = maxi[i][j-1];
            if(v == INF || maxi[v][j-1] == INF){
                maxi[i][j] = INF;
            }
            else{
                maxi[i][j] = maxi[v][j-1];
            }
        }
    }
}
int minimum_jumps(int A, int B, int C, int D) {
    ll s = A;
    for(ll j = 19;j >= 0;j--){
        if(r[s][j] <= B && arr[r[s][j]] <= arr[C]){
            s = r[s][j];
        }
    }
    ///C = D
    ll ans = 0;
    for(ll j = 19;j >= 0;j--){
        if(maxi[s][j] != INF && arr[maxi[s][j]] <= arr[C]){
            s = maxi[s][j];
            ans += (1LL<<j);
        }
    }
    assert(s != INF);
    if(L[s] != INF && arr[L[s]] <= arr[C]){
        for(ll j = 19;j >= 0;j--){
            if(l[s][j] != INF && arr[l[s][j]] <= arr[C]){
                ans += (1LL<<j);
                s = l[s][j];
            }
        }
    }
    if(R[s] != INF && arr[R[s]] <= arr[C]){
        for(ll j = 19;j >= 0;j--){
            if(r[s][j] != INF && arr[r[s][j]] <= arr[C]){
                ans += (1LL<<j);
                s = r[s][j];
            }
        }
    }
    if(s != C){
        ans = -1;
    }
    return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 196 ms 90624 KB Output is correct
4 Correct 1327 ms 113804 KB Output is correct
5 Correct 985 ms 57384 KB Output is correct
6 Correct 1248 ms 113764 KB Output is correct
7 Correct 1097 ms 77836 KB Output is correct
8 Correct 1374 ms 113836 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 301 ms 50712 KB Output is correct
5 Correct 1204 ms 110772 KB Output is correct
6 Correct 727 ms 18504 KB Output is correct
7 Correct 992 ms 110740 KB Output is correct
8 Correct 591 ms 38216 KB Output is correct
9 Correct 925 ms 110660 KB Output is correct
10 Correct 1189 ms 113808 KB Output is correct
11 Correct 1193 ms 113532 KB Output is correct
12 Correct 1099 ms 113284 KB Output is correct
13 Correct 1082 ms 110656 KB Output is correct
14 Correct 1224 ms 112248 KB Output is correct
15 Correct 1056 ms 113808 KB Output is correct
16 Correct 1045 ms 113808 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 712 KB Output is correct
27 Correct 25 ms 1352 KB Output is correct
28 Correct 26 ms 1452 KB Output is correct
29 Correct 16 ms 1352 KB Output is correct
30 Correct 19 ms 1352 KB Output is correct
31 Correct 17 ms 1456 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 102 ms 64152 KB Output is correct
34 Correct 183 ms 110668 KB Output is correct
35 Correct 170 ms 113312 KB Output is correct
36 Correct 188 ms 110672 KB Output is correct
37 Correct 226 ms 112272 KB Output is correct
38 Correct 181 ms 113808 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 301 ms 50712 KB Output is correct
5 Correct 1204 ms 110772 KB Output is correct
6 Correct 727 ms 18504 KB Output is correct
7 Correct 992 ms 110740 KB Output is correct
8 Correct 591 ms 38216 KB Output is correct
9 Correct 925 ms 110660 KB Output is correct
10 Correct 1189 ms 113808 KB Output is correct
11 Correct 1193 ms 113532 KB Output is correct
12 Correct 1099 ms 113284 KB Output is correct
13 Correct 1082 ms 110656 KB Output is correct
14 Correct 1224 ms 112248 KB Output is correct
15 Correct 1056 ms 113808 KB Output is correct
16 Correct 1045 ms 113808 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 712 KB Output is correct
27 Correct 25 ms 1352 KB Output is correct
28 Correct 26 ms 1452 KB Output is correct
29 Correct 16 ms 1352 KB Output is correct
30 Correct 19 ms 1352 KB Output is correct
31 Correct 17 ms 1456 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 102 ms 64152 KB Output is correct
34 Correct 183 ms 110668 KB Output is correct
35 Correct 170 ms 113312 KB Output is correct
36 Correct 188 ms 110672 KB Output is correct
37 Correct 226 ms 112272 KB Output is correct
38 Correct 181 ms 113808 KB Output is correct
39 Correct 0 ms 328 KB Output is correct
40 Correct 0 ms 328 KB Output is correct
41 Correct 0 ms 328 KB Output is correct
42 Correct 303 ms 50716 KB Output is correct
43 Correct 1046 ms 110668 KB Output is correct
44 Correct 649 ms 18512 KB Output is correct
45 Correct 1133 ms 110648 KB Output is correct
46 Correct 623 ms 38204 KB Output is correct
47 Correct 991 ms 110776 KB Output is correct
48 Correct 1141 ms 113816 KB Output is correct
49 Correct 1087 ms 113548 KB Output is correct
50 Correct 1137 ms 113324 KB Output is correct
51 Correct 805 ms 110732 KB Output is correct
52 Correct 791 ms 112184 KB Output is correct
53 Correct 1058 ms 113832 KB Output is correct
54 Correct 1103 ms 113796 KB Output is correct
55 Correct 0 ms 328 KB Output is correct
56 Incorrect 241 ms 110124 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 196 ms 90624 KB Output is correct
4 Correct 1327 ms 113804 KB Output is correct
5 Correct 985 ms 57384 KB Output is correct
6 Correct 1248 ms 113764 KB Output is correct
7 Correct 1097 ms 77836 KB Output is correct
8 Correct 1374 ms 113836 KB Output is correct
9 Incorrect 0 ms 328 KB Output isn't correct
10 Halted 0 ms 0 KB -