제출 #978571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978571		Mher777	밀림 점프 (APIO21_jumps)	C++17	33 / 100	4073 ms	17016 KiB

jumps

#include "jumps.h"
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(2e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

const int N = 200005, M = 30;
int a[N], dpl[N], dpr[N], used[N], dist[N];
vi g[N];
int n, l1, r1, l2, r2;

void init(int N, std::vector<int> H) {
	n = N;
	for (int i = 0; i < n; ++i) {
		a[i + 1] = H[i];
	}
	for (int i = 1; i <= n; ++i) {
		int ind = i - 1;
		while (ind && a[ind] <= a[i]) {
			ind = dpl[ind];
		}
		dpl[i] = ind;
	}
	for (int i = n; i >= 1; --i) {
		int ind = i + 1;
		while (ind <= n && a[ind] <= a[i]) {
			ind = dpr[ind];
		}
		dpr[i] = ind;
		if (dpl[i]) g[i].pub(dpl[i]);
		if (dpr[i] != n + 1) g[i].pub(dpr[i]);
	}
}

int minimum_jumps(int A, int B, int C, int D) {
	++A, ++B, ++C, ++D;
	l1 = A, r1 = B, l2 = C, r2 = D;
	queue<int> q;
	for (int i = 1; i <= n; ++i) {
		dist[i] = used[i] = 0;
		if (i >= l1 && i <= r1) {
			q.push(i);
			used[i] = 1;
		}
	}
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		if (u >= l2 && u <= r2) {
			return dist[u];
		}
		for (auto to : g[u]) {
			if (!used[to]) {
				used[to] = 1;
				dist[to] = dist[u] + 1;
				q.push(to);
			}
		}
	}
	return -1;
}

/*
7 7
3 2 1 6 4 5 7
4 4 6 6
1 3 5 6
0 1 2 2
*/

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