Submission #977500

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
977500	2024-05-08 05:35:14	SuPythony	Rainforest Jumps (APIO21_jumps)	C++17	0 / 100	4043 ms	11600 KiB

jumps

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> al(2*1e5,vector<int>());
void init(int n, vector<int> h) {
    if (h[1]>h[0]) al[0].push_back(1);
    if (h[n-2]>h[n-1]) al[n-1].push_back(n-2);
    for (int i=1; i<n-1; i++) {
        if (h[i-1]>h[i]) al[i].push_back(i-1);
        if (h[i+1]>h[i]) al[i].push_back(i+1);
    }
}
int minimum_jumps(int a, int b, int c, int d) {
    int ans=1e9;
    for (int i=a; i<=b; i++) {
        queue<pair<int,int>> q;
        q.push({i,0});
        vector<int> vis(2*1e5,0);
        bool pos=false;
        int dist;
        while (!q.empty()) {
            auto u=q.front(); q.pop();
            if (u.first>=c&&u.second<=d) {
                pos=true;
                dist=u.second;
                break;
            }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19