oj.uz

Submission #981311

# Submission time Handle Problem Language Result Execution time Memory
981311 2024-05-13T04:13:36 Z MuhammadSaram Rainforest Jumps (APIO21_jumps) C++17
4 / 100
 649 ms 2000 KB 
/********************* بسم الله الرحمن الرحيم ***********************/
 /******************** ٱلْحَمْدُ لِلَّٰهِ رَبِّ ٱلْعَالَمِينَ *************************/
/******************* Prophet Muhammad صلى الله عليه وسلم ************/
   /*********************** وَقُل رَّبِّ زِدْنِي عِلْمًا **************************/

#ifdef ONLINE_JUDGE
	#pragma GCC optimize("Ofast")
	#pragma GCC optimize("O3,unroll-loops")
	#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#else

#endif

#include <bits/stdc++.h>
#include "jumps.h"
using namespace std;

// #define int long long
#define endl '\n'
#define in binary_search
#define ll long long
#define ld long double
#define Hey ios::sync_with_stdio(false);
#define Welcome cin.tie(NULL), cout.tie(NULL);
#define all(v) v.begin(),v.end()

const int inf = 2e5, M = 2000;

int dp[M][M],n;

void init(int N,vector<int> h)
{
	n=N;
	if (n>M)
		return;
	for (int i=0;i<n;i++)
		for (int j=0;j<n;j++)
			dp[i][j]=(i!=j)*inf;
	for (int i=0;i<n;i++)
	{
		int pre=i;
		vector<int> v,v1;
		for (int j=i+1;j<n;j++)
			if (h[j]>h[pre])
				v.push_back(j),pre=j,dp[i][j]=v.size();
		pre=i;
		for (int j=i-1;j>=0;j--)
			if (h[j]>h[pre])
				v1.push_back(j),pre=j,dp[i][j]=v1.size();
		int p=0,p1=0;
		while (p<v.size() and p1<v1.size())
		{
			if (h[v[p]]>h[v1[p1]])
				dp[i][v[p]]=min(dp[i][v[p]],dp[i][v1[p1]]+dp[v1[p1]][v[p]]),p1++;
			else
				dp[i][v1[p1]]=min(dp[i][v1[p1]],dp[i][v[p]]+dp[v[p]][v1[p1]]),p++;
		}
		for (int j=0;j+1<v.size();j++)
			dp[i][v[j+1]]=min(dp[i][v[j+1]],dp[i][v[j]]+1);
		for (int j=0;j+1<v1.size();j++)
			dp[i][v1[j+1]]=min(dp[i][v1[j+1]],dp[i][v1[j]]+1);
	}
}

int minimum_jumps(int a, int b, int c, int d)
{
	if (n>M)
		return c-b;
	int ans=inf;
	for (int j=c;j<=d;j++)
		for (int i=a;i<=b;i++)
			ans=min(ans,dp[i][j]);
	return ans;
}

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:52:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   while (p<v.size() and p1<v1.size())
      |          ~^~~~~~~~~
jumps.cpp:52:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   while (p<v.size() and p1<v1.size())
      |                         ~~^~~~~~~~~~
jumps.cpp:59:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for (int j=0;j+1<v.size();j++)
      |                ~~~^~~~~~~~~
jumps.cpp:61:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   for (int j=0;j+1<v1.size();j++)
      |                ~~~^~~~~~~~~~

Subtask #1
4.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 Correct 67 ms 1584 KB Output is correct
4 Correct 568 ms 2000 KB Output is correct
5 Correct 524 ms 1112 KB Output is correct
6 Correct 529 ms 1988 KB Output is correct
7 Correct 453 ms 1492 KB Output is correct
8 Correct 649 ms 2000 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 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 Incorrect 0 ms 344 KB Output isn't correct
3 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 Incorrect 0 ms 344 KB Output isn't correct
3 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 Correct 67 ms 1584 KB Output is correct
4 Correct 568 ms 2000 KB Output is correct
5 Correct 524 ms 1112 KB Output is correct
6 Correct 529 ms 1988 KB Output is correct
7 Correct 453 ms 1492 KB Output is correct
8 Correct 649 ms 2000 KB Output is correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -