oj.uz

Submission #553763

# Submission time Handle Problem Language Result Execution time Memory
553763 2022-04-26T20:53:14 Z Zhora_004 Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 10268 KB 
#include "jumps.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
#include <fstream>
//#include <bit>
//#include <ranges>
//#include <numbers>
#define sz(a) ((int)((a).size()))
// printf("%.10f\n", ans);
/*ofstream fout("timeline.out");
ifstream fin("timeline.in");*/
using ll = long long;
using namespace std;
const int inf = 1e9;
int n, a, b, c, d, ans;
vector<int> h, dp, nge, pge;

bool task(int id)
{
	if (id == 1)
	{
		for (int i = 0; i < n; i++) if (h[i] != i + 1) return 0;
		return 1;
	}
	/*else if (id == 3)
	{
		return max(n, q) <= 2000;
	}
	else if (id == 4)
	{
		return q <= 5;
	}*/
	return 0;
}

void NGE()
{
    stack<int> s;
    s.push(0);
    for (int i = 1; i < n; i++)
    {
        if (s.empty())
        {
            s.push(i);
            continue;
        }
        while (!s.empty() && h[s.top()] < h[i])
        {
            nge[s.top()] = i;
            s.pop();
        }
        s.push(i);
    }
    while (!s.empty())
    {
        nge[s.top()] = -1;
        s.pop();
    }
}

void PGE()
{
    stack<int> s;
    s.push(0);
    pge[0] = -1;
    for (int i = 1; i < n; i++)
    {
        while (!s.empty() && h[s.top()] < h[i]) s.pop();
        if (s.empty()) pge[i] = -1;
        else pge[i] = s.top();
        s.push(i);
    }
}

int dfs(int u)
{
    if (dp[u] != inf + 1) return dp[u];
    if (c <= u && u <= d) return dp[u] = 0;
    int r = nge[u];
    int ans = inf;
    if (r != -1) ans = min(ans, dfs(r) + 1);
    int l = pge[u];
    if (l != -1) ans = min(ans, dfs(l) + 1);
    return dp[u] = ans;
}

void init(int N, std::vector<int> H) {
	n = N;
	h = H;
	nge = pge = vector<int>(n);
	NGE();
	PGE();
}


int minimum_jumps(int A, int B, int C, int D) {
	a = A, b = B, c = C, d = D;
	if (task(1)) return c - b;
	else
	{
        dp = vector<int>(n, inf + 1);
        ans = inf;
        for (int i = a; i <= b; i++) ans = min(ans, dfs(i));
        if (ans == inf) ans = -1;
        return ans;
	}
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 616 ms 3336 KB Output is correct
4 Execution timed out 4083 ms 4152 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 3 ms 208 KB Output is correct
24 Correct 2 ms 236 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 2 ms 208 KB Output is correct
29 Correct 2 ms 208 KB Output is correct
30 Correct 2 ms 208 KB Output is correct
31 Correct 2 ms 208 KB Output is correct
32 Correct 3 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 0 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 2 ms 208 KB Output is correct
46 Correct 2 ms 208 KB Output is correct
47 Correct 2 ms 208 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 2 ms 208 KB Output is correct
50 Correct 2 ms 208 KB Output is correct
51 Correct 2 ms 208 KB Output is correct
52 Correct 2 ms 208 KB Output is correct
53 Correct 3 ms 208 KB Output is correct
54 Correct 2 ms 208 KB Output is correct
55 Correct 2 ms 208 KB Output is correct
56 Correct 2 ms 208 KB Output is correct
57 Correct 0 ms 208 KB Output is correct
58 Correct 23 ms 336 KB Output is correct
59 Correct 27 ms 340 KB Output is correct
60 Correct 6 ms 208 KB Output is correct
61 Correct 37 ms 336 KB Output is correct
62 Correct 11 ms 208 KB Output is correct
63 Correct 36 ms 336 KB Output is correct
64 Correct 18 ms 208 KB Output is correct
65 Correct 33 ms 336 KB Output is correct
66 Correct 37 ms 336 KB Output is correct
67 Correct 39 ms 336 KB Output is correct
68 Correct 46 ms 336 KB Output is correct
69 Correct 38 ms 384 KB Output is correct
70 Correct 36 ms 388 KB Output is correct
71 Correct 0 ms 208 KB Output is correct
72 Correct 1 ms 208 KB Output is correct
73 Correct 2 ms 208 KB Output is correct
74 Correct 1 ms 208 KB Output is correct
75 Correct 2 ms 208 KB Output is correct
76 Correct 2 ms 208 KB Output is correct
77 Correct 2 ms 208 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 2 ms 208 KB Output is correct
81 Correct 2 ms 208 KB Output is correct
82 Correct 2 ms 208 KB Output is correct
83 Correct 2 ms 208 KB Output is correct
84 Correct 2 ms 208 KB Output is correct
85 Correct 2 ms 208 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 0 ms 208 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 4 ms 208 KB Output is correct
95 Correct 36 ms 336 KB Output is correct
96 Correct 38 ms 336 KB Output is correct
97 Correct 35 ms 336 KB Output is correct
98 Correct 44 ms 336 KB Output is correct
99 Correct 34 ms 336 KB Output is correct
100 Correct 0 ms 208 KB Output is correct
101 Correct 1 ms 208 KB Output is correct
102 Correct 15 ms 340 KB Output is correct
103 Correct 25 ms 336 KB Output is correct
104 Correct 18 ms 336 KB Output is correct
105 Correct 34 ms 368 KB Output is correct
106 Correct 34 ms 336 KB Output is correct
107 Correct 0 ms 208 KB Output is correct
108 Correct 1 ms 208 KB Output is correct
109 Correct 1 ms 336 KB Output is correct
110 Correct 1 ms 336 KB Output is correct
111 Correct 1 ms 336 KB Output is correct
112 Correct 1 ms 336 KB Output is correct
113 Correct 1 ms 336 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 27 ms 4000 KB Output is correct
6 Correct 32 ms 4896 KB Output is correct
7 Correct 13 ms 2248 KB Output is correct
8 Correct 35 ms 4892 KB Output is correct
9 Correct 7 ms 880 KB Output is correct
10 Correct 30 ms 4900 KB Output is correct
11 Correct 24 ms 4168 KB Output is correct
12 Correct 32 ms 8064 KB Output is correct
13 Correct 33 ms 9384 KB Output is correct
14 Correct 43 ms 4964 KB Output is correct
15 Correct 33 ms 8504 KB Output is correct
16 Correct 29 ms 5916 KB Output is correct
17 Correct 29 ms 6280 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 0 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 28 ms 4140 KB Output is correct
34 Correct 30 ms 4872 KB Output is correct
35 Correct 42 ms 9752 KB Output is correct
36 Correct 28 ms 4960 KB Output is correct
37 Correct 29 ms 8464 KB Output is correct
38 Correct 38 ms 7580 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 15 ms 2896 KB Output is correct
41 Correct 28 ms 4964 KB Output is correct
42 Correct 26 ms 10268 KB Output is correct
43 Correct 40 ms 4912 KB Output is correct
44 Correct 31 ms 8504 KB Output is correct
45 Correct 28 ms 10016 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1000 ms 2348 KB Output is correct
5 Execution timed out 4014 ms 4920 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1000 ms 2348 KB Output is correct
5 Execution timed out 4014 ms 4920 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 616 ms 3336 KB Output is correct
4 Execution timed out 4083 ms 4152 KB Time limit exceeded
5 Halted 0 ms 0 KB -