Submission #566396

# Submission time Handle Problem Language Result Execution time Memory
566396 2022-05-22T09:45:03 Z josanneo22 Rainforest Jumps (APIO21_jumps) C++17
Compilation error
0 ms 0 KB
#include "jumps.h"
#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b); i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
#define mp make_pair
#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define f first
#define s second
#define out(x) cout<<x<<'\n';
#define in(x) cin>>x;
#define inarr(a,x,y) for(int i=x;i<y;i++){cin>>a[i];}
#define incor(a,x,y) for(int i=x;i<y;i++){cin>>a[i].f>>a[i].s;}
const int mod = 1e9 + 7;
vll h;
int n;
vi lmao;
void init(int N, std::vector<int> H) 
{
	n=N;
	lmao.rsz(n+1);
	FOR(i,0,N)
		h[i]=H[i];
	FOR(i,0,n)
	{
		lmao[i]=i;
		FOR(j,i+1,n)
			if(h[j]>h[i]) 
			{
				lmao[i]=j;
				break;
			}
	}
}

int minimum_jumps(int a,int b,int c,int d) 
{
	int dp[n+1];
	FOR(i,0,n)
		dp[i]=mod;
	queue<int> q;
	FOR(i,a,b+1)
	{
		dp[i]=0;
		q.push(i);
	}
	while(sz(q))
	{
		int u=q.front();p.pop();
		if(u>=c && u<=d) return dp[i];
		if(dp[lmao[u]]==mod)
		{
			dp[lmao[u]]=dp[u]+1;
			q.push(lmao[u]);
		}
	}
	return -1;
}

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:68:19: error: 'p' was not declared in this scope
   68 |   int u=q.front();p.pop();
      |                   ^
jumps.cpp:69:30: error: 'i' was not declared in this scope
   69 |   if(u>=c && u<=d) return dp[i];
      |                              ^