oj.uz

Submission #566364

# Submission time Handle Problem Language Result Execution time Memory
566364 2022-05-22T09:21:01 Z josanneo22 Rainforest Jumps (APIO21_jumps) C++17
0 / 100
 4000 ms 208 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;}

vll h;
int n;
void init(int N, std::vector<int> H) 
{
	n=N;
	FOR(i,0,N) 
	{
		h.pb(H[i]);
	}
}

int minimum_jumps(int A, int B, int C, int D) 
{
	bool ok=true;
	int cur=B;
	int ans=0;
	while(cur!=C && ok)
	{
		if(h[cur]>h[cur+1]) ok==false;
		ans++;
	}
	if(ok) return ans;
	else return -1;
}

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:52:25: warning: statement has no effect [-Wunused-value]
   52 |   if(h[cur]>h[cur+1]) ok==false;
      |                       ~~^~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4067 ms 208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4019 ms 208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4019 ms 208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4073 ms 208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4065 ms 208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4065 ms 208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4067 ms 208 KB Time limit exceeded
2 Halted 0 ms 0 KB -