Submission #657667

# Submission time Handle Problem Language Result Execution time Memory
657667 2022-11-10T16:23:27 Z activedeltorre Rainforest Jumps (APIO21_jumps) C++14
21 / 100
998 ms 9152 KB
#include "jumps.h"

#include <iostream>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
stack <int>st;
int v[100005];
vector<int>adj[100005];
int n;
void init(int N, vector<int> H)
{
    int i;
    n=N;
    for(i=1; i<=n; i++)
    {
        v[i]=H[i-1];
    }
    v[0]=1e8;
    st.push(0);
    for(i=1; i<=n; i++)
    {
        while(v[i]>v[st.top()])
        {
            adj[st.top()].push_back(i);
            st.pop();
        }
        st.push(i);
    }
    while(st.size())
    {
        st.pop();
    }
    st.push(n+1);
    v[n+1]=1e8;
    for(i=n; i>=1; i--)
    {
        while(v[i]>v[st.top()])
        {
            adj[st.top()].push_back(i);
            st.pop();
        }
        st.push(i);
    }
    while(st.size())
    {
        st.pop();
    }
}
queue<int>qu;
int rasp[100005];
int minimum_jumps(int a, int b, int c, int d)
{
    int i,k,curr;
    a++;
    b++;
    c++;
    d++;
    for(i=1;i<=n;i++)
    {
        rasp[i]=1e8;
    }
    if(a>b)
    {
        swap(a,b);
    }
    if(c>d)
    {
        swap(c,d);
    }
    for(i=a;i<=b;i++)
    {
        qu.push(i);
        rasp[i]=0;
    }
    while(qu.size())
    {
        curr=qu.front();
        qu.pop();
        if(curr>=c && curr<=d)
        {
            while(qu.size())
            {
                qu.pop();
            }
            return rasp[curr];
        }
        for(i=0;i<adj[curr].size();i++)
        {
            k=adj[curr][i];
            if(rasp[k]>rasp[curr]+1)
            {
                rasp[k]=rasp[curr]+1;
                qu.push(k);
            }
        }
    }
    return -1;
}
vector<int>vect;
/*int main ()
{
    int ne,i,q,a,b,c,d,x;
    cin>>ne;
    for(i=1;i<=ne;i++)
    {
        cin>>x;
        vect.push_back(x);
    }
    init(ne,vect);
    cin>>q;
    for(i=1;i<=q;i++)
    {
        cin>>a>>b>>c>>d;
        cout<<minimum_jumps(a,b,c,d);
    }
}
*/

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:89:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for(i=0;i<adj[curr].size();i++)
      |                 ~^~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Runtime error 17 ms 8448 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 3 ms 2640 KB Output is correct
