답안 #978831

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978831	2024-05-09T18:28:35 Z	Mher777	밀림 점프 (APIO21_jumps)	C++17	48 / 100	950 ms	101636 KB

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], tol[N], toh[N], upl[N][M], uph[N][M];
pii st[N][M];
int n, l1, r1, l2, r2, lg;

pii qry_max(int l, int r) {
	int lgx = log2(r - l + 1);
	return max(st[l][lgx], st[r - (1 << lgx) + 1][lgx]);
}

void init(int N, std::vector<int> H) {
	n = N;
	lg = log2(n);
	vector<pii> v;
	for (int i = 0; i < n; ++i) {
		a[i + 1] = H[i];
		st[i + 1][0] = { a[i + 1],i + 1 };
		v.pub({ a[i + 1],i + 1 });
	}
	for (int l = 1; l <= lg; ++l) {
		for (int i = 1; (i + (1 << l) - 1) <= n; ++i) {
			st[i][l] = max(st[i][l - 1], st[i + (1 << (l - 1))][l - 1]);
		}
	}
	sort(all(v));
	reverse(all(v));
	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] != 0 && dpr[i] != n + 1) {
			tol[i] = dpl[i];
			toh[i] = dpr[i];
			if (a[dpl[i]] > a[dpr[i]]) {
				swap(tol[i], toh[i]);
			}
		}
		else if (dpl[i]) {
			tol[i] = dpl[i];
			toh[i] = MAX;
		}
		else if (dpr[i] != n + 1) {
			tol[i] = dpr[i];
			toh[i] = MAX;
		}
		else {
			tol[i] = toh[i] = MAX;
		}
	}
	for (auto elem : v) {
		int ind = elem.ss;
		if (tol[ind] == MAX) {
			for (int l = 0; l <= lg; ++l) {
				upl[ind][l] = uph[ind][l] = MAX;
			}
			continue;
		}
		upl[ind][0] = tol[ind];
		for (int l = 1; l <= lg; ++l) {
			if (upl[ind][l - 1] == MAX) {
				upl[ind][l] = MAX;
				continue;
			}
			upl[ind][l] = upl[upl[ind][l - 1]][l - 1];
		}
		if (toh[ind] == MAX) {
			for (int l = 0; l <= lg; ++l) {
				uph[ind][l] = MAX;
			}
			continue;
		}
		uph[ind][0] = toh[ind];
		for (int l = 1; l <= lg; ++l) {
			if (uph[ind][l - 1] == MAX) {
				uph[ind][l] = MAX;
				continue;
			}
			uph[ind][l] = uph[uph[ind][l - 1]][l - 1];
		}
	}
}

int minimum_jumps(int A, int B, int C, int D) {
	++A, ++B, ++C, ++D;
	l1 = A, r1 = B, l2 = C, r2 = D;
	int ind = -1;
	int lx = l1, rx = r1;
	while (lx <= rx) {
		int mid = (lx + rx) / 2;
		pii p = qry_max(mid, r1);
		if (p.ff > a[l2]) {
			lx = mid + 1;
		}
		else {
			ind = p.ss;
			rx = mid - 1;
		}
	}
	if (ind == -1) return -1;
	int h = a[l2];
	int ans = 0;
	for (int l = lg; l >= 0; --l) {
		if (uph[ind][l] == MAX) continue;
		if (a[uph[ind][l]] <= h) {
			ind = uph[ind][l];
			ans += (1 << l);
		}
	}
	for (int l = lg; l >= 0; --l) {
		if (upl[ind][l] == MAX) continue;
		if (a[upl[ind][l]] <= h) {
			ind = upl[ind][l];
			ans += (1 << l);
		}
	}
	if (a[ind] != h) return -1;
	return ans;
}

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

Subtask #1

4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	8536 KB	Output is correct
2	Correct	1 ms	8536 KB	Output is correct
3	Correct	137 ms	88256 KB	Output is correct
4	Correct	950 ms	101440 KB	Output is correct
5	Correct	716 ms	60092 KB	Output is correct
6	Correct	861 ms	101528 KB	Output is correct
7	Correct	670 ms	77380 KB	Output is correct
8	Correct	895 ms	101436 KB	Output is correct

Subtask #2

0 / 8.0

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

Subtask #3

0 / 13.0

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

Subtask #4

0 / 12.0

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

Subtask #5

23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	8536 KB	Output is correct
2	Correct	1 ms	8536 KB	Output is correct
3	Correct	1 ms	8532 KB	Output is correct
4	Correct	199 ms	55824 KB	Output is correct
5	Correct	746 ms	101516 KB	Output is correct
6	Correct	442 ms	25808 KB	Output is correct
7	Correct	722 ms	101416 KB	Output is correct
8	Correct	398 ms	42956 KB	Output is correct
9	Correct	761 ms	101576 KB	Output is correct
10	Correct	820 ms	101436 KB	Output is correct
11	Correct	813 ms	101540 KB	Output is correct
12	Correct	731 ms	101508 KB	Output is correct
13	Correct	714 ms	101428 KB	Output is correct
14	Correct	804 ms	101312 KB	Output is correct
15	Correct	621 ms	101424 KB	Output is correct
16	Correct	694 ms	101428 KB	Output is correct
17	Correct	1 ms	8536 KB	Output is correct
18	Correct	1 ms	8536 KB	Output is correct
19	Correct	2 ms	8536 KB	Output is correct
20	Correct	2 ms	8536 KB	Output is correct
21	Correct	2 ms	8532 KB	Output is correct
22	Correct	2 ms	8536 KB	Output is correct
23	Correct	2 ms	8536 KB	Output is correct
24	Correct	2 ms	8704 KB	Output is correct
25	Correct	1 ms	8532 KB	Output is correct
26	Correct	2 ms	11092 KB	Output is correct
27	Correct	13 ms	10840 KB	Output is correct
28	Correct	10 ms	10840 KB	Output is correct
29	Correct	9 ms	10840 KB	Output is correct
30	Correct	14 ms	10840 KB	Output is correct
31	Correct	14 ms	10840 KB	Output is correct
32	Correct	1 ms	8536 KB	Output is correct
33	Correct	70 ms	66556 KB	Output is correct
34	Correct	145 ms	101536 KB	Output is correct
35	Correct	72 ms	101512 KB	Output is correct
36	Correct	129 ms	101520 KB	Output is correct
37	Correct	119 ms	101384 KB	Output is correct
38	Correct	88 ms	101424 KB	Output is correct

Subtask #6

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	8536 KB	Output is correct
2	Correct	1 ms	8536 KB	Output is correct
3	Correct	1 ms	8532 KB	Output is correct
4	Correct	199 ms	55824 KB	Output is correct
5	Correct	746 ms	101516 KB	Output is correct
6	Correct	442 ms	25808 KB	Output is correct
7	Correct	722 ms	101416 KB	Output is correct
8	Correct	398 ms	42956 KB	Output is correct
9	Correct	761 ms	101576 KB	Output is correct
10	Correct	820 ms	101436 KB	Output is correct
11	Correct	813 ms	101540 KB	Output is correct
12	Correct	731 ms	101508 KB	Output is correct
13	Correct	714 ms	101428 KB	Output is correct
14	Correct	804 ms	101312 KB	Output is correct
15	Correct	621 ms	101424 KB	Output is correct
16	Correct	694 ms	101428 KB	Output is correct
17	Correct	1 ms	8536 KB	Output is correct
18	Correct	1 ms	8536 KB	Output is correct
19	Correct	2 ms	8536 KB	Output is correct
20	Correct	2 ms	8536 KB	Output is correct
21	Correct	2 ms	8532 KB	Output is correct
22	Correct	2 ms	8536 KB	Output is correct
23	Correct	2 ms	8536 KB	Output is correct
24	Correct	2 ms	8704 KB	Output is correct
25	Correct	1 ms	8532 KB	Output is correct
26	Correct	2 ms	11092 KB	Output is correct
27	Correct	13 ms	10840 KB	Output is correct
28	Correct	10 ms	10840 KB	Output is correct
29	Correct	9 ms	10840 KB	Output is correct
30	Correct	14 ms	10840 KB	Output is correct
31	Correct	14 ms	10840 KB	Output is correct
32	Correct	1 ms	8536 KB	Output is correct
33	Correct	70 ms	66556 KB	Output is correct
34	Correct	145 ms	101536 KB	Output is correct
35	Correct	72 ms	101512 KB	Output is correct
36	Correct	129 ms	101520 KB	Output is correct
37	Correct	119 ms	101384 KB	Output is correct
38	Correct	88 ms	101424 KB	Output is correct
39	Correct	1 ms	8536 KB	Output is correct
40	Correct	1 ms	8532 KB	Output is correct
41	Correct	2 ms	8536 KB	Output is correct
42	Correct	169 ms	55872 KB	Output is correct
43	Correct	746 ms	101424 KB	Output is correct
44	Correct	430 ms	25808 KB	Output is correct
45	Correct	750 ms	101416 KB	Output is correct
46	Correct	406 ms	43148 KB	Output is correct
47	Correct	759 ms	101520 KB	Output is correct
48	Correct	743 ms	101516 KB	Output is correct
49	Correct	748 ms	101420 KB	Output is correct
50	Correct	810 ms	101432 KB	Output is correct
51	Correct	731 ms	101556 KB	Output is correct
52	Correct	844 ms	101524 KB	Output is correct
53	Correct	623 ms	101420 KB	Output is correct
54	Correct	631 ms	101316 KB	Output is correct
55	Correct	1 ms	8536 KB	Output is correct
56	Correct	189 ms	101536 KB	Output is correct
57	Correct	816 ms	101420 KB	Output is correct
58	Correct	375 ms	26056 KB	Output is correct
59	Correct	835 ms	101548 KB	Output is correct
60	Correct	344 ms	45004 KB	Output is correct
61	Correct	900 ms	101516 KB	Output is correct
62	Correct	887 ms	101424 KB	Output is correct
63	Correct	881 ms	101536 KB	Output is correct
64	Correct	913 ms	101424 KB	Output is correct
65	Correct	858 ms	101476 KB	Output is correct
66	Correct	896 ms	101532 KB	Output is correct
67	Correct	746 ms	101424 KB	Output is correct
68	Correct	798 ms	101516 KB	Output is correct
69	Correct	1 ms	8532 KB	Output is correct
70	Correct	1 ms	8536 KB	Output is correct
71	Correct	2 ms	8536 KB	Output is correct
72	Correct	2 ms	8536 KB	Output is correct
73	Correct	2 ms	8536 KB	Output is correct
74	Correct	2 ms	8536 KB	Output is correct
75	Correct	2 ms	8536 KB	Output is correct
76	Correct	1 ms	8536 KB	Output is correct
77	Correct	1 ms	8536 KB	Output is correct
78	Correct	2 ms	8536 KB	Output is correct
79	Correct	2 ms	8536 KB	Output is correct
80	Correct	2 ms	8700 KB	Output is correct
81	Correct	2 ms	8536 KB	Output is correct
82	Correct	2 ms	8536 KB	Output is correct
83	Correct	2 ms	8536 KB	Output is correct
84	Correct	1 ms	8536 KB	Output is correct
85	Correct	3 ms	8536 KB	Output is correct
86	Correct	11 ms	10840 KB	Output is correct
87	Correct	13 ms	10840 KB	Output is correct
88	Correct	14 ms	10840 KB	Output is correct
89	Correct	13 ms	10840 KB	Output is correct
90	Correct	11 ms	10840 KB	Output is correct
91	Correct	1 ms	8536 KB	Output is correct
92	Correct	2 ms	10840 KB	Output is correct
93	Correct	10 ms	10840 KB	Output is correct
94	Correct	10 ms	10840 KB	Output is correct
95	Correct	10 ms	10920 KB	Output is correct
96	Correct	17 ms	10840 KB	Output is correct
97	Correct	9 ms	11092 KB	Output is correct
98	Correct	1 ms	8536 KB	Output is correct
99	Correct	167 ms	101420 KB	Output is correct
100	Correct	136 ms	101636 KB	Output is correct
101	Correct	70 ms	101436 KB	Output is correct
102	Correct	119 ms	101440 KB	Output is correct
103	Correct	120 ms	101424 KB	Output is correct
104	Correct	83 ms	101504 KB	Output is correct
105	Correct	1 ms	8536 KB	Output is correct
106	Correct	76 ms	66560 KB	Output is correct
107	Correct	151 ms	101520 KB	Output is correct
108	Correct	82 ms	101420 KB	Output is correct
109	Correct	131 ms	101524 KB	Output is correct
110	Correct	140 ms	101512 KB	Output is correct
111	Correct	94 ms	101520 KB	Output is correct

Subtask #7

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	8536 KB	Output is correct
2	Correct	1 ms	8536 KB	Output is correct
3	Correct	137 ms	88256 KB	Output is correct
4	Correct	950 ms	101440 KB	Output is correct
5	Correct	716 ms	60092 KB	Output is correct
6	Correct	861 ms	101528 KB	Output is correct
7	Correct	670 ms	77380 KB	Output is correct
8	Correct	895 ms	101436 KB	Output is correct
9	Incorrect	1 ms	8536 KB	Output isn't correct
10	Halted	0 ms	0 KB	-