제출 #413219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
413219		CSQ31	밀림 점프 (APIO21_jumps)	C++14	23 / 100	1539 ms	45924 KiB

jumps

#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
const int MAXN = 2e5+5;
vii adj(MAXN);
int hpar[20][MAXN],lpar[20][MAXN];
vector<int>H;
void init(int n, vector<int>h){
	H = h;
	stack<pii>stk;
	for(int i=0;i<n;i++){
		while(!stk.empty() && stk.top().fi < h[i])stk.pop();
		if(!stk.empty())adj[h[i]].pb(stk.top().fi);
		stk.push({h[i],i});
	}
	while(!stk.empty())stk.pop();
	for(int i=n-1;i>=0;i--){
	    while(!stk.empty() && stk.top().fi < h[i])stk.pop();
		if(!stk.empty())adj[h[i]].pb(stk.top().fi);
		stk.push({h[i],i});
	}
	for(int i=0;i<n;i++){
		if(sz(adj[i]) >1){
			hpar[0][i] = max(adj[i][0],adj[i][1]);
			lpar[0][i] = min(adj[i][0],adj[i][1]);
		}
		else if(sz(adj[i])) lpar[0][i] = adj[i][0];
	}
	for(int j=1;j<20;j++){
		for(int i=0;i<n;i++){
			hpar[j][i] = hpar[j-1][hpar[j-1][i]];
			lpar[j][i] = lpar[j-1][lpar[j-1][i]];
		}
	}
	
}
int minimum_jumps(int a,int b,int c,int d){
	if(a==b && c==d){
		int cur = H[a];
		int ans = 0;
		for(int i=19;i>=0;i--){
			if(hpar[i][cur] && hpar[i][cur] <= H[d]){
				ans+=(1<<i);
				cur = hpar[i][cur];
			}
		}
		for(int i=19;i>=0;i--){
			if(lpar[i][cur] && lpar[i][cur] <= H[d]){
				ans+=(1<<i);
				cur = lpar[i][cur];
			}
		}
		if(cur == H[d])return ans;
		else return -1;
		
	}	
	return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 23 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19