oj.uz

답안 #489099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489099 2021-11-21T07:35:03 Z Theo830 밀림 점프 (APIO21_jumps) C++17
48 / 100
 1178 ms 113928 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 = B;
    for(ll j = 19;j >= 0;j--){
        if(l[s][j] != INF && A <= l[s][j] && arr[l[s][j]] < arr[C]){
            s = l[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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 229 ms 90636 KB Output is correct
4 Correct 1163 ms 113804 KB Output is correct
5 Correct 1025 ms 57384 KB Output is correct
6 Correct 1037 ms 113700 KB Output is correct
7 Correct 950 ms 77740 KB Output is correct
8 Correct 1158 ms 113704 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 314 ms 50756 KB Output is correct
5 Correct 1028 ms 110784 KB Output is correct
6 Correct 546 ms 18504 KB Output is correct
7 Correct 1070 ms 110744 KB Output is correct
8 Correct 669 ms 38208 KB Output is correct
9 Correct 1055 ms 110744 KB Output is correct
10 Correct 1140 ms 113784 KB Output is correct
11 Correct 1155 ms 113544 KB Output is correct
12 Correct 1127 ms 113292 KB Output is correct
13 Correct 1008 ms 110752 KB Output is correct
14 Correct 884 ms 112248 KB Output is correct
15 Correct 878 ms 113800 KB Output is correct
16 Correct 1004 ms 113696 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 712 KB Output is correct
27 Correct 17 ms 1352 KB Output is correct
28 Correct 20 ms 1352 KB Output is correct
29 Correct 17 ms 1352 KB Output is correct
30 Correct 21 ms 1352 KB Output is correct
31 Correct 15 ms 1352 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 104 ms 64156 KB Output is correct
34 Correct 187 ms 110672 KB Output is correct
35 Correct 171 ms 113328 KB Output is correct
36 Correct 173 ms 110644 KB Output is correct
37 Correct 212 ms 112176 KB Output is correct
38 Correct 180 ms 113804 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 314 ms 50756 KB Output is correct
5 Correct 1028 ms 110784 KB Output is correct
6 Correct 546 ms 18504 KB Output is correct
7 Correct 1070 ms 110744 KB Output is correct
8 Correct 669 ms 38208 KB Output is correct
9 Correct 1055 ms 110744 KB Output is correct
10 Correct 1140 ms 113784 KB Output is correct
11 Correct 1155 ms 113544 KB Output is correct
12 Correct 1127 ms 113292 KB Output is correct
13 Correct 1008 ms 110752 KB Output is correct
14 Correct 884 ms 112248 KB Output is correct
15 Correct 878 ms 113800 KB Output is correct
16 Correct 1004 ms 113696 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 712 KB Output is correct
27 Correct 17 ms 1352 KB Output is correct
28 Correct 20 ms 1352 KB Output is correct
29 Correct 17 ms 1352 KB Output is correct
30 Correct 21 ms 1352 KB Output is correct
31 Correct 15 ms 1352 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 104 ms 64156 KB Output is correct
34 Correct 187 ms 110672 KB Output is correct
35 Correct 171 ms 113328 KB Output is correct
36 Correct 173 ms 110644 KB Output is correct
37 Correct 212 ms 112176 KB Output is correct
38 Correct 180 ms 113804 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 0 ms 328 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 304 ms 50768 KB Output is correct
43 Correct 1143 ms 110656 KB Output is correct
44 Correct 691 ms 18472 KB Output is correct
45 Correct 963 ms 110656 KB Output is correct
46 Correct 508 ms 38336 KB Output is correct
47 Correct 1105 ms 110608 KB Output is correct
48 Correct 1141 ms 113716 KB Output is correct
49 Correct 1098 ms 113576 KB Output is correct
50 Correct 1098 ms 113372 KB Output is correct
51 Correct 1062 ms 110656 KB Output is correct
52 Correct 1168 ms 112176 KB Output is correct
53 Correct 1004 ms 113808 KB Output is correct
54 Correct 1090 ms 113804 KB Output is correct
55 Correct 0 ms 328 KB Output is correct
56 Correct 222 ms 110116 KB Output is correct
57 Correct 1067 ms 110708 KB Output is correct
58 Correct 413 ms 19672 KB Output is correct
59 Correct 1144 ms 110776 KB Output is correct
60 Correct 427 ms 39488 KB Output is correct
61 Correct 1042 ms 110656 KB Output is correct
62 Correct 1153 ms 113792 KB Output is correct
63 Correct 1165 ms 113192 KB Output is correct
64 Correct 1133 ms 112560 KB Output is correct
65 Correct 1158 ms 110612 KB Output is correct
66 Correct 1178 ms 112140 KB Output is correct
67 Correct 777 ms 113700 KB Output is correct
68 Correct 1014 ms 113704 KB Output is correct
69 Correct 0 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 2 ms 328 KB Output is correct
72 Correct 3 ms 328 KB Output is correct
73 Correct 2 ms 328 KB Output is correct
74 Correct 2 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 0 ms 328 KB Output is correct
77 Correct 1 ms 328 KB Output is correct
78 Correct 1 ms 328 KB Output is correct
79 Correct 2 ms 328 KB Output is correct
80 Correct 2 ms 328 KB Output is correct
81 Correct 2 ms 328 KB Output is correct
82 Correct 2 ms 328 KB Output is correct
83 Correct 2 ms 328 KB Output is correct
84 Correct 0 ms 328 KB Output is correct
85 Correct 3 ms 456 KB Output is correct
86 Correct 24 ms 1352 KB Output is correct
87 Correct 24 ms 1352 KB Output is correct
88 Correct 21 ms 1352 KB Output is correct
89 Correct 22 ms 1352 KB Output is correct
90 Correct 22 ms 1352 KB Output is correct
91 Correct 0 ms 328 KB Output is correct
92 Correct 1 ms 712 KB Output is correct
93 Correct 21 ms 1352 KB Output is correct
94 Correct 9 ms 1476 KB Output is correct
95 Correct 17 ms 1352 KB Output is correct
96 Correct 21 ms 1352 KB Output is correct
97 Correct 21 ms 1456 KB Output is correct
98 Correct 0 ms 328 KB Output is correct
99 Correct 171 ms 110444 KB Output is correct
100 Correct 178 ms 110668 KB Output is correct
101 Correct 185 ms 113064 KB Output is correct
102 Correct 210 ms 110668 KB Output is correct
103 Correct 228 ms 112248 KB Output is correct
104 Correct 178 ms 113928 KB Output is correct
105 Correct 0 ms 328 KB Output is correct
106 Correct 100 ms 64216 KB Output is correct
107 Correct 173 ms 110612 KB Output is correct
108 Correct 183 ms 113196 KB Output is correct
109 Correct 182 ms 110644 KB Output is correct
110 Correct 220 ms 112176 KB Output is correct
111 Correct 177 ms 113808 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 229 ms 90636 KB Output is correct
4 Correct 1163 ms 113804 KB Output is correct
5 Correct 1025 ms 57384 KB Output is correct
6 Correct 1037 ms 113700 KB Output is correct
7 Correct 950 ms 77740 KB Output is correct
8 Correct 1158 ms 113704 KB Output is correct
9 Incorrect 0 ms 328 KB Output isn't correct
10 Halted 0 ms 0 KB -