oj.uz

답안 #489083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489083 2021-11-21T07:20:20 Z Theo830 밀림 점프 (APIO21_jumps) C++17
27 / 100
 1400 ms 146692 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 R2[200005];
ll r2[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] = R2[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]);
        }
    }
    while(!pq.empty()){
        pq.pop();
    }
    f(i,0,N){
        while(!pq.empty() && -pq.top().F < -H[i]){
            R2[pq.top().S] = i;
            pq.pop();
        }
        pq.push(ii(H[i],i));
    }
    f(i,0,N){
        l[i][0] = L[i];
        r[i][0] = R[i];
        r2[i][0] = R2[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(r2[i][j-1] == INF){
                r2[i][j] = INF;
            }
            else{
                r2[i][j] = r2[r2[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(r2[s][j] <= B && arr[r2[s][j]] > arr[C]){
            s = r2[s][j];
        }
    }
    if(r2[s][0] <= B){
        s = r2[s][0];
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 297 ms 116780 KB Output is correct
4 Correct 1400 ms 146580 KB Output is correct
5 Correct 1178 ms 73980 KB Output is correct
6 Correct 1370 ms 146684 KB Output is correct
7 Correct 1107 ms 100268 KB Output is correct
8 Correct 1399 ms 146568 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 1 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 341 ms 65696 KB Output is correct
5 Correct 888 ms 143560 KB Output is correct
6 Correct 761 ms 23944 KB Output is correct
7 Correct 1173 ms 143544 KB Output is correct
8 Correct 717 ms 49604 KB Output is correct
9 Correct 1099 ms 143544 KB Output is correct
10 Correct 1217 ms 146688 KB Output is correct
11 Correct 1223 ms 146500 KB Output is correct
12 Correct 1213 ms 146168 KB Output is correct
13 Correct 1088 ms 143680 KB Output is correct
14 Correct 1318 ms 145120 KB Output is correct
15 Correct 1042 ms 146568 KB Output is correct
16 Correct 1064 ms 146676 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 456 KB Output is correct
21 Correct 2 ms 456 KB Output is correct
22 Correct 3 ms 456 KB Output is correct
23 Correct 2 ms 456 KB Output is correct
24 Correct 2 ms 456 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 1 ms 840 KB Output is correct
27 Correct 20 ms 1736 KB Output is correct
28 Correct 16 ms 1736 KB Output is correct
29 Correct 20 ms 1736 KB Output is correct
30 Correct 24 ms 1736 KB Output is correct
31 Correct 22 ms 1728 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 132 ms 83128 KB Output is correct
34 Correct 226 ms 143544 KB Output is correct
35 Correct 251 ms 146204 KB Output is correct
36 Correct 218 ms 143552 KB Output is correct
37 Correct 258 ms 145044 KB Output is correct
38 Correct 242 ms 146684 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 341 ms 65696 KB Output is correct
5 Correct 888 ms 143560 KB Output is correct
6 Correct 761 ms 23944 KB Output is correct
7 Correct 1173 ms 143544 KB Output is correct
8 Correct 717 ms 49604 KB Output is correct
9 Correct 1099 ms 143544 KB Output is correct
10 Correct 1217 ms 146688 KB Output is correct
11 Correct 1223 ms 146500 KB Output is correct
12 Correct 1213 ms 146168 KB Output is correct
13 Correct 1088 ms 143680 KB Output is correct
14 Correct 1318 ms 145120 KB Output is correct
15 Correct 1042 ms 146568 KB Output is correct
16 Correct 1064 ms 146676 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 456 KB Output is correct
21 Correct 2 ms 456 KB Output is correct
22 Correct 3 ms 456 KB Output is correct
23 Correct 2 ms 456 KB Output is correct
24 Correct 2 ms 456 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 1 ms 840 KB Output is correct
27 Correct 20 ms 1736 KB Output is correct
28 Correct 16 ms 1736 KB Output is correct
29 Correct 20 ms 1736 KB Output is correct
30 Correct 24 ms 1736 KB Output is correct
31 Correct 22 ms 1728 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 132 ms 83128 KB Output is correct
34 Correct 226 ms 143544 KB Output is correct
35 Correct 251 ms 146204 KB Output is correct
36 Correct 218 ms 143552 KB Output is correct
37 Correct 258 ms 145044 KB Output is correct
38 Correct 242 ms 146684 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 227 ms 65680 KB Output is correct
43 Correct 1150 ms 143424 KB Output is correct
44 Correct 624 ms 23932 KB Output is correct
45 Correct 1242 ms 143536 KB Output is correct
46 Correct 569 ms 49608 KB Output is correct
47 Correct 1157 ms 143544 KB Output is correct
48 Correct 1069 ms 146604 KB Output is correct
49 Correct 1103 ms 146436 KB Output is correct
50 Correct 1143 ms 146256 KB Output is correct
51 Correct 1317 ms 143552 KB Output is correct
52 Correct 1156 ms 145064 KB Output is correct
53 Correct 955 ms 146692 KB Output is correct
54 Correct 1052 ms 146560 KB Output is correct
55 Correct 0 ms 328 KB Output is correct
56 Incorrect 273 ms 142876 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 297 ms 116780 KB Output is correct
4 Correct 1400 ms 146580 KB Output is correct
5 Correct 1178 ms 73980 KB Output is correct
6 Correct 1370 ms 146684 KB Output is correct
7 Correct 1107 ms 100268 KB Output is correct
8 Correct 1399 ms 146568 KB Output is correct
9 Incorrect 0 ms 328 KB Output isn't correct
10 Halted 0 ms 0 KB -