oj.uz

Submission #978571

# Submission time Handle Problem Language Result Execution time Memory
978571 2024-05-09T11:00:03 Z Mher777 Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 17016 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], 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.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Execution timed out 4073 ms 15140 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 3 ms 8792 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 3 ms 8792 KB Output is correct
9 Correct 2 ms 8792 KB Output is correct
10 Correct 3 ms 8792 KB Output is correct
11 Correct 3 ms 9044 KB Output is correct
12 Correct 3 ms 8792 KB Output is correct
13 Correct 2 ms 8792 KB Output is correct
14 Correct 3 ms 8792 KB Output is correct
15 Correct 3 ms 8792 KB Output is correct
16 Correct 3 ms 8792 KB Output is correct
17 Correct 3 ms 8792 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 8792 KB Output is correct
20 Correct 3 ms 8792 KB Output is correct
21 Correct 3 ms 8792 KB Output is correct
22 Correct 3 ms 8792 KB Output is correct
23 Correct 3 ms 8792 KB Output is correct
24 Correct 3 ms 8792 KB Output is correct
25 Correct 2 ms 8792 KB Output is correct
26 Correct 1 ms 8792 KB Output is correct
27 Correct 2 ms 8792 KB Output is correct
28 Correct 3 ms 8792 KB Output is correct
29 Correct 3 ms 8792 KB Output is correct
30 Correct 2 ms 8820 KB Output is correct
31 Correct 3 ms 8792 KB Output is correct
32 Correct 3 ms 8792 KB Output is correct
33 Correct 1 ms 8792 KB Output is correct
34 Correct 2 ms 8792 KB Output is correct
35 Correct 2 ms 8792 KB Output is correct
36 Correct 2 ms 8792 KB Output is correct
37 Correct 2 ms 8792 KB Output is correct
38 Correct 2 ms 8792 KB Output is correct
39 Correct 1 ms 8792 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 3 ms 8792 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 3 ms 8792 KB Output is correct
9 Correct 2 ms 8792 KB Output is correct
10 Correct 3 ms 8792 KB Output is correct
11 Correct 3 ms 9044 KB Output is correct
12 Correct 3 ms 8792 KB Output is correct
13 Correct 2 ms 8792 KB Output is correct
14 Correct 3 ms 8792 KB Output is correct
15 Correct 3 ms 8792 KB Output is correct
16 Correct 3 ms 8792 KB Output is correct
17 Correct 3 ms 8792 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 8792 KB Output is correct
20 Correct 3 ms 8792 KB Output is correct
21 Correct 3 ms 8792 KB Output is correct
22 Correct 3 ms 8792 KB Output is correct
23 Correct 3 ms 8792 KB Output is correct
24 Correct 3 ms 8792 KB Output is correct
25 Correct 2 ms 8792 KB Output is correct
26 Correct 1 ms 8792 KB Output is correct
27 Correct 2 ms 8792 KB Output is correct
28 Correct 3 ms 8792 KB Output is correct
29 Correct 3 ms 8792 KB Output is correct
30 Correct 2 ms 8820 KB Output is correct
31 Correct 3 ms 8792 KB Output is correct
32 Correct 3 ms 8792 KB Output is correct
33 Correct 1 ms 8792 KB Output is correct
34 Correct 2 ms 8792 KB Output is correct
35 Correct 2 ms 8792 KB Output is correct
36 Correct 2 ms 8792 KB Output is correct
37 Correct 2 ms 8792 KB Output is correct
38 Correct 2 ms 8792 KB Output is correct
39 Correct 1 ms 8792 KB Output is correct
40 Correct 2 ms 8792 KB Output is correct
41 Correct 1 ms 8792 KB Output is correct
42 Correct 1 ms 8792 KB Output is correct
43 Correct 1 ms 8824 KB Output is correct
44 Correct 2 ms 8792 KB Output is correct
45 Correct 2 ms 8792 KB Output is correct
46 Correct 2 ms 8792 KB Output is correct
47 Correct 2 ms 8792 KB Output is correct
48 Correct 2 ms 8792 KB Output is correct
49 Correct 2 ms 8792 KB Output is correct
50 Correct 3 ms 8792 KB Output is correct
51 Correct 3 ms 8792 KB Output is correct
52 Correct 3 ms 8792 KB Output is correct
53 Correct 3 ms 8792 KB Output is correct
54 Correct 3 ms 8792 KB Output is correct
55 Correct 3 ms 8792 KB Output is correct
56 Correct 2 ms 8792 KB Output is correct
57 Correct 2 ms 8792 KB Output is correct
58 Correct 17 ms 8792 KB Output is correct
59 Correct 28 ms 8792 KB Output is correct
60 Correct 5 ms 9044 KB Output is correct
61 Correct 25 ms 9048 KB Output is correct
62 Correct 10 ms 8792 KB Output is correct
63 Correct 28 ms 8792 KB Output is correct
64 Correct 31 ms 8792 KB Output is correct
65 Correct 29 ms 8792 KB Output is correct
66 Correct 28 ms 8792 KB Output is correct
67 Correct 25 ms 9044 KB Output is correct
68 Correct 35 ms 8792 KB Output is correct
69 Correct 32 ms 9044 KB Output is correct
70 Correct 24 ms 8792 KB Output is correct
71 Correct 1 ms 8792 KB Output is correct
72 Correct 2 ms 8792 KB Output is correct
73 Correct 3 ms 8792 KB Output is correct
74 Correct 3 ms 8792 KB Output is correct
75 Correct 3 ms 8792 KB Output is correct
76 Correct 3 ms 8792 KB Output is correct
77 Correct 3 ms 8792 KB Output is correct
78 Correct 1 ms 8792 KB Output is correct
79 Correct 2 ms 9056 KB Output is correct
80 Correct 2 ms 8792 KB Output is correct
81 Correct 3 ms 8792 KB Output is correct
82 Correct 3 ms 8792 KB Output is correct
83 Correct 3 ms 8792 KB Output is correct
84 Correct 3 ms 8792 KB Output is correct
85 Correct 3 ms 8792 KB Output is correct
86 Correct 1 ms 8792 KB Output is correct
87 Correct 1 ms 8792 KB Output is correct
88 Correct 2 ms 8792 KB Output is correct
89 Correct 2 ms 8792 KB Output is correct
90 Correct 2 ms 8792 KB Output is correct
91 Correct 2 ms 8792 KB Output is correct
92 Correct 2 ms 8792 KB Output is correct
93 Correct 2 ms 8804 KB Output is correct
94 Correct 3 ms 8792 KB Output is correct
95 Correct 24 ms 8792 KB Output is correct
96 Correct 29 ms 8804 KB Output is correct
97 Correct 25 ms 8792 KB Output is correct
98 Correct 31 ms 8792 KB Output is correct
99 Correct 29 ms 8792 KB Output is correct
100 Correct 2 ms 8792 KB Output is correct
101 Correct 2 ms 8792 KB Output is correct
102 Correct 21 ms 8840 KB Output is correct
103 Correct 30 ms 8792 KB Output is correct
104 Correct 22 ms 8792 KB Output is correct
105 Correct 26 ms 8792 KB Output is correct
106 Correct 27 ms 9044 KB Output is correct
107 Correct 2 ms 8792 KB Output is correct
108 Correct 2 ms 8792 KB Output is correct
109 Correct 2 ms 8792 KB Output is correct
110 Correct 2 ms 8980 KB Output is correct
111 Correct 2 ms 8792 KB Output is correct
112 Correct 2 ms 8792 KB Output is correct
113 Correct 2 ms 8792 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 1 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 33 ms 15384 KB Output is correct
6 Correct 37 ms 17016 KB Output is correct
7 Correct 18 ms 12820 KB Output is correct
8 Correct 41 ms 16888 KB Output is correct
9 Correct 7 ms 9816 KB Output is correct
10 Correct 36 ms 16728 KB Output is correct
11 Correct 29 ms 16784 KB Output is correct
12 Correct 31 ms 16756 KB Output is correct
13 Correct 32 ms 16784 KB Output is correct
14 Correct 35 ms 16748 KB Output is correct
15 Correct 34 ms 16780 KB Output is correct
16 Correct 35 ms 16780 KB Output is correct
17 Correct 35 ms 16700 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 8792 KB Output is correct
20 Correct 2 ms 8792 KB Output is correct
21 Correct 2 ms 8792 KB Output is correct
22 Correct 2 ms 8792 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 2 ms 8792 KB Output is correct
25 Correct 2 ms 8792 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 2 ms 8792 KB Output is correct
28 Correct 2 ms 8792 KB Output is correct
29 Correct 2 ms 8792 KB Output is correct
30 Correct 2 ms 8792 KB Output is correct
31 Correct 2 ms 8792 KB Output is correct
32 Correct 1 ms 8792 KB Output is correct
33 Correct 33 ms 16836 KB Output is correct
34 Correct 41 ms 16632 KB Output is correct
35 Correct 30 ms 16776 KB Output is correct
36 Correct 35 ms 17000 KB Output is correct
37 Correct 38 ms 16784 KB Output is correct
38 Correct 30 ms 16780 KB Output is correct
39 Correct 2 ms 8792 KB Output is correct
40 Correct 21 ms 13116 KB Output is correct
41 Correct 38 ms 16744 KB Output is correct
42 Correct 28 ms 16780 KB Output is correct
43 Correct 44 ms 16780 KB Output is correct
44 Correct 35 ms 16716 KB Output is correct
45 Correct 29 ms 16788 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8788 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8820 KB Output is correct
4 Execution timed out 4062 ms 12376 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8788 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8820 KB Output is correct
4 Execution timed out 4062 ms 12376 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Execution timed out 4073 ms 15140 KB Time limit exceeded
4 Halted 0 ms 0 KB -