# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413337 | 2021-05-28T13:55:18 Z | mat_v | Rainforest Jumps (APIO21_jumps) | C++14 | 4000 ms | 51176 KB |
#include "jumps.h" #include <bits/stdc++.h> #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i)) #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i)) using namespace std; int n; int niz[200005]; int levo[200005][20]; int desno[200005][20]; int pravi[200005][20]; int poz[200005]; void init(int N, std::vector<int> H) { n = N; ff(i,0,n - 1){ niz[i + 1] = H[i]; poz[niz[i + 1]] = i+1; } stack<int> s; ff(i,1,n){ while(!s.empty() && niz[s.top()] < niz[i])s.pop(); if(!s.empty())levo[i][0] = s.top(); s.push(i); } while(!s.empty())s.pop(); fb(i,n,1){ while(!s.empty() && niz[s.top()] < niz[i])s.pop(); if(!s.empty())desno[i][0] = s.top(); s.push(i); } fb(i,n,1){ ff(j,1,18)desno[i][j] = desno[desno[i][j - 1]][j - 1]; } ff(i,1,n){ ff(j,1,18)levo[i][j] = levo[levo[i][j - 1]][j - 1]; } fb(i,n - 1,1){ int sta = poz[i]; int lv = levo[sta][0], rv = desno[sta][0]; if(niz[lv] > niz[rv])pravi[sta][0] = lv; else pravi[sta][0] = rv; ff(j,1,18)pravi[sta][j] = pravi[pravi[sta][j - 1]][j - 1]; } } int dist(int x, int y){ if(niz[y] < niz[x])return -1; int ans = 0; int lv = x; int poc = y; fb(j,18,0){ if(pravi[lv][j] && niz[pravi[lv][j]] < niz[poc]){ ans += (1<<j); lv = pravi[lv][j]; } } fb(j,18,0){ if(desno[lv][j] && niz[desno[lv][j]] < niz[poc]){ ans += (1<<j); lv = desno[lv][j]; } } if(desno[lv][0] == poc)return ans+1; return -1; } int minimum_jumps(int A, int B, int C, int D) { A++; B++; C++; D++; int l1,r1,l2,r2; l1 = A, r1 = B, l2 = C, r2 = D; int tr = l2; fb(j,18,0){ if(desno[tr][j] && desno[tr][j] <= r2)tr = desno[tr][j]; } int val = niz[tr]; int lv = r1; fb(j,18,0){ if(levo[lv][j] && levo[lv][j] >= l1 && niz[levo[lv][j]] < val)lv = levo[lv][j]; } if(niz[lv] > val)return -1; int poc = l2; ff(j,l2,r2){ if(niz[j] > niz[lv]){ poc = j; break; } } if(niz[poc] < niz[lv])poc = desno[poc][0]; int ans = 1e9; ff(i,l1,r1){ int kurac = l2; ff(j,l2,r2){ if(niz[j] > niz[i]){ kurac = j; break; } } int ppp = dist(i, kurac); if(ppp == -1)continue; if(ppp>0)ans = min(ans, ppp); } if(ans == 1e9)ans = -1; return ans; return 0; } /* 7 3 3 2 1 6 4 5 7 4 4 6 6 1 3 5 6 0 1 2 2 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 200 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Execution timed out | 4099 ms | 40744 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 200 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Correct | 1 ms | 200 KB | Output is correct |
4 | Correct | 1 ms | 288 KB | Output is correct |
5 | Correct | 5 ms | 200 KB | Output is correct |
6 | Incorrect | 4 ms | 328 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 200 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Correct | 1 ms | 200 KB | Output is correct |
4 | Correct | 1 ms | 288 KB | Output is correct |
5 | Correct | 5 ms | 200 KB | Output is correct |
6 | Incorrect | 4 ms | 328 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 376 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Correct | 1 ms | 200 KB | Output is correct |
4 | Correct | 1 ms | 200 KB | Output is correct |
5 | Correct | 132 ms | 40508 KB | Output is correct |
6 | Correct | 171 ms | 50360 KB | Output is correct |
7 | Correct | 70 ms | 25888 KB | Output is correct |
8 | Correct | 164 ms | 50388 KB | Output is correct |
9 | Correct | 22 ms | 7804 KB | Output is correct |
10 | Correct | 167 ms | 50476 KB | Output is correct |
11 | Correct | 157 ms | 51096 KB | Output is correct |
12 | Correct | 155 ms | 51016 KB | Output is correct |
13 | Incorrect | 110 ms | 50944 KB | Output isn't correct |
14 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 372 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Correct | 1 ms | 328 KB | Output is correct |
4 | Correct | 289 ms | 23184 KB | Output is correct |
5 | Correct | 1461 ms | 50348 KB | Output is correct |
6 | Correct | 758 ms | 8564 KB | Output is correct |
7 | Correct | 1435 ms | 50412 KB | Output is correct |
8 | Correct | 730 ms | 17468 KB | Output is correct |
9 | Correct | 1200 ms | 50344 KB | Output is correct |
10 | Correct | 1512 ms | 51116 KB | Output is correct |
11 | Correct | 1506 ms | 51116 KB | Output is correct |
12 | Correct | 1182 ms | 50996 KB | Output is correct |
13 | Correct | 922 ms | 50380 KB | Output is correct |
14 | Correct | 1313 ms | 50760 KB | Output is correct |
15 | Correct | 1081 ms | 51132 KB | Output is correct |
16 | Correct | 1184 ms | 51104 KB | Output is correct |
17 | Correct | 1 ms | 200 KB | Output is correct |
18 | Correct | 1 ms | 200 KB | Output is correct |
19 | Correct | 1 ms | 200 KB | Output is correct |
20 | Correct | 3 ms | 328 KB | Output is correct |
21 | Correct | 4 ms | 328 KB | Output is correct |
22 | Correct | 4 ms | 328 KB | Output is correct |
23 | Correct | 4 ms | 328 KB | Output is correct |
24 | Correct | 3 ms | 328 KB | Output is correct |
25 | Correct | 1 ms | 328 KB | Output is correct |
26 | Correct | 2 ms | 456 KB | Output is correct |
27 | Correct | 23 ms | 712 KB | Output is correct |
28 | Correct | 30 ms | 712 KB | Output is correct |
29 | Correct | 31 ms | 712 KB | Output is correct |
30 | Correct | 29 ms | 712 KB | Output is correct |
31 | Correct | 26 ms | 712 KB | Output is correct |
32 | Correct | 1 ms | 200 KB | Output is correct |
33 | Correct | 82 ms | 29212 KB | Output is correct |
34 | Correct | 153 ms | 50328 KB | Output is correct |
35 | Correct | 101 ms | 51136 KB | Output is correct |
36 | Correct | 133 ms | 50368 KB | Output is correct |
37 | Correct | 119 ms | 50816 KB | Output is correct |
38 | Correct | 105 ms | 51104 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 372 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Correct | 1 ms | 328 KB | Output is correct |
4 | Correct | 289 ms | 23184 KB | Output is correct |
5 | Correct | 1461 ms | 50348 KB | Output is correct |
6 | Correct | 758 ms | 8564 KB | Output is correct |
7 | Correct | 1435 ms | 50412 KB | Output is correct |
8 | Correct | 730 ms | 17468 KB | Output is correct |
9 | Correct | 1200 ms | 50344 KB | Output is correct |
10 | Correct | 1512 ms | 51116 KB | Output is correct |
11 | Correct | 1506 ms | 51116 KB | Output is correct |
12 | Correct | 1182 ms | 50996 KB | Output is correct |
13 | Correct | 922 ms | 50380 KB | Output is correct |
14 | Correct | 1313 ms | 50760 KB | Output is correct |
15 | Correct | 1081 ms | 51132 KB | Output is correct |
16 | Correct | 1184 ms | 51104 KB | Output is correct |
17 | Correct | 1 ms | 200 KB | Output is correct |
18 | Correct | 1 ms | 200 KB | Output is correct |
19 | Correct | 1 ms | 200 KB | Output is correct |
20 | Correct | 3 ms | 328 KB | Output is correct |
21 | Correct | 4 ms | 328 KB | Output is correct |
22 | Correct | 4 ms | 328 KB | Output is correct |
23 | Correct | 4 ms | 328 KB | Output is correct |
24 | Correct | 3 ms | 328 KB | Output is correct |
25 | Correct | 1 ms | 328 KB | Output is correct |
26 | Correct | 2 ms | 456 KB | Output is correct |
27 | Correct | 23 ms | 712 KB | Output is correct |
28 | Correct | 30 ms | 712 KB | Output is correct |
29 | Correct | 31 ms | 712 KB | Output is correct |
30 | Correct | 29 ms | 712 KB | Output is correct |
31 | Correct | 26 ms | 712 KB | Output is correct |
32 | Correct | 1 ms | 200 KB | Output is correct |
33 | Correct | 82 ms | 29212 KB | Output is correct |
34 | Correct | 153 ms | 50328 KB | Output is correct |
35 | Correct | 101 ms | 51136 KB | Output is correct |
36 | Correct | 133 ms | 50368 KB | Output is correct |
37 | Correct | 119 ms | 50816 KB | Output is correct |
38 | Correct | 105 ms | 51104 KB | Output is correct |
39 | Correct | 1 ms | 328 KB | Output is correct |
40 | Correct | 1 ms | 200 KB | Output is correct |
41 | Correct | 1 ms | 200 KB | Output is correct |
42 | Correct | 312 ms | 23172 KB | Output is correct |
43 | Correct | 976 ms | 50368 KB | Output is correct |
44 | Correct | 683 ms | 8520 KB | Output is correct |
45 | Correct | 1199 ms | 50368 KB | Output is correct |
46 | Correct | 734 ms | 17608 KB | Output is correct |
47 | Correct | 1194 ms | 50368 KB | Output is correct |
48 | Correct | 1279 ms | 51120 KB | Output is correct |
49 | Correct | 1229 ms | 51136 KB | Output is correct |
50 | Correct | 1401 ms | 50976 KB | Output is correct |
51 | Correct | 1355 ms | 50332 KB | Output is correct |
52 | Correct | 1394 ms | 50700 KB | Output is correct |
53 | Correct | 1099 ms | 51176 KB | Output is correct |
54 | Correct | 1092 ms | 51116 KB | Output is correct |
55 | Correct | 1 ms | 200 KB | Output is correct |
56 | Execution timed out | 4069 ms | 50196 KB | Time limit exceeded |
57 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 200 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Execution timed out | 4099 ms | 40744 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |