oj.uz

Submission #985520

# Submission time Handle Problem Language Result Execution time Memory
985520 2024-05-18T03:24:13 Z mindiyak Rainforest Jumps (APIO21_jumps) C++14
4 / 100
 599 ms 33744 KB 
#include "jumps.h"

using namespace std;

#include <vector>
#include <queue>
#include <iostream>

#define NMAX 2010
// #define NMAX 7
#define INF 1e5
vector<vector<int>> costs(NMAX,vector<int>(NMAX,INF));
vector<vector<int>> paths(NMAX,vector<int>(NMAX,0));

void init(int N, std::vector<int> H) {
  return;
  for(int i = 0;i<N;i++)costs[i][i] = 0;

  for(int i = 0;i<N;i++){
    int pos = i+1;
    while(pos<N){
      if(H[i]<H[pos]){
        paths[i][pos] = 1;
        costs[i][pos] = 1;
        break;
      }pos++;
    }
    pos = i-1;
    while(pos>-1){
      if(H[i]<H[pos]){
        paths[i][pos] = 1;
        costs[i][pos] = 1;
        break;
      }pos--;
    }
  }

  // for(int i=0;i<costs.size();i++){
  //   for(int j=0;j<costs[i].size();j++){
  //     cout << costs[i][j] << " ";
  //   }cout << endl;
  // }

  // for(int i=0;i<N;i++){
  //   cout << i << " -> ";
  //   for(int j=0;j<paths[i].size();j++){
  //     cout << paths[i][j] << ",";
  //   }cout << endl;
  // }

  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++){
      for(int k=0;k<N;k++){
        costs[i][j] = min(costs[i][j],costs[i][k]+costs[k][j]);
      }
    }
  }
  
  // for(int i=0;i<costs.size();i++){
  //   for(int j=0;j<costs[i].size();j++){
  //     cout << costs[i][j] << " ";
  //   }cout << endl;
  // }
}

int minimum_jumps(int A, int B, int C, int D) {
  return C-B;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 32088 KB Output is correct
2 Correct 14 ms 32088 KB Output is correct
3 Correct 87 ms 33332 KB Output is correct
4 Correct 569 ms 33728 KB Output is correct
5 Correct 521 ms 32820 KB Output is correct
6 Correct 574 ms 33744 KB Output is correct
7 Correct 511 ms 33236 KB Output is correct
8 Correct 599 ms 33736 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 32088 KB Output is correct
2 Incorrect 14 ms 32088 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 32088 KB Output is correct
2 Incorrect 14 ms 32088 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 32088 KB Output is correct
2 Correct 14 ms 32088 KB Output is correct
3 Correct 87 ms 33332 KB Output is correct
4 Correct 569 ms 33728 KB Output is correct
5 Correct 521 ms 32820 KB Output is correct
6 Correct 574 ms 33744 KB Output is correct
7 Correct 511 ms 33236 KB Output is correct
8 Correct 599 ms 33736 KB Output is correct
9 Incorrect 13 ms 32088 KB Output isn't correct
10 Halted 0 ms 0 KB -