oj.uz

Submission #418079

# Submission time Handle Problem Language Result Execution time Memory
418079 2021-06-05T04:16:10 Z 8e7 Rainforest Jumps (APIO21_jumps) C++14
33 / 100
 4000 ms 88080 KB 
//Challenge: Accepted
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <stack>
#include <set>
#include <map>
#include <assert.h>
#include <queue>
#include <iomanip>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
#define maxn 200005
#define mod 1000000007
using namespace std;
using namespace __gnu_pbds;
void debug() {
	cout << endl;
}
template<class T, class ...U> void debug(T a, U ...b) {
	cout << a << " ";debug(b...);
}
template<class T> void pary(T l, T r) {
	while (l != r) {
		cout << *l << " ";
		l++;
	}
	cout << endl;
}

//template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//gp_hash_table<int, int> mp;
//find by order, order of key

#include "jumps.h"

vector<int> adj[maxn];
int to[18][maxn], anc[18][maxn], par[maxn], dep[maxn];
int tom[18][maxn], ancm[18][maxn];
int lef[maxn], rig[maxn];
int ti = 0;
void dfs(int n, int par, int d) {
	dep[n] = d;
	lef[n] = n, rig[n] = n;
	for (int v:adj[n]) {
		if (v != par) {
			dfs(v, n, d + 1);
			lef[n] = min(lef[n], lef[v]);
			rig[n] = max(rig[n], rig[v]);
		}
	}
}
void init(int N, vector<int> H) {
	stack<int> stk;
	for (int i = 0;i < N;i++) par[i] = N, lef[i] = N, rig[i] = N;
	for (int i = 0;i < N;i++) {
		vector<int> po;
		while (stk.size() && H[i] >= H[stk.top()]) {
			po.push_back(stk.top());
			rig[stk.top()] = i;
			stk.pop();
		}
		if (po.size()) {
			adj[i].push_back(po.back());
			par[po.back()] = i;
			for (int j = 0;j < po.size() - 1;j++) {
				adj[po[j + 1]].push_back(po[j]);
				par[po[j]] = po[j + 1];
			}
		}
		if (stk.size()) lef[i] = stk.top();
		stk.push(i);
	}	
	int prv = -1;
	while (stk.size()) {
		int cur = stk.top();
		if (prv != -1) {
			adj[cur].push_back(prv);
			par[prv] = cur;
		}
		prv = cur;
		stk.pop();
	}
	//pary(par, par + N);
	for (int i = 0;i < N;i++) {
		anc[0][i] = par[i], ancm[0][i] = max(i, par[i]);
		if (par[i] == lef[i]) to[0][i] = rig[i], tom[0][i] = rig[i];
		else to[0][i] = lef[i], tom[0][i] = i;
	}
	dep[N] = -1, to[0][N] = anc[0][N] = N;
	tom[0][N] = ancm[0][N] = N;
	for (int i = 1;i < 18;i++) {
		for (int j = 0;j <= N;j++) {
			to[i][j] = to[i - 1][to[i - 1][j]], anc[i][j] = anc[i - 1][anc[i - 1][j]];
			tom[i][j] = max(tom[i - 1][j], tom[i - 1][to[i - 1][j]]);
			ancm[i][j] = max(ancm[i - 1][j], ancm[i - 1][anc[i][j]]);
		}
	}
	int root = max_element(H.begin(), H.end()) - H.begin();
	dfs(root, root, 0);
}
int curl = 0, curr = 0;
int dis(int s, int t) {
	int dif = dep[s] - dep[t];
	if (dif < 0) return -1;
	int ret = 0, cur = s;
	while (true) {
		if (curl <= to[0][cur] && to[0][cur] <= curr) return ret + 1;
		if (curl <= anc[0][cur] && anc[0][cur] <= curr) return ret + 1;
		if (dep[to[0][cur]] >= dep[t]) {
			cur = to[0][cur];
			ret++;
		} else {
			break;
		}
	}
	while (cur < curl) {
		cur = anc[0][cur], ret++;
	}
	return ret;
	/*
	for (int i = 17;i >= 0;i--) {
		if (dep[to[i][cur]] >= dep[t] && tom[i][cur] < curl && ancm[i][cur] < curl) {
			cur = to[i][cur];
			ret += 1<<i;
		}	
	}
	if (curl <= to[0][cur] && to[0][cur] <= curr) return ret + 1;
	for (int i = 17;i >= 0;i--) {
		if (dep[anc[i][cur]] >= dep[t] && ancm[i][cur] < curl) {
			cur = anc[i][cur];
			ret += 1<<i;
		}
	}
	if (curl <= anc[0][cur] && anc[0][cur] <= curr) return ret + 1;
	*/
	return -1;
}
int lca(int a, int b) {
	if (dep[a] < dep[b]) swap(a, b);
	int hdif = dep[a] - dep[b], cnt = 0;
	while (hdif) {
		if (hdif & 1) {
			a = anc[cnt][a];
		}
		hdif>>=1, cnt++;
	}
	if (a == b) return a;
	for (int i = 17;i >= 0;i--) {
		if (anc[i][a] != anc[i][b]) {
			a = anc[i][a], b = anc[i][b];
		}
	}
	return anc[0][a];
}
int minimum_jumps(int A, int B, int C, int D) {
	int ret = -1;
	int m = lca(C, D);
	int l = max(lef[m], A), r = min(rig[m], B);
	if (r < l) return -1;	
	curl = C, curr = D;
	return dis(lca(l, r), m);
}
/*
7 4
3 2 1 6 4 5 7
4 5 6 6
0 3 6 6
0 1 2 2
1 1 3 3


*/

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:72:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |    for (int j = 0;j < po.size() - 1;j++) {
      |                   ~~^~~~~~~~~~~~~~~
jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:163:6: warning: unused variable 'ret' [-Wunused-variable]
  163 |  int ret = -1;
      |      ^~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5320 KB Output is correct
2 Correct 3 ms 5320 KB Output is correct
3 Correct 1119 ms 71292 KB Output is correct
4 Execution timed out 4027 ms 88068 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5320 KB Output is correct
2 Correct 3 ms 5320 KB Output is correct
3 Correct 3 ms 5320 KB Output is correct
4 Correct 3 ms 5320 KB Output is correct
5 Correct 76 ms 57716 KB Output is correct
6 Correct 97 ms 70216 KB Output is correct
7 Correct 48 ms 38720 KB Output is correct
8 Correct 94 ms 70176 KB Output is correct
9 Correct 17 ms 15092 KB Output is correct
10 Correct 107 ms 70136 KB Output is correct
11 Correct 93 ms 87944 KB Output is correct
12 Correct 91 ms 83648 KB Output is correct
13 Correct 98 ms 83348 KB Output is correct
14 Correct 97 ms 70496 KB Output is correct
15 Correct 98 ms 88040 KB Output is correct
16 Correct 97 ms 87876 KB Output is correct
17 Correct 95 ms 87932 KB Output is correct
18 Correct 4 ms 5320 KB Output is correct
19 Correct 4 ms 5448 KB Output is correct
20 Correct 4 ms 5444 KB Output is correct
21 Correct 3 ms 5448 KB Output is correct
22 Correct 4 ms 5448 KB Output is correct
23 Correct 3 ms 5456 KB Output is correct
24 Correct 3 ms 5448 KB Output is correct
25 Correct 3 ms 5448 KB Output is correct
26 Correct 4 ms 5704 KB Output is correct
27 Correct 4 ms 5960 KB Output is correct
28 Correct 4 ms 6192 KB Output is correct
29 Correct 4 ms 5960 KB Output is correct
30 Correct 4 ms 6216 KB Output is correct
31 Correct 4 ms 6216 KB Output is correct
32 Correct 3 ms 5320 KB Output is correct
33 Correct 95 ms 70124 KB Output is correct
34 Correct 95 ms 70208 KB Output is correct
35 Correct 91 ms 84112 KB Output is correct
36 Correct 94 ms 70336 KB Output is correct
37 Correct 96 ms 87872 KB Output is correct
38 Correct 90 ms 88016 KB Output is correct
39 Correct 3 ms 5320 KB Output is correct
40 Correct 63 ms 43072 KB Output is correct
41 Correct 93 ms 70120 KB Output is correct
42 Correct 93 ms 85468 KB Output is correct
43 Correct 94 ms 70404 KB Output is correct
44 Correct 100 ms 88080 KB Output is correct
45 Correct 86 ms 87944 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5320 KB Output is correct
2 Correct 3 ms 5320 KB Output is correct
3 Correct 3 ms 5320 KB Output is correct
4 Correct 242 ms 35064 KB Output is correct
5 Correct 914 ms 70148 KB Output is correct
6 Correct 638 ms 16072 KB Output is correct
7 Correct 933 ms 70152 KB Output is correct
8 Correct 465 ms 27744 KB Output is correct
9 Correct 871 ms 70208 KB Output is correct
10 Execution timed out 4038 ms 87940 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5320 KB Output is correct
2 Correct 3 ms 5320 KB Output is correct
3 Correct 3 ms 5320 KB Output is correct
4 Correct 242 ms 35064 KB Output is correct
5 Correct 914 ms 70148 KB Output is correct
6 Correct 638 ms 16072 KB Output is correct
7 Correct 933 ms 70152 KB Output is correct
8 Correct 465 ms 27744 KB Output is correct
9 Correct 871 ms 70208 KB Output is correct
10 Execution timed out 4038 ms 87940 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5320 KB Output is correct
2 Correct 3 ms 5320 KB Output is correct
3 Correct 1119 ms 71292 KB Output is correct
4 Execution timed out 4027 ms 88068 KB Time limit exceeded
5 Halted 0 ms 0 KB -