oj.uz

Submission #978827

# Submission time Handle Problem Language Result Execution time Memory
978827 2024-05-09T18:18:55 Z Mher777 Rainforest Jumps (APIO21_jumps) C++17
23 / 100
 766 ms 54836 KB 
#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];
int n, l1, r1, l2, r2, lg;

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];
		v.pub({ a[i + 1],i + 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 h = a[l2], ind = l1;
	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
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6740 KB Output is correct
3 Incorrect 105 ms 49312 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6484 KB Output is correct
3 Correct 2 ms 6488 KB Output is correct
4 Correct 229 ms 31356 KB Output is correct
5 Correct 730 ms 54552 KB Output is correct
6 Correct 418 ms 15568 KB Output is correct
7 Correct 707 ms 54836 KB Output is correct
8 Correct 400 ms 24780 KB Output is correct
9 Correct 698 ms 54588 KB Output is correct
10 Correct 766 ms 54356 KB Output is correct
11 Correct 725 ms 54584 KB Output is correct
12 Correct 730 ms 54572 KB Output is correct
13 Correct 661 ms 54404 KB Output is correct
14 Correct 723 ms 54408 KB Output is correct
15 Correct 691 ms 54552 KB Output is correct
16 Correct 631 ms 54580 KB Output is correct
17 Correct 2 ms 6488 KB Output is correct
18 Correct 1 ms 6488 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 3 ms 6488 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6488 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 1 ms 6604 KB Output is correct
26 Correct 1 ms 6488 KB Output is correct
27 Correct 9 ms 8792 KB Output is correct
28 Correct 9 ms 9040 KB Output is correct
29 Correct 9 ms 8792 KB Output is correct
30 Correct 10 ms 8792 KB Output is correct
31 Correct 9 ms 8792 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 54 ms 36104 KB Output is correct
34 Correct 119 ms 54804 KB Output is correct
35 Correct 43 ms 54316 KB Output is correct
36 Correct 92 ms 54316 KB Output is correct
37 Correct 96 ms 54528 KB Output is correct
38 Correct 62 ms 54568 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6484 KB Output is correct
3 Correct 2 ms 6488 KB Output is correct
4 Correct 229 ms 31356 KB Output is correct
5 Correct 730 ms 54552 KB Output is correct
6 Correct 418 ms 15568 KB Output is correct
7 Correct 707 ms 54836 KB Output is correct
8 Correct 400 ms 24780 KB Output is correct
9 Correct 698 ms 54588 KB Output is correct
10 Correct 766 ms 54356 KB Output is correct
11 Correct 725 ms 54584 KB Output is correct
12 Correct 730 ms 54572 KB Output is correct
13 Correct 661 ms 54404 KB Output is correct
14 Correct 723 ms 54408 KB Output is correct
15 Correct 691 ms 54552 KB Output is correct
16 Correct 631 ms 54580 KB Output is correct
17 Correct 2 ms 6488 KB Output is correct
18 Correct 1 ms 6488 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 3 ms 6488 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6488 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 1 ms 6604 KB Output is correct
26 Correct 1 ms 6488 KB Output is correct
27 Correct 9 ms 8792 KB Output is correct
28 Correct 9 ms 9040 KB Output is correct
29 Correct 9 ms 8792 KB Output is correct
30 Correct 10 ms 8792 KB Output is correct
31 Correct 9 ms 8792 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 54 ms 36104 KB Output is correct
34 Correct 119 ms 54804 KB Output is correct
35 Correct 43 ms 54316 KB Output is correct
36 Correct 92 ms 54316 KB Output is correct
37 Correct 96 ms 54528 KB Output is correct
38 Correct 62 ms 54568 KB Output is correct
39 Correct 1 ms 6488 KB Output is correct
40 Correct 1 ms 6488 KB Output is correct
41 Correct 1 ms 6488 KB Output is correct
42 Correct 162 ms 31396 KB Output is correct
43 Correct 721 ms 54588 KB Output is correct
44 Correct 409 ms 15568 KB Output is correct
45 Correct 690 ms 54572 KB Output is correct
46 Correct 396 ms 24648 KB Output is correct
47 Correct 656 ms 54588 KB Output is correct
48 Correct 730 ms 54420 KB Output is correct
49 Correct 720 ms 54580 KB Output is correct
50 Correct 691 ms 54420 KB Output is correct
51 Correct 686 ms 54576 KB Output is correct
52 Correct 734 ms 54408 KB Output is correct
53 Correct 699 ms 54316 KB Output is correct
54 Correct 691 ms 54340 KB Output is correct
55 Correct 1 ms 6488 KB Output is correct
56 Incorrect 153 ms 54316 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6740 KB Output is correct
3 Incorrect 105 ms 49312 KB Output isn't correct
4 Halted 0 ms 0 KB -