# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
657662 | 2022-11-10T16:14:29 Z | activedeltorre | Rainforest Jumps (APIO21_jumps) | C++14 | 2 ms | 2640 KB |
#include "jumps.h" #include <vector> #include <stack> #include <queue> using namespace std; stack <int>st; int v[100005]; vector<int>adj[100005]; int n; void init(int N, vector<int> H) { int i; n=N; for(i=1; i<=n; i++) { v[i]=H[i]; } v[0]=1e8; st.push(0); for(i=1; i<=n; i++) { if(v[i]>v[st.top()]) { adj[st.top()].push_back(i); st.pop(); } st.push(i); } while(st.size()) { st.pop(); } st.push(n+1); v[n+1]=1e8; for(i=n; i>=1; i--) { if(v[i]>v[st.top()]) { adj[st.top()].push_back(i); st.pop(); } st.push(i); } while(st.size()) { st.pop(); } } queue<int>qu; int rasp[100005]; int minimum_jumps(int a, int b, int c, int d) { int i,k,curr; for(i=1;i<=n;i++) { rasp[i]=1e8; } if(a>b) { swap(a,b); } if(c>d) { swap(c,d); } for(i=a;i<=b;i++) { qu.push(i); rasp[i]=0; } while(qu.size()) { curr=qu.front(); qu.pop(); if(curr>=c && curr<=d) { return rasp[curr]; } for(i=0;i<adj[curr].size();i++) { k=adj[curr][i]; if(rasp[k]>rasp[curr]+1) { rasp[k]=rasp[curr]+1; qu.push(k); } } } return -1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |