oj.uz

답안 #916178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916178 2024-01-25T12:35:39 Z KiaRez 밀림 점프 (APIO21_jumps) C++17
27 / 100
 883 ms 60948 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 2e5+23, lg = 18;

int n, l[N], r[N], f[lg][N], f2[lg][N], spl[lg][N], spr[lg][N], h[N];
void init(int _n, vector<int> _h) {
	n=_n; for(int i=1; i<=n; i++) h[i] = _h[i-1];

	h[0] = 1e9+1, h[n+1] = 1e9+2;
	for(int i=1; i<=n; i++) {
		l[i] = i-1;
		while(h[i] > h[l[i]]) l[i] = l[l[i]];
		spl[0][i] = i;
		for(int j=1; j<lg; j++) {
			int x=spl[j-1][i], y=spl[j-1][max(0,i-(1<<(j-1)))];
			spl[j][i] = (h[x]>h[y] ? x : y);
		}
	}

	for(int i=0; i<lg; i++) f2[i][n+1] = f[i][n+1] = spr[i][n+1] = n+1;
	for(int i=n; i>=1; i--) {
		r[i] = i+1;
		while(h[i] > h[r[i]]) r[i] = r[r[i]];
		
		if(h[r[i]] > h[l[i]]) f[0][i] = r[i], f2[0][i] = r[i];
		else f[0][i] = l[i], f2[0][i] = r[i];
		
		spr[0][i] = i;
		for(int j=1; j<lg; j++) {
			int x=spr[j-1][i], y=spr[j-1][min(n+1,i+(1<<(j-1)))];
			spr[j][i] = (h[x]>h[y] ? x : y);
		}
	}

	for(int i=1; i<lg; i++) {
		for(int j=1; j<=n; j++) {
			f[i][j] = f[i-1][f[i-1][j]];
			f2[i][j] = f2[i-1][f2[i-1][j]];
		}
	}
}

int minimum_jumps(int a, int b, int c, int d) {
	a++, b++, c++, d++;
	int mxv=n+2, mxu=b, tmp=c, ans=0;
	for(int i=lg-1; i>=0; i--) {
		if(tmp+(1<<i)-1 <= d) mxv = (h[mxv]>h[spr[i][tmp]] ? mxv : spr[i][tmp]), tmp += (1<<i);
	}
	tmp = b;
	for(int i=lg-1; i>=0; i--) {
		if(spl[i][mxu] >= a && h[spl[i][mxu]] < h[mxv]) {
			mxu = spl[i][tmp];
		}
	}

	for(int i=lg-1; i>=0; i--) {
		if(h[f[i][mxu]] < h[mxv] && f[i][mxu] < c && r[f[i][mxu]] < c) ans += (1<<i), mxu = f[i][mxu];
	}
	if(r[mxu] < c && f[0][mxu] < c && h[f[0][mxu]] < h[mxv]) {
		ans ++; mxu = f[0][mxu];
	}
	for(int i=lg-1; i>=0; i--) {
		if(f2[i][mxu] < c) mxu = f2[i][mxu], ans += (1<<i);
	}

	if(mxu >= c && mxu <= d) return ans;
	int res = f2[0][mxu];
	if(res>=c && res<=d) {
		return ans+1;
	}
	return -1;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 57688 KB Output is correct
2 Correct 9 ms 57688 KB Output is correct
3 Correct 105 ms 60080 KB Output is correct
4 Correct 850 ms 60616 KB Output is correct
5 Correct 648 ms 59212 KB Output is correct
6 Correct 883 ms 60716 KB Output is correct
7 Correct 594 ms 59608 KB Output is correct
8 Correct 809 ms 60516 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 57688 KB Output is correct
2 Correct 9 ms 57688 KB Output is correct
3 Correct 9 ms 57688 KB Output is correct
4 Correct 8 ms 57688 KB Output is correct
5 Incorrect 8 ms 57696 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 57688 KB Output is correct
2 Correct 9 ms 57688 KB Output is correct
3 Correct 9 ms 57688 KB Output is correct
4 Correct 8 ms 57688 KB Output is correct
5 Incorrect 8 ms 57696 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 57688 KB Output is correct
2 Correct 8 ms 57896 KB Output is correct
3 Correct 8 ms 57688 KB Output is correct
4 Correct 8 ms 57688 KB Output is correct
5 Incorrect 53 ms 60092 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 57892 KB Output is correct
2 Correct 8 ms 57688 KB Output is correct
3 Correct 8 ms 57684 KB Output is correct
4 Correct 160 ms 58912 KB Output is correct
5 Correct 670 ms 60700 KB Output is correct
6 Correct 416 ms 58180 KB Output is correct
7 Correct 674 ms 60544 KB Output is correct
8 Correct 368 ms 58836 KB Output is correct
9 Correct 661 ms 60620 KB Output is correct
10 Correct 820 ms 60548 KB Output is correct
11 Correct 744 ms 60700 KB Output is correct
12 Correct 761 ms 60616 KB Output is correct
13 Correct 743 ms 60624 KB Output is correct
14 Correct 820 ms 60628 KB Output is correct
15 Correct 692 ms 60620 KB Output is correct
16 Correct 691 ms 60616 KB Output is correct
17 Correct 10 ms 57944 KB Output is correct
18 Correct 8 ms 57688 KB Output is correct
19 Correct 10 ms 57688 KB Output is correct
20 Correct 8 ms 57876 KB Output is correct
21 Correct 9 ms 57688 KB Output is correct
22 Correct 9 ms 57864 KB Output is correct
23 Correct 10 ms 57688 KB Output is correct
24 Correct 9 ms 57688 KB Output is correct
25 Correct 8 ms 57868 KB Output is correct
26 Correct 9 ms 57688 KB Output is correct
27 Correct 19 ms 57688 KB Output is correct
28 Correct 17 ms 57688 KB Output is correct
29 Correct 18 ms 57944 KB Output is correct
30 Correct 16 ms 57688 KB Output is correct
31 Correct 16 ms 57688 KB Output is correct
32 Correct 8 ms 57688 KB Output is correct
33 Correct 30 ms 59236 KB Output is correct
34 Correct 48 ms 60492 KB Output is correct
35 Correct 46 ms 60612 KB Output is correct
36 Correct 54 ms 60596 KB Output is correct
37 Correct 49 ms 60628 KB Output is correct
38 Correct 54 ms 60620 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 57892 KB Output is correct
2 Correct 8 ms 57688 KB Output is correct
3 Correct 8 ms 57684 KB Output is correct
4 Correct 160 ms 58912 KB Output is correct
5 Correct 670 ms 60700 KB Output is correct
6 Correct 416 ms 58180 KB Output is correct
7 Correct 674 ms 60544 KB Output is correct
8 Correct 368 ms 58836 KB Output is correct
9 Correct 661 ms 60620 KB Output is correct
10 Correct 820 ms 60548 KB Output is correct
11 Correct 744 ms 60700 KB Output is correct
12 Correct 761 ms 60616 KB Output is correct
13 Correct 743 ms 60624 KB Output is correct
14 Correct 820 ms 60628 KB Output is correct
15 Correct 692 ms 60620 KB Output is correct
16 Correct 691 ms 60616 KB Output is correct
17 Correct 10 ms 57944 KB Output is correct
18 Correct 8 ms 57688 KB Output is correct
19 Correct 10 ms 57688 KB Output is correct
20 Correct 8 ms 57876 KB Output is correct
21 Correct 9 ms 57688 KB Output is correct
22 Correct 9 ms 57864 KB Output is correct
23 Correct 10 ms 57688 KB Output is correct
24 Correct 9 ms 57688 KB Output is correct
25 Correct 8 ms 57868 KB Output is correct
26 Correct 9 ms 57688 KB Output is correct
27 Correct 19 ms 57688 KB Output is correct
28 Correct 17 ms 57688 KB Output is correct
29 Correct 18 ms 57944 KB Output is correct
30 Correct 16 ms 57688 KB Output is correct
31 Correct 16 ms 57688 KB Output is correct
32 Correct 8 ms 57688 KB Output is correct
33 Correct 30 ms 59236 KB Output is correct
34 Correct 48 ms 60492 KB Output is correct
35 Correct 46 ms 60612 KB Output is correct
36 Correct 54 ms 60596 KB Output is correct
37 Correct 49 ms 60628 KB Output is correct
38 Correct 54 ms 60620 KB Output is correct
39 Correct 8 ms 57688 KB Output is correct
40 Correct 9 ms 57688 KB Output is correct
41 Correct 8 ms 57688 KB Output is correct
42 Correct 166 ms 58912 KB Output is correct
43 Correct 678 ms 60572 KB Output is correct
44 Correct 392 ms 58248 KB Output is correct
45 Correct 715 ms 60628 KB Output is correct
46 Correct 405 ms 58836 KB Output is correct
47 Correct 683 ms 60600 KB Output is correct
48 Correct 744 ms 60568 KB Output is correct
49 Correct 822 ms 60572 KB Output is correct
50 Correct 803 ms 60596 KB Output is correct
51 Correct 754 ms 60852 KB Output is correct
52 Correct 858 ms 60948 KB Output is correct
53 Correct 684 ms 60616 KB Output is correct
54 Correct 668 ms 60544 KB Output is correct
55 Correct 9 ms 57688 KB Output is correct
56 Incorrect 81 ms 60600 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 57688 KB Output is correct
2 Correct 9 ms 57688 KB Output is correct
3 Correct 105 ms 60080 KB Output is correct
4 Correct 850 ms 60616 KB Output is correct
5 Correct 648 ms 59212 KB Output is correct
6 Correct 883 ms 60716 KB Output is correct
7 Correct 594 ms 59608 KB Output is correct
8 Correct 809 ms 60516 KB Output is correct
9 Correct 8 ms 57688 KB Output is correct
10 Correct 9 ms 57688 KB Output is correct
11 Correct 9 ms 57688 KB Output is correct
12 Correct 8 ms 57688 KB Output is correct
13 Incorrect 8 ms 57696 KB Output isn't correct
14 Halted 0 ms 0 KB -