6 Correct 4 ms 2640 KB Output is correct
7 Correct 3 ms 2640 KB Output is correct
8 Correct 5 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 3 ms 2640 KB Output is correct
11 Correct 3 ms 2640 KB Output is correct
12 Correct 3 ms 2612 KB Output is correct
13 Correct 4 ms 2640 KB Output is correct
14 Correct 3 ms 2672 KB Output is correct
15 Correct 4 ms 2640 KB Output is correct
16 Correct 3 ms 2640 KB Output is correct
17 Correct 3 ms 2640 KB Output is correct
18 Correct 1 ms 2640 KB Output is correct
19 Correct 2 ms 2640 KB Output is correct
20 Correct 4 ms 2676 KB Output is correct
21 Correct 3 ms 2640 KB Output is correct
22 Correct 4 ms 2640 KB Output is correct
23 Correct 3 ms 2640 KB Output is correct
24 Correct 3 ms 2640 KB Output is correct
25 Correct 1 ms 2640 KB Output is correct
26 Correct 2 ms 2640 KB Output is correct
27 Correct 3 ms 2640 KB Output is correct
28 Correct 4 ms 2760 KB Output is correct
29 Correct 3 ms 2640 KB Output is correct
30 Correct 4 ms 2640 KB Output is correct
31 Correct 4 ms 2640 KB Output is correct
32 Correct 4 ms 2640 KB Output is correct
33 Correct 2 ms 2640 KB Output is correct
34 Correct 2 ms 2640 KB Output is correct
35 Correct 2 ms 2640 KB Output is correct
36 Correct 2 ms 2640 KB Output is correct
37 Correct 2 ms 2640 KB Output is correct
38 Correct 2 ms 2640 KB Output is correct
39 Correct 2 ms 2640 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 3 ms 2640 KB Output is correct
6 Correct 4 ms 2640 KB Output is correct
7 Correct 3 ms 2640 KB Output is correct
8 Correct 5 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 3 ms 2640 KB Output is correct
11 Correct 3 ms 2640 KB Output is correct
12 Correct 3 ms 2612 KB Output is correct
13 Correct 4 ms 2640 KB Output is correct
14 Correct 3 ms 2672 KB Output is correct
15 Correct 4 ms 2640 KB Output is correct
16 Correct 3 ms 2640 KB Output is correct
17 Correct 3 ms 2640 KB Output is correct
18 Correct 1 ms 2640 KB Output is correct
19 Correct 2 ms 2640 KB Output is correct
20 Correct 4 ms 2676 KB Output is correct
21 Correct 3 ms 2640 KB Output is correct
22 Correct 4 ms 2640 KB Output is correct
23 Correct 3 ms 2640 KB Output is correct
24 Correct 3 ms 2640 KB Output is correct
25 Correct 1 ms 2640 KB Output is correct
26 Correct 2 ms 2640 KB Output is correct
27 Correct 3 ms 2640 KB Output is correct
28 Correct 4 ms 2760 KB Output is correct
29 Correct 3 ms 2640 KB Output is correct
30 Correct 4 ms 2640 KB Output is correct
31 Correct 4 ms 2640 KB Output is correct
32 Correct 4 ms 2640 KB Output is correct
33 Correct 2 ms 2640 KB Output is correct
34 Correct 2 ms 2640 KB Output is correct
35 Correct 2 ms 2640 KB Output is correct
36 Correct 2 ms 2640 KB Output is correct
37 Correct 2 ms 2640 KB Output is correct
38 Correct 2 ms 2640 KB Output is correct
39 Correct 2 ms 2640 KB Output is correct
40 Correct 2 ms 2640 KB Output is correct
41 Correct 1 ms 2640 KB Output is correct
42 Correct 1 ms 2640 KB Output is correct
43 Correct 2 ms 2640 KB Output is correct
44 Correct 2 ms 2640 KB Output is correct
45 Correct 3 ms 2640 KB Output is correct
46 Correct 3 ms 2640 KB Output is correct
47 Correct 3 ms 2676 KB Output is correct
48 Correct 2 ms 2640 KB Output is correct
49 Correct 4 ms 2640 KB Output is correct
50 Correct 3 ms 2640 KB Output is correct
51 Correct 3 ms 2640 KB Output is correct
52 Correct 2 ms 2640 KB Output is correct
53 Correct 3 ms 2640 KB Output is correct
54 Correct 4 ms 2672 KB Output is correct
55 Correct 3 ms 2640 KB Output is correct
56 Correct 3 ms 2640 KB Output is correct
57 Correct 2 ms 2640 KB Output is correct
58 Correct 22 ms 2640 KB Output is correct
59 Correct 35 ms 2640 KB Output is correct
60 Correct 7 ms 2640 KB Output is correct
61 Correct 38 ms 2672 KB Output is correct
62 Correct 17 ms 2640 KB Output is correct
63 Correct 30 ms 2640 KB Output is correct
64 Correct 42 ms 2640 KB Output is correct
65 Correct 39 ms 2640 KB Output is correct
66 Correct 46 ms 2640 KB Output is correct
67 Correct 33 ms 2640 KB Output is correct
68 Correct 47 ms 2640 KB Output is correct
69 Correct 36 ms 2640 KB Output is correct
70 Correct 34 ms 2640 KB Output is correct
71 Correct 1 ms 2640 KB Output is correct
72 Correct 2 ms 2640 KB Output is correct
73 Correct 3 ms 2640 KB Output is correct
74 Correct 4 ms 2640 KB Output is correct
75 Correct 3 ms 2640 KB Output is correct
76 Correct 4 ms 2640 KB Output is correct
77 Correct 3 ms 2640 KB Output is correct
78 Correct 1 ms 2640 KB Output is correct
79 Correct 2 ms 2640 KB Output is correct
80 Correct 3 ms 2640 KB Output is correct
81 Correct 4 ms 2640 KB Output is correct
82 Correct 4 ms 2640 KB Output is correct
83 Correct 3 ms 2640 KB Output is correct
84 Correct 3 ms 2640 KB Output is correct
85 Correct 4 ms 2640 KB Output is correct
86 Correct 1 ms 2640 KB Output is correct
87 Correct 2 ms 2640 KB Output is correct
88 Correct 2 ms 2640 KB Output is correct
89 Correct 2 ms 2640 KB Output is correct
90 Correct 2 ms 2640 KB Output is correct
91 Correct 2 ms 2640 KB Output is correct
92 Correct 2 ms 2640 KB Output is correct
93 Correct 2 ms 2640 KB Output is correct
94 Correct 5 ms 2640 KB Output is correct
95 Correct 36 ms 2640 KB Output is correct
96 Correct 39 ms 2640 KB Output is correct
97 Correct 33 ms 2752 KB Output is correct
98 Correct 45 ms 2640 KB Output is correct
99 Correct 39 ms 2640 KB Output is correct
100 Correct 1 ms 2640 KB Output is correct
101 Correct 2 ms 2640 KB Output is correct
102 Correct 21 ms 2640 KB Output is correct
103 Correct 30 ms 2640 KB Output is correct
104 Correct 22 ms 2640 KB Output is correct
105 Correct 36 ms 2640 KB Output is correct
106 Correct 35 ms 2640 KB Output is correct
107 Correct 1 ms 2640 KB Output is correct
108 Correct 1 ms 2640 KB Output is correct
109 Correct 2 ms 2640 KB Output is correct
110 Correct 2 ms 2640 KB Output is correct
111 Correct 2 ms 2640 KB Output is correct
112 Correct 2 ms 2640 KB Output is correct
113 Correct 2 ms 2640 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Runtime error 23 ms 8536 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 998 ms 6520 KB Output is correct
5 Runtime error 23 ms 9152 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 998 ms 6520 KB Output is correct
5 Runtime error 23 ms 9152 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Runtime error 17 ms 8448 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -