oj.uz

Submission #560124

# Submission time Handle Problem Language Result Execution time Memory
560124 2022-05-11T05:29:27 Z armashka Rainforest Jumps (APIO21_jumps) C++17
21 / 100
 4000 ms 20876 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define nano chrono::steady_clock::now().time_since_epoch().count()
#define uid uniform_int_distribution<int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
    
const int N = 2e5 + 10;
const int M = 2e3 + 5;
const ll inf = 1e15;
const ll mod = 998244353;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll random(ll l, ll r) { mt19937 rnd(nano); uid dist(l, r); return dist(rnd); }
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }

int n, a[N], dis[2005][2005], d[N];
vector <int> g[N];

void init(int N, vector <int> H) {
	n = N;
	for (int i = 1; i <= n; ++ i) {
		a[i] = H[i - 1];
	}
	deque <int> d;
	d.push_back(0);
	a[0] = 1e9;
	for (int i = 1; i <= n; ++ i) {
		while (d.sz && a[d.back()] <= a[i]) d.pop_back();
		if (d.back() != 0) {
			g[i].pb(d.back());
		}
		d.push_back(i);
	}
	d.clear();
	a[n + 1] = 1e9;
	d.push_back(n + 1);
	for (int i = n; i >= 1; -- i) {
		while (d.sz && a[d.back()] <= a[i]) d.pop_back();
		if (d.back() != n + 1) {
			g[i].pb(d.back());
		}
		d.push_back(i);
	}
	
	if (n <= 2000) {
		for (int i = 1; i <= n; ++ i) {
			for (int j = 1; j <= n; ++ j) dis[i][j] = 1e9;
			queue <int> q;
			q.push(i);
			dis[i][i] = 0;
			while (q.sz) {
				int v = q.front();
				q.pop();
				for (auto to : g[v]) {
					if (dis[i][to] > dis[i][v] + 1) {
						dis[i][to] = dis[i][v] + 1;
						q.push(to);
					}
				}
			}
		}
	}
}

int minimum_jumps(int A, int B, int C, int D) {
	int ans = 1e9;
	if (n <= 2000) {
		++ A; ++ B; ++ C; ++ D;
		for (int i = A; i <= B; ++ i) {
			for (int j = C; j <= D; ++ j) {
				ans = min(ans, dis[i][j]);
			}
		}
	} else {
		queue <ll> q;
		for (int i = 1; i <= n; ++ i) d[i] = 1e9;
		for (int i = A; i <= B; ++ i) q.push(i), d[i] = 0;
		while (q.sz) {
			int v = q.front();
			q.pop();
			for (auto to : g[v]) {
				if (d[to] > d[v] + 1) {
					d[to] = d[v] + 1;
					q.push(to);
				}
			}
		}
		for (int i = C; i <= D; ++ i) ans = min(ans, d[i]);
	}
	return (ans == 1e9 ? -1 : ans);
}

//signed main() {
//	init(7, {3, 2, 1, 6, 4, 5, 7});
//	cout << minimum_jumps(0, 1, 2, 2);
//}

Compilation message

jumps.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
0 / 4.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5068 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 4 ms 5072 KB Output is correct
6 Correct 6 ms 5888 KB Output is correct
7 Correct 5 ms 5840 KB Output is correct
8 Correct 5 ms 5932 KB Output is correct
9 Correct 4 ms 5712 KB Output is correct
10 Correct 5 ms 5968 KB Output is correct
11 Correct 6 ms 5968 KB Output is correct
12 Correct 5 ms 5968 KB Output is correct
13 Correct 6 ms 5968 KB Output is correct
14 Correct 5 ms 5968 KB Output is correct
15 Correct 5 ms 5968 KB Output is correct
16 Correct 8 ms 5968 KB Output is correct
17 Correct 6 ms 5968 KB Output is correct
18 Correct 4 ms 4944 KB Output is correct
19 Correct 3 ms 5072 KB Output is correct
20 Correct 7 ms 5968 KB Output is correct
21 Correct 7 ms 5968 KB Output is correct
22 Correct 5 ms 5968 KB Output is correct
23 Correct 5 ms 5968 KB Output is correct
24 Correct 4 ms 5968 KB Output is correct
25 Correct 3 ms 4944 KB Output is correct
26 Correct 3 ms 4944 KB Output is correct
27 Correct 5 ms 4944 KB Output is correct
28 Correct 6 ms 5968 KB Output is correct
29 Correct 5 ms 5968 KB Output is correct
30 Correct 4 ms 5968 KB Output is correct
31 Correct 7 ms 5968 KB Output is correct
32 Correct 5 ms 5968 KB Output is correct
33 Correct 3 ms 4944 KB Output is correct
34 Correct 4 ms 5840 KB Output is correct
35 Correct 5 ms 5968 KB Output is correct
36 Correct 4 ms 5968 KB Output is correct
37 Correct 3 ms 5968 KB Output is correct
38 Correct 5 ms 5968 KB Output is correct
39 Correct 3 ms 5968 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 3 ms 4944 KB Output is correct
42 Correct 2 ms 4944 KB Output is correct
43 Correct 3 ms 4944 KB Output is correct
44 Correct 5 ms 5072 KB Output is correct
45 Correct 6 ms 5968 KB Output is correct
46 Correct 5 ms 5840 KB Output is correct
47 Correct 5 ms 5968 KB Output is correct
48 Correct 5 ms 5712 KB Output is correct
49 Correct 6 ms 5968 KB Output is correct
50 Correct 5 ms 5968 KB Output is correct
51 Correct 6 ms 5968 KB Output is correct
52 Correct 7 ms 5968 KB Output is correct
53 Correct 5 ms 5968 KB Output is correct
54 Correct 5 ms 5968 KB Output is correct
55 Correct 5 ms 5968 KB Output is correct
56 Correct 5 ms 5948 KB Output is correct
57 Correct 3 ms 5968 KB Output is correct
58 Correct 62 ms 18384 KB Output is correct
59 Correct 97 ms 20696 KB Output is correct
60 Correct 15 ms 10960 KB Output is correct
61 Correct 86 ms 20752 KB Output is correct
62 Correct 15 ms 5968 KB Output is correct
63 Correct 95 ms 20688 KB Output is correct
64 Correct 124 ms 20744 KB Output is correct
65 Correct 105 ms 20668 KB Output is correct
66 Correct 107 ms 20688 KB Output is correct
67 Correct 109 ms 20688 KB Output is correct
68 Correct 139 ms 20688 KB Output is correct
69 Correct 79 ms 20680 KB Output is correct
70 Correct 69 ms 20748 KB Output is correct
71 Correct 3 ms 4944 KB Output is correct
72 Correct 5 ms 5072 KB Output is correct
73 Correct 6 ms 5968 KB Output is correct
74 Correct 6 ms 5968 KB Output is correct
75 Correct 7 ms 5968 KB Output is correct
76 Correct 5 ms 5968 KB Output is correct
77 Correct 6 ms 5968 KB Output is correct
78 Correct 4 ms 4944 KB Output is correct
79 Correct 3 ms 4944 KB Output is correct
80 Correct 3 ms 4944 KB Output is correct
81 Correct 4 ms 5968 KB Output is correct
82 Correct 5 ms 5968 KB Output is correct
83 Correct 5 ms 5968 KB Output is correct
84 Correct 5 ms 5968 KB Output is correct
85 Correct 5 ms 5968 KB Output is correct
86 Correct 3 ms 4944 KB Output is correct
87 Correct 3 ms 5712 KB Output is correct
88 Correct 3 ms 5968 KB Output is correct
89 Correct 4 ms 5968 KB Output is correct
90 Correct 3 ms 5968 KB Output is correct
91 Correct 4 ms 5968 KB Output is correct
92 Correct 3 ms 5968 KB Output is correct
93 Correct 3 ms 5968 KB Output is correct
94 Correct 6 ms 6096 KB Output is correct
95 Correct 33 ms 20688 KB Output is correct
96 Correct 48 ms 20676 KB Output is correct
97 Correct 40 ms 20688 KB Output is correct
98 Correct 52 ms 20716 KB Output is correct
99 Correct 53 ms 20708 KB Output is correct
100 Correct 4 ms 5968 KB Output is correct
101 Correct 6 ms 10192 KB Output is correct
102 Correct 25 ms 20704 KB Output is correct
103 Correct 49 ms 20780 KB Output is correct
104 Correct 33 ms 20788 KB Output is correct
105 Correct 48 ms 20680 KB Output is correct
106 Correct 48 ms 20672 KB Output is correct
107 Correct 3 ms 5968 KB Output is correct
108 Correct 7 ms 12060 KB Output is correct
109 Correct 11 ms 20688 KB Output is correct
110 Correct 32 ms 20716 KB Output is correct
111 Correct 11 ms 20876 KB Output is correct
112 Correct 32 ms 20688 KB Output is correct
113 Correct 37 ms 20680 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 38 ms 12516 KB Output is correct
6 Correct 57 ms 14084 KB Output is correct
7 Correct 32 ms 9360 KB Output is correct
8 Correct 66 ms 15080 KB Output is correct
9 Correct 10 ms 6396 KB Output is correct
10 Correct 66 ms 14068 KB Output is correct
11 Incorrect 39 ms 14648 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Incorrect 688 ms 8856 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Incorrect 688 ms 8856 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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