oj.uz

Submission #569628

# Submission time Handle Problem Language Result Execution time Memory
569628 2022-05-27T15:00:58 Z Minindu2006 Rainforest Jumps (APIO21_jumps) C++14
0 / 100
 1 ms 208 KB 
#include "jumps.h"

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

int adj[201][201];
int inf = INT_MAX;
void init(int n, vector<int> H) {
  for(int i=0;i<n;i++)
    for(int j=0;j<n;j++)
      adj[i][j] = inf;
  for(int i=0;i<n;i++)
    adj[i][i] = 0;
  for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++)
      if(H[i] < H[j])
      {
        adj[i][j] = 1;
        break;
      }
  for(int i=0;i<n;i++)
    for(int j=i-1;j>=0;j--)
      if(H[i] < H[j])
      {
        adj[i][j] = 1;
        break;
      }
  int i, j, k;
  for(k=0;k<n;k++)
  {
    for(i=0;i<n;i++)
    {
      for(j=0;j<n;j++)
      {
        adj[i][j] = min(adj[i][k]+adj[k][j],adj[i][j]);
      }
    }
  }
}

int minimum_jumps(int A, int B, int C, int D) {
  int ans = inf;

  for(int i=A;i<=B;i++)
  {
    for(int j=C;j<=D;j++)
      ans = min(adj[i][j], ans);
  }

  if(ans == inf)
    return -1;
  else
    return ans;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 21.0

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

Subtask #7
0 / 19.0

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