oj.uz

답안 #418072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
418072 2021-06-05T03:44:37 Z 8e7 밀림 점프 (APIO21_jumps) C++14
48 / 100
 1262 ms 59832 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 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];
		if (par[i] == lef[i]) to[0][i] = rig[i];
		else to[0][i] = lef[i];
	}
	dep[N] = -1, to[0][N] = anc[0][N] = N;
	//pary(to[0], to[0] + 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]];
	}
	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;
	for (int i = 17;i >= 0;i--) {
		if (dep[to[i][cur]] >= dep[t] && to[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] && anc[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[C], A), r = min(rig[C], 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:71:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |    for (int j = 0;j < po.size() - 1;j++) {
      |                   ~~^~~~~~~~~~~~~~~
jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:142:6: warning: unused variable 'ret' [-Wunused-variable]
  142 |  int ret = -1;
      |      ^~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 3 ms 5192 KB Output is correct
3 Correct 169 ms 48704 KB Output is correct
4 Correct 1153 ms 59720 KB Output is correct
5 Correct 1044 ms 32624 KB Output is correct
6 Correct 1245 ms 59712 KB Output is correct
7 Correct 948 ms 42484 KB Output is correct
8 Correct 1176 ms 59764 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

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

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 4 ms 5192 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 244 ms 21992 KB Output is correct
5 Correct 923 ms 41988 KB Output is correct
6 Correct 616 ms 11256 KB Output is correct
7 Correct 881 ms 41920 KB Output is correct
8 Correct 539 ms 17908 KB Output is correct
9 Correct 860 ms 42000 KB Output is correct
10 Correct 1100 ms 59768 KB Output is correct
11 Correct 1133 ms 58448 KB Output is correct
12 Correct 1141 ms 57536 KB Output is correct
13 Correct 849 ms 42344 KB Output is correct
14 Correct 1049 ms 59712 KB Output is correct
15 Correct 769 ms 59800 KB Output is correct
16 Correct 966 ms 59716 KB Output is correct
17 Correct 3 ms 5192 KB Output is correct
18 Correct 3 ms 5192 KB Output is correct
19 Correct 4 ms 5192 KB Output is correct
20 Correct 6 ms 5192 KB Output is correct
21 Correct 4 ms 5192 KB Output is correct
22 Correct 5 ms 5192 KB Output is correct
23 Correct 4 ms 5192 KB Output is correct
24 Correct 4 ms 5192 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 4 ms 5320 KB Output is correct
27 Correct 19 ms 5448 KB Output is correct
28 Correct 21 ms 5704 KB Output is correct
29 Correct 24 ms 5448 KB Output is correct
30 Correct 17 ms 5704 KB Output is correct
31 Correct 22 ms 5704 KB Output is correct
32 Correct 3 ms 5192 KB Output is correct
33 Correct 43 ms 26480 KB Output is correct
34 Correct 87 ms 42012 KB Output is correct
35 Correct 85 ms 57280 KB Output is correct
36 Correct 74 ms 42228 KB Output is correct
37 Correct 76 ms 59760 KB Output is correct
38 Correct 68 ms 59784 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 4 ms 5192 KB Output is correct
3 Correct 3 ms 5192 KB Output is correct
4 Correct 244 ms 21992 KB Output is correct
5 Correct 923 ms 41988 KB Output is correct
6 Correct 616 ms 11256 KB Output is correct
7 Correct 881 ms 41920 KB Output is correct
8 Correct 539 ms 17908 KB Output is correct
9 Correct 860 ms 42000 KB Output is correct
10 Correct 1100 ms 59768 KB Output is correct
11 Correct 1133 ms 58448 KB Output is correct
12 Correct 1141 ms 57536 KB Output is correct
13 Correct 849 ms 42344 KB Output is correct
14 Correct 1049 ms 59712 KB Output is correct
15 Correct 769 ms 59800 KB Output is correct
16 Correct 966 ms 59716 KB Output is correct
17 Correct 3 ms 5192 KB Output is correct
18 Correct 3 ms 5192 KB Output is correct
19 Correct 4 ms 5192 KB Output is correct
20 Correct 6 ms 5192 KB Output is correct
21 Correct 4 ms 5192 KB Output is correct
22 Correct 5 ms 5192 KB Output is correct
23 Correct 4 ms 5192 KB Output is correct
24 Correct 4 ms 5192 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 4 ms 5320 KB Output is correct
27 Correct 19 ms 5448 KB Output is correct
28 Correct 21 ms 5704 KB Output is correct
29 Correct 24 ms 5448 KB Output is correct
30 Correct 17 ms 5704 KB Output is correct
31 Correct 22 ms 5704 KB Output is correct
32 Correct 3 ms 5192 KB Output is correct
33 Correct 43 ms 26480 KB Output is correct
34 Correct 87 ms 42012 KB Output is correct
35 Correct 85 ms 57280 KB Output is correct
36 Correct 74 ms 42228 KB Output is correct
37 Correct 76 ms 59760 KB Output is correct
38 Correct 68 ms 59784 KB Output is correct
39 Correct 3 ms 5192 KB Output is correct
40 Correct 3 ms 5192 KB Output is correct
41 Correct 3 ms 5192 KB Output is correct
42 Correct 228 ms 22080 KB Output is correct
43 Correct 957 ms 41968 KB Output is correct
44 Correct 612 ms 11208 KB Output is correct
45 Correct 904 ms 41992 KB Output is correct
46 Correct 350 ms 17836 KB Output is correct
47 Correct 917 ms 41944 KB Output is correct
48 Correct 1112 ms 59712 KB Output is correct
49 Correct 1057 ms 58484 KB Output is correct
50 Correct 1066 ms 57588 KB Output is correct
51 Correct 869 ms 42100 KB Output is correct
52 Correct 999 ms 59712 KB Output is correct
53 Correct 923 ms 59776 KB Output is correct
54 Correct 822 ms 59764 KB Output is correct
55 Correct 3 ms 5192 KB Output is correct
56 Correct 127 ms 42008 KB Output is correct
57 Correct 856 ms 41972 KB Output is correct
58 Correct 449 ms 11592 KB Output is correct
59 Correct 918 ms 41920 KB Output is correct
60 Correct 378 ms 18240 KB Output is correct
61 Correct 921 ms 41920 KB Output is correct
62 Correct 1262 ms 59768 KB Output is correct
63 Correct 1061 ms 55796 KB Output is correct
64 Correct 1146 ms 53956 KB Output is correct
65 Correct 830 ms 42200 KB Output is correct
66 Correct 1099 ms 59832 KB Output is correct
67 Correct 985 ms 59796 KB Output is correct
68 Correct 875 ms 59712 KB Output is correct
69 Correct 4 ms 5192 KB Output is correct
70 Correct 3 ms 5192 KB Output is correct
71 Correct 5 ms 5192 KB Output is correct
72 Correct 5 ms 5192 KB Output is correct
73 Correct 5 ms 5192 KB Output is correct
74 Correct 5 ms 5192 KB Output is correct
75 Correct 5 ms 5192 KB Output is correct
76 Correct 3 ms 5104 KB Output is correct
77 Correct 3 ms 5192 KB Output is correct
78 Correct 4 ms 5192 KB Output is correct
79 Correct 4 ms 5192 KB Output is correct
80 Correct 5 ms 5192 KB Output is correct
81 Correct 4 ms 5192 KB Output is correct
82 Correct 5 ms 5192 KB Output is correct
83 Correct 5 ms 5192 KB Output is correct
84 Correct 3 ms 5192 KB Output is correct
85 Correct 6 ms 5192 KB Output is correct
86 Correct 20 ms 5448 KB Output is correct
87 Correct 22 ms 5576 KB Output is correct
88 Correct 24 ms 5448 KB Output is correct
89 Correct 18 ms 5660 KB Output is correct
90 Correct 24 ms 5704 KB Output is correct
91 Correct 4 ms 5192 KB Output is correct
92 Correct 4 ms 5320 KB Output is correct
93 Correct 22 ms 5448 KB Output is correct
94 Correct 20 ms 5704 KB Output is correct
95 Correct 20 ms 5448 KB Output is correct
96 Correct 23 ms 5704 KB Output is correct
97 Correct 21 ms 5704 KB Output is correct
98 Correct 3 ms 5192 KB Output is correct
99 Correct 75 ms 41956 KB Output is correct
100 Correct 77 ms 41972 KB Output is correct
101 Correct 72 ms 56044 KB Output is correct
102 Correct 89 ms 42100 KB Output is correct
103 Correct 87 ms 59784 KB Output is correct
104 Correct 73 ms 59720 KB Output is correct
105 Correct 3 ms 5192 KB Output is correct
106 Correct 49 ms 26596 KB Output is correct
107 Correct 89 ms 41968 KB Output is correct
108 Correct 72 ms 57436 KB Output is correct
109 Correct 74 ms 42116 KB Output is correct
110 Correct 77 ms 59692 KB Output is correct
111 Correct 69 ms 59732 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5192 KB Output is correct
2 Correct 3 ms 5192 KB Output is correct
3 Correct 169 ms 48704 KB Output is correct
4 Correct 1153 ms 59720 KB Output is correct
5 Correct 1044 ms 32624 KB Output is correct
6 Correct 1245 ms 59712 KB Output is correct
7 Correct 948 ms 42484 KB Output is correct
8 Correct 1176 ms 59764 KB Output is correct
9 Incorrect 3 ms 5192 KB Output isn't correct
10 Halted 0 ms 0 KB -