oj.uz

Submission #981669

# Submission time Handle Problem Language Result Execution time Memory
981669 2024-05-13T12:36:36 Z IUA_Hasin Rainforest Jumps (APIO21_jumps) C++17
21 / 100
 939 ms 38848 KB 
#include "jumps.h"
#include <bits/stdc++.h>

#define ll                          long long

using namespace std;

const ll M = 2e3+10;

ll N2;
vector<ll> graph[M];
vector<ll> H2;
ll vis[M];
ll level[M][M];
ll status2;
  

void bfs(ll source){
  queue<ll> q;
  q.push(source);
  vis[source] = 1;
  level[source][source] = 0;

  while(!q.empty()){
    ll temp = q.front();
    q.pop();
    for(auto u : graph[temp]){
      if(vis[u]==0){
        q.push(u);
        level[source][u] = level[source][temp]+1;
        vis[u] = 1;
      }
    }
  }
}


void init(int N, std::vector<int> H) {
    ll stat = 1;
    for(int i=0; i<N-1; i++){
      if(H[i+1]!=H[i]){
        stat = -1;
        break;
      }
    }
    status2 = stat;
    
    if(stat==-1){
      N2 = N;
      vector<ll> v[N+1];
      for(int i=0; i<N; i++){
          ll a = H[i];
          v[a].push_back(i);
          H2.push_back(a);
      }

      set<ll> s;
      for(int i=0; i<N; i++){
          s.insert(i);
      }
      

      for(int i=1; i<=N; i++){
          if(i==N){
              break;
          }
          
          ll ind = v[i][0];
          ll val = H[ind];
          //cout<<ind<<" "<<val<<endl;
          auto it1 = s.lower_bound(ind);
          auto it2 = s.upper_bound(ind);
          it1--;
          ll temp1, temp2;
          if(it1!=s.end()){
          temp1 = *it1;
          temp1 = H[temp1];
          graph[val].push_back(temp1);

          }


          if(it2!=s.end()){
          temp1 = *it2;
          temp1 = H[temp1];
          graph[val].push_back(temp1);

          }

          auto itt = s.find(ind);
          s.erase(itt); 
      }

      for(int i=1; i<=N; i++){
        for(int j=1; j<=N; j++){
          level[i][j] = -1;
        }
      }

    for(int i=1; i<=N; i++){
      for(int j=0; j<=N; j++){
        vis[j] = 0;
      }
      bfs(i);
    }

    }
    


}

int minimum_jumps(int A, int B, int C, int D) {
  if(status2==1){
    return C-B;
  } else {
    ll status = -1;
    ll ans = M+100;
    for(int i=A; i<=B; i++){
      for(int j=C; j<=D; j++){
        ll start = H2[i];
        ll end = H2[j];
        ll temp = level[start][end];
        if(temp>=0){
          status = 1;
          ans = min(ans, temp);
        }
      }
    }

    // if(status2==1){
    //   return C-B;
    // }

    if(status==-1){
      return -1;
    } else {
      return ans;
    }
  }

}

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:74:21: warning: unused variable 'temp2' [-Wunused-variable]
   74 |           ll temp1, temp2;
      |                     ^~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Runtime error 58 ms 38684 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 2 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 3 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 2 ms 4440 KB Output is correct
11 Correct 2 ms 4440 KB Output is correct
12 Correct 2 ms 4440 KB Output is correct
13 Correct 2 ms 4440 KB Output is correct
14 Correct 2 ms 4440 KB Output is correct
15 Correct 2 ms 4440 KB Output is correct
16 Correct 2 ms 4492 KB Output is correct
17 Correct 2 ms 4440 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 2584 KB Output is correct
20 Correct 2 ms 4440 KB Output is correct
21 Correct 2 ms 4440 KB Output is correct
22 Correct 2 ms 4440 KB Output is correct
23 Correct 2 ms 4440 KB Output is correct
24 Correct 2 ms 4440 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 4572 KB Output is correct
29 Correct 2 ms 4440 KB Output is correct
30 Correct 1 ms 4676 KB Output is correct
31 Correct 2 ms 4440 KB Output is correct
32 Correct 2 ms 4440 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 1 ms 4440 KB Output is correct
36 Correct 1 ms 4440 KB Output is correct
37 Correct 1 ms 4692 KB Output is correct
38 Correct 1 ms 4440 KB Output is correct
39 Correct 1 ms 4440 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 2392 KB Output is correct
45 Correct 2 ms 4440 KB Output is correct
46 Correct 2 ms 4440 KB Output is correct
47 Correct 2 ms 4440 KB Output is correct
48 Correct 1 ms 4440 KB Output is correct
49 Correct 2 ms 4440 KB Output is correct
50 Correct 2 ms 4440 KB Output is correct
51 Correct 2 ms 4440 KB Output is correct
52 Correct 2 ms 4440 KB Output is correct
53 Correct 2 ms 4436 KB Output is correct
54 Correct 2 ms 4440 KB Output is correct
55 Correct 2 ms 4440 KB Output is correct
56 Correct 3 ms 4692 KB Output is correct
57 Correct 1 ms 4440 KB Output is correct
58 Correct 393 ms 27480 KB Output is correct
59 Correct 934 ms 32088 KB Output is correct
60 Correct 17 ms 14936 KB Output is correct
61 Correct 939 ms 32088 KB Output is correct
62 Correct 9 ms 4440 KB Output is correct
63 Correct 917 ms 31960 KB Output is correct
64 Correct 235 ms 32288 KB Output is correct
65 Correct 238 ms 32220 KB Output is correct
66 Correct 229 ms 32088 KB Output is correct
67 Correct 807 ms 32088 KB Output is correct
68 Correct 353 ms 32088 KB Output is correct
69 Correct 289 ms 32212 KB Output is correct
70 Correct 65 ms 32212 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 1 ms 2392 KB Output is correct
73 Correct 2 ms 4440 KB Output is correct
74 Correct 2 ms 4440 KB Output is correct
75 Correct 2 ms 4440 KB Output is correct
76 Correct 2 ms 4440 KB Output is correct
77 Correct 2 ms 4440 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 2 ms 4440 KB Output is correct
82 Correct 2 ms 4440 KB Output is correct
83 Correct 2 ms 4440 KB Output is correct
84 Correct 2 ms 4440 KB Output is correct
85 Correct 2 ms 4440 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 1 ms 4440 KB Output is correct
88 Correct 1 ms 4440 KB Output is correct
89 Correct 2 ms 4440 KB Output is correct
90 Correct 1 ms 4440 KB Output is correct
91 Correct 1 ms 4440 KB Output is correct
92 Correct 1 ms 4440 KB Output is correct
93 Correct 1 ms 4440 KB Output is correct
94 Correct 2 ms 4640 KB Output is correct
95 Correct 27 ms 32088 KB Output is correct
96 Correct 37 ms 32220 KB Output is correct
97 Correct 28 ms 32088 KB Output is correct
98 Correct 37 ms 32088 KB Output is correct
99 Correct 33 ms 32088 KB Output is correct
100 Correct 1 ms 4440 KB Output is correct
101 Correct 2 ms 12888 KB Output is correct
102 Correct 15 ms 32088 KB Output is correct
103 Correct 26 ms 32212 KB Output is correct
104 Correct 17 ms 32088 KB Output is correct
105 Correct 22 ms 32088 KB Output is correct
106 Correct 28 ms 32088 KB Output is correct
107 Correct 1 ms 4440 KB Output is correct
108 Correct 3 ms 16984 KB Output is correct
109 Correct 9 ms 32088 KB Output is correct
110 Correct 17 ms 32088 KB Output is correct
111 Correct 12 ms 32088 KB Output is correct
112 Correct 15 ms 32136 KB Output is correct
113 Correct 19 ms 32088 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Runtime error 62 ms 38848 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Runtime error 35 ms 22468 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Runtime error 35 ms 22468 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Runtime error 58 ms 38684 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -