oj.uz

Submission #981287

# Submission time Handle Problem Language Result Execution time Memory
981287 2024-05-13T03:59:06 Z Faisal_Saqib Rainforest Jumps (APIO21_jumps) C++17
0 / 100
 28 ms 5840 KB 
#include "jumps.h"

#include <vector>


#include <bits/stdc++.h>

//#include "stub.cpp"

using namespace std;
const int N=2002;
int n;
int dist[N];
vector<int> adj[N];
void init(int NP, std::vector<int> h) {
  n=NP;
  set<int> spl;
  vector<pair<int,int>> pp;
  for(int j=0;j<n;j++)
    pp.push_back({h[j],j});
  sort(begin(pp),end(pp));
  for(int j=n-1;j>=0;j--)
  {
    auto it = spl.upper_bound(pp[j].second);
    if(it!=end(spl))
    {
      // cout<<*it<<' ';
      adj[pp[j].second].push_back(*it);
    }
    if(it!=begin(spl))
    {
      it--;
      // cout<<*it<<' ';
      adj[pp[j].second].push_back(*it);
    }
    // cout<<endl;
    spl.insert(pp[j].second);
  }
}

int minimum_jumps(int a, int b, int c, int d) {
  int ans=0;
  bool reach=0;
  for(int j=1;j<=n;j++)
    dist[j]=2e9;
  priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
  for(int st=a;st<=b;st++)
  {
    dist[st]=0;
    pq.push({dist[st],st});
  }
  while(pq.size())
  {
    auto it=pq.top();
    if(c<=it.second and it.second<=d)
      return it.first;
    pq.pop();
    if(dist[it.second]==it.first)
      for(auto dj:adj[it.second])
        if(dist[dj]>(dist[it.second]+1))
        {
          dist[dj]=dist[it.second]+1;
          pq.push({dist[dj],dj});
        }
  }
  return -1;
}

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:42:7: warning: unused variable 'ans' [-Wunused-variable]
   42 |   int ans=0;
      |       ^~~
jumps.cpp:43:8: warning: unused variable 'reach' [-Wunused-variable]
   43 |   bool reach=0;
      |        ^~~~~

Subtask #1
0 / 4.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Incorrect 1 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Incorrect 1 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.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 Correct 0 ms 344 KB Output is correct
5 Runtime error 28 ms 5824 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 15 ms 3788 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 15 ms 3788 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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Runtime error 17 ms 5840 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -