oj.uz

Submission #438016

# Submission time Handle Problem Language Result Execution time Memory
438016 2021-06-27T12:15:41 Z ala2 Rainforest Jumps (APIO21_jumps) C++14
0 / 100
 93 ms 69632 KB 
#include "jumps.h"

#include <vector>
#include <iostream>
#include <queue>
using namespace std;
 int n; vector<int>h;  vector<int>v[1000100];  int vi[1100][1100];  int d[1000][1000]; int g[1000100];

 queue<int>q;  int mn=1000000023;
 void bfs(int node)
 {
     vi[node][node]=1;
    q.push(0);
     while(!q.empty()){
            int u=q.front();
     q.pop();//  cout<<"       "<<u<<endl;
     d[node][node]=0;
     for(int i=0;i<v[u].size();i++)
     {
         if(!vi[node][v[u][i]]){
         q.push(v[u][i]);
         d[node][v[u][i]]=d[node][u]+1;
                              }
     }

     }

 }

void init(int N, vector<int> H) {
    n=N;
    for(int i=0;i<n;i++)
    {
        h.push_back(H[i]);
    }
    for(int i=0;i<n;i++)
    {
         for(int j=i-1;j>=0;j--)
         {
             if(h[j]>h[i])
             {
                 v[i].push_back(j);  d[i][j]=1;
                 break;
             }
         }
         for(int j=i+1;j<n;j++)
         {
             if(h[j]>h[i])
             {
                 v[i].push_back(j);  d[i][j]=1;
                 break;
             }
         }
    }
   for(int i=0;i<n;i++) bfs(i);


}

int minimum_jumps(int A, int B, int C, int D) {
mn=1000000003;  //cout<<"            "<<d[3][6]<<endl;
   for(int i=A;i<=B;i++)
   {
       for(int j=C;j<=D;j++)
       {   if(d[i][j])
           mn=min(mn,d[i][j]);
       }
   }
   if(mn==1000000003) return -1;
return mn;
//  return 0;
}

Compilation message

jumps.cpp: In function 'void bfs(int)':
jumps.cpp:18:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |      for(int i=0;i<v[u].size();i++)
      |                  ~^~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23772 KB Output is correct
2 Correct 17 ms 23716 KB Output is correct
3 Runtime error 93 ms 69548 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23752 KB Output is correct
2 Correct 16 ms 23752 KB Output is correct
3 Correct 17 ms 23752 KB Output is correct
4 Correct 16 ms 23692 KB Output is correct
5 Incorrect 18 ms 23884 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23752 KB Output is correct
2 Correct 16 ms 23752 KB Output is correct
3 Correct 17 ms 23752 KB Output is correct
4 Correct 16 ms 23692 KB Output is correct
5 Incorrect 18 ms 23884 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23752 KB Output is correct
2 Correct 16 ms 23752 KB Output is correct
3 Correct 18 ms 23752 KB Output is correct
4 Correct 17 ms 23752 KB Output is correct
5 Runtime error 78 ms 69632 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23784 KB Output is correct
2 Correct 17 ms 23752 KB Output is correct
3 Correct 16 ms 23764 KB Output is correct
4 Runtime error 91 ms 67900 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23784 KB Output is correct
2 Correct 17 ms 23752 KB Output is correct
3 Correct 16 ms 23764 KB Output is correct
4 Runtime error 91 ms 67900 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23772 KB Output is correct
2 Correct 17 ms 23716 KB Output is correct
3 Runtime error 93 ms 69548 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -