Submission #545376

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
545376	2022-04-04 11:53:00	AJ00	Rainforest Jumps (APIO21_jumps)	C++14	33 / 100	4081 ms	14384 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 <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj(200001);
vector<bool> visited(200001,false);
vector<int> dist(200001);
int n;
int minimum_jumps(int A, int B, int C, int D){
    int a= A+1,b=B+1,c=C+1,d=D+1;
    queue<int> q;
  //  cout << a << " " << b << " " << c << " " << d << "\n";
    for (int i = 1; i <= n; i++){
        visited[i] = false;
    }
 /*   if (a <= c <= b || a <= d <= b){
        return 0;
    }*/
    for (int i = a; i <= b; i++){
        q.push(i);
        dist[i] = 0;
        if ((c <= i) && (i <= d)){
            return 0;
        }
        visited[i] = true;
    }
    while(!q.empty()){
        int p = q.front();
        q.pop();
       // cout << p << " " << dist[p] << "\n";
        for (int ch: adj[p]){
            if (!visited[ch]){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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