oj.uz

답안 #429853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
429853 2021-06-16T10:03:55 Z hhhhaura 밀림 점프 (APIO21_jumps) C++14
23 / 100
 1904 ms 76348 KB 
#define wiwihorz
#include "jumps.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define ceil(a, b) ((a + b - 1) / (b))
#define all(x) x.begin(), x.end()

#define MOD 1000000007
#define eps (1e-9)
#define INF 1000000000
using namespace std;

#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

#ifdef wiwihorz
#define print(a...) kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
void kout() {cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
int n, lg;
vector<int> L, R, h;
vector<vector<int>> l, r;
vector<vector<pii>> sp;
int query(int L, int R) {
	if(L > R) return -1;
	int cur = 31 - __builtin_clz(R - L + 1);
	pii ans = max(sp[cur][L], sp[cur][R - (1 << cur) + 1]);
	return ans.second;
}
void init(int N, vector<int> H) {
	n = N, lg = 32 - __builtin_clz(n);
	set<int> s; vector<int> a(n, 0);
	L.assign(n + 2, 0);
	R.assign(n + 2, 0);
	h.assign(n + 2, 0);
	h[0] = h[n + 1] = INF;
	rep(i, 0, n - 1) h[i + 1] = H[i];
	rep(i, 1, n) a[i - 1] = i;
	sort(all(a), [](int x, int y) { return h[x] > h[y]; });
	s.insert(n + 1), s.insert(0);
	for(auto i : a) {
		auto it = s.lower_bound(i);
		int x = *it, y = *prev(it);
		if(h[x] < h[y]) swap(x, y);
		R[i] = x, L[i] = y;
		s.insert(i);
	}
	l.assign(lg + 1, vector<int>(n + 2, 0));
	r.assign(lg + 1, vector<int>(n + 2, 0));
	sp.assign(lg + 1, vector<pii>(n + 2, {0, 0}));
	L[0] = R[0] = 0, L[n + 1] = R[n + 1] = n + 1;
	rep(i, 0, n + 1) {
		sp[0][i] = {h[i], i};
		l[0][i] = L[i];
		r[0][i] = R[i];
	}
	rep(i, 1, lg) rep(j, 0, n + 1) {
		sp[i][j] = max(sp[i - 1][j], sp[i - 1][j + (1 << (i - 1))]);
		l[i][j] = l[i - 1][l[i - 1][j]];
		r[i][j] = r[i - 1][r[i - 1][j]];

	}
	return;
}
/*
7 3
3 2 1 6 4 5 7
4 4 6 6
1 3 5 6
0 1 2 2 
*/
int minimum_jumps(int A, int B, int C, int D) {
	A ++ ,B ++ , C ++, D ++;	
/*	int st, ll = A - 1, rr = B + 1;
	int x = query(C, D), ans = 0;
	while(rr - ll > 1) {
		int mid = (ll + rr) / 2;
		if(h[x] < h[mid]) ll = mid;
		else rr = mid;
	} 
*/
	if(A != B || C != D) return -1;
	int ans = 0, st = A;
	rrep(i, 0, lg) if(h[r[i][st]] <= h[C]) {
		st = r[i][st], ans += (1 << i);
	}
	rrep(i, 0, lg) if(h[l[i][st]] <= h[C]) {
		st = l[i][st], ans += (1 << i);
	}
	if(st == C) return ans;
	return -1;
}

Compilation message

jumps.cpp:5: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    5 | #pragma loop-opt(on)
      | 
jumps.cpp:23:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
      |             ^~~~
jumps.cpp:23:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
      |                     ^~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Incorrect 240 ms 60752 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

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

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 326 ms 33624 KB Output is correct
5 Correct 1128 ms 76268 KB Output is correct
6 Correct 595 ms 11836 KB Output is correct
7 Correct 1385 ms 76292 KB Output is correct
8 Correct 572 ms 25352 KB Output is correct
9 Correct 1306 ms 76336 KB Output is correct
10 Correct 1523 ms 76264 KB Output is correct
11 Correct 1622 ms 76276 KB Output is correct
12 Correct 1613 ms 76188 KB Output is correct
13 Correct 1738 ms 76200 KB Output is correct
14 Correct 1668 ms 76232 KB Output is correct
15 Correct 1519 ms 76268 KB Output is correct
16 Correct 1358 ms 76252 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 ms 200 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 13 ms 712 KB Output is correct
28 Correct 29 ms 712 KB Output is correct
29 Correct 15 ms 824 KB Output is correct
30 Correct 31 ms 712 KB Output is correct
31 Correct 28 ms 712 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 137 ms 42440 KB Output is correct
34 Correct 323 ms 76176 KB Output is correct
35 Correct 163 ms 76284 KB Output is correct
36 Correct 244 ms 76296 KB Output is correct
37 Correct 238 ms 76204 KB Output is correct
38 Correct 191 ms 76288 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 326 ms 33624 KB Output is correct
5 Correct 1128 ms 76268 KB Output is correct
6 Correct 595 ms 11836 KB Output is correct
7 Correct 1385 ms 76292 KB Output is correct
8 Correct 572 ms 25352 KB Output is correct
9 Correct 1306 ms 76336 KB Output is correct
10 Correct 1523 ms 76264 KB Output is correct
11 Correct 1622 ms 76276 KB Output is correct
12 Correct 1613 ms 76188 KB Output is correct
13 Correct 1738 ms 76200 KB Output is correct
14 Correct 1668 ms 76232 KB Output is correct
15 Correct 1519 ms 76268 KB Output is correct
16 Correct 1358 ms 76252 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 ms 200 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 13 ms 712 KB Output is correct
28 Correct 29 ms 712 KB Output is correct
29 Correct 15 ms 824 KB Output is correct
30 Correct 31 ms 712 KB Output is correct
31 Correct 28 ms 712 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 137 ms 42440 KB Output is correct
34 Correct 323 ms 76176 KB Output is correct
35 Correct 163 ms 76284 KB Output is correct
36 Correct 244 ms 76296 KB Output is correct
37 Correct 238 ms 76204 KB Output is correct
38 Correct 191 ms 76288 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 370 ms 33580 KB Output is correct
43 Correct 1358 ms 76348 KB Output is correct
44 Correct 871 ms 11788 KB Output is correct
45 Correct 1659 ms 76292 KB Output is correct
46 Correct 926 ms 25380 KB Output is correct
47 Correct 1374 ms 76276 KB Output is correct
48 Correct 1490 ms 76312 KB Output is correct
49 Correct 1405 ms 76208 KB Output is correct
50 Correct 1904 ms 76292 KB Output is correct
51 Correct 1209 ms 76348 KB Output is correct
52 Correct 1566 ms 76288 KB Output is correct
53 Correct 1350 ms 76296 KB Output is correct
54 Correct 1324 ms 76300 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Incorrect 539 ms 76000 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Incorrect 240 ms 60752 KB Output isn't correct
4 Halted 0 ms 0 KB -