oj.uz

Submission #982935

# Submission time Handle Problem Language Result Execution time Memory
982935 2024-05-15T04:35:01 Z shjeong Rainforest Jumps (APIO21_jumps) C++17
4 / 100
 1149 ms 121888 KB 
#include "jumps.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cstring>
#include <vector>
#include <string>
#include <climits>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
#include <cassert>
#include <list>
using namespace std;
typedef long long ll;
ll n;
struct segtree{
    vector<pair<ll,ll>> tree;
    segtree(): tree(808080){}
    void init(ll node, ll s, ll e, vector<ll> &v){
        if(s==e)tree[node] = {v[s],s};
        else{
            ll mid = s+e>>1;
            init(node<<1,s,mid,v); init(node<<1|1,mid+1,e,v);
            tree[node] = max(tree[node<<1],tree[node<<1|1]);
        }
    }
    pair<ll,ll> query(ll node, ll s, ll e, ll l, ll r){
        if(l>r)return {-1,-1};
        if(e<l or r<s)return {0,0};
        if(l<=s and e<=r)return tree[node];
        ll mid = s+e>>1;
        return max(query(node<<1,s,mid,l,r), query(node<<1|1,mid+1,e,l,r));
    }
    pair<ll,ll> Q(ll l, ll r){ return query(1,1,n,l,r); }
} seg;
vector<ll> v;
ll L[202020][22];
ll R[202020][22];
ll M[202020][22];
void init(int N, std::vector<int> H) {
    n=N;
    v.push_back(0);
    for(int i = 1 ; i <= n ; i++)v.push_back(H[i-1]);
    seg.init(1,1,n,v);
    stack<ll> st;
    for(int i = 1 ; i <= n ; i++){
        while(st.size() and v[st.top()] < v[i]){
            R[st.top()][0] = i;
            st.pop();
        }
        st.push(i);
    }
    while(st.size())st.pop();
    for(int i = n ; i >= 1 ; i--){
        while(st.size() and v[st.top()] < v[i]){
            L[st.top()][0] = i;
            st.pop();
        }
        st.push(i);
    }
    for(int i = 1 ; i <= n ; i++){
        M[i][0] = (v[L[i][0]] > v[R[i][0]] ? L[i][0] : R[i][0]);
    }
    for(int j = 1 ; j <= 20 ; j++){
        for(int i = 1 ; i <= n ; i++){
            L[i][j] = L[L[i][j-1]][j-1];
            R[i][j] = R[R[i][j-1]][j-1];
            M[i][j] = M[M[i][j-1]][j-1];
        }
    }
}
ll AB, BC, CD;
ll c;
pair<ll,ll> move_R(ll x){    //몇번 이동해야 좌표가 C 이상인가?
    ll ret = 0;
    for(int i = 20 ; i >= 0 ; i--){
        if(R[x][i]<=0)continue;
        if(R[x][i] < c)ret += (1<<i), x = R[x][i];
    }
    return {ret+1,R[x][0]};
}
int minimum_jumps(int A, int B, int C, int D) {
    A++; B++; C++; D++;
    c=C;
    AB = seg.Q(A,B).first, BC = seg.Q(B+1,C-1).first, CD = seg.Q(C,D).first;
    ll ret = 1e9;
    if(v[B] < BC){  //BC 미만인 가장 큰놈부터
        ll t = seg.Q(B+1,C-1).second;
        ll res = 0;
        ll cur = B;
        for(int i = 20 ; i >= 0 ; i--){
            if(L[cur][i]<=0)continue;
            if(L[cur][i]>=A and v[L[cur][i]] < v[t])cur = L[cur][i];
        }
        for(int i = 20 ; i >= 0 ; i--){
            if(M[cur][i]<=0)continue;
            if(v[M[cur][i]]<v[t] and R[cur][i]>0 and R[cur][i]<t)cur = M[cur][i], res += (1<<i);
        }
        for(int i = 20 ; i >= 0 ; i--){
            if(R[cur][i]<=0)continue;
            if(R[cur][i]<t)cur = R[cur][i], res += (1<<i);
        }
        res++; cur = R[cur][0];
        if(cur==t)ret = min(ret, res+1);
    }
    if(AB>BC){  //BC 초과인 가장 작은놈부터
        ll cur = B;
        for(int i = 20 ; i >= 0 ; i--){
            if(L[cur][i]<=0)continue;
            if(v[L[cur][i]] < BC)cur = L[cur][i];
        }
        if(v[cur]<BC)cur = L[cur][0];
        assert(cur>=A);
        auto [res,e] = move_R(cur);
        if(e>=C and e<=D){
            ret = min(ret, res);
        }
    }
    if(AB<BC){  //제일 큰놈
        ll cur = B;
        for(int i = 20 ; i >= 0 ; i--){
            if(L[cur][i]<=0)continue;
            if(L[cur][i]>=A)cur = L[cur][i];
        }
        ll res = 0;
        for(int i = 20 ; i >= 0 ; i--){
            if(L[cur][i]<=0)continue;
            if(v[L[cur][i]] <= BC)res += (1<<i), cur = L[cur][i];
        }
        res++;
        cur = L[cur][0];
        auto [res2,e] = move_R(cur);
        if(e>=C and e<=D){
            ret = min(ret, res+res2);
        }
    }
    if(ret==1e9)ret = -1;
    return ret;
}

Compilation message

jumps.cpp: In member function 'void segtree::init(ll, ll, ll, std::vector<long long int>&)':
jumps.cpp:26:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |             ll mid = s+e>>1;
      |                      ~^~
jumps.cpp: In member function 'std::pair<long long int, long long int> segtree::query(ll, ll, ll, ll, ll)':
jumps.cpp:35:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |         ll mid = s+e>>1;
      |                  ~^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 5 ms 15016 KB Output is correct
3 Correct 217 ms 103988 KB Output is correct
4 Correct 1035 ms 121888 KB Output is correct
5 Correct 931 ms 71968 KB Output is correct
6 Correct 1098 ms 121752 KB Output is correct
7 Correct 826 ms 91328 KB Output is correct
8 Correct 1149 ms 121764 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14984 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Incorrect 4 ms 16984 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14984 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Incorrect 4 ms 16984 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14936 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Incorrect 95 ms 106144 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14936 KB Output is correct
4 Incorrect 225 ms 68164 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14936 KB Output is correct
4 Incorrect 225 ms 68164 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 5 ms 15016 KB Output is correct
3 Correct 217 ms 103988 KB Output is correct
4 Correct 1035 ms 121888 KB Output is correct
5 Correct 931 ms 71968 KB Output is correct
6 Correct 1098 ms 121752 KB Output is correct
7 Correct 826 ms 91328 KB Output is correct
8 Correct 1149 ms 121764 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14984 KB Output is correct
12 Correct 3 ms 14936 KB Output is correct
13 Incorrect 4 ms 16984 KB Output isn't correct
14 Halted 0 ms 0 KB -