oj.uz

Submission #581165

# Submission time Handle Problem Language Result Execution time Memory
581165 2022-06-22T10:01:27 Z MohammadAghil Rainforest Jumps (APIO21_jumps) C++17
8 / 100
 4000 ms 4380 KB 
      #include <bits/stdc++.h>
      #include "jumps.h"
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
    using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
    #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
      #define per(i,r,l) for(int i = (r); i >= (l); i--)
        #define rep(i,l,r) for(int i = (l); i < (r); i++)
           #define all(x) x.begin(), x.end()
              #define sz(x) (int)(x).size()
                  #define pb push_back
                      #define ss second
                           #define ff first
                                   void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 5e5 + 5, lg = 22, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}

int h[maxn], lx[maxn], rx[maxn], n;

int query(int a, int b){
     if(h[a] > h[b]) return inf;
     // int cr = a, cnt = -1;
     // while(true){
     //      cnt++;
     //      if(cr == b) return cnt;
     //      bool okl = h[lx[cr]] <= h[b], okr = h[rx[cr]] <= h[b];
     //      if(okl && okr) cr = h[lx[cr]] > h[rx[cr]]? lx[cr]: rx[cr];
     //      else if(okl) cr = lx[cr];
     //      else if(okr) cr = rx[cr];
     //      else return inf;
     // }
     // return inf;
     deque<int> q{a};
     vector<int> dist(n + 2, inf); dist[a] = 0;
     while(sz(q)){
          int r = q.front(); q.pop_front();
          if(h[r] > h[b]) continue;
          if(r == b) return dist[r]; 
          if(lx[r] > 0 && dist[lx[r]] == inf) q.push_back(lx[r]), dist[lx[r]] = dist[r] + 1;
          if(rx[r] < n+1 && dist[rx[r]] == inf) q.push_back(rx[r]), dist[rx[r]] = dist[r] + 1;
     }
     return inf;
}

int minimum_jumps(int a, int b, int c, int d){ a++, b++, c++, d++;
     int ans = inf;
     rep(i,a,b+1) rep(j,c,d+1) ans = min(ans, query(i, j));
     return ans == inf? -1: ans;
     // return c - b;
}

void init(int n, vector<int> H){ ::n = n;
     rep(i,0,n) h[i+1] = H[i]; h[0] = h[n+1] = inf;
     vector<int> st = {0};
     rep(i,1,n + 1){
          while(h[st.back()] < h[i]) st.pop_back();
          lx[i] = st.back(), st.pb(i);
     } st = {n+1};
     per(i,n,1){
          while(h[st.back()] < h[i]) st.pop_back();
          rx[i] = st.back(), st.pb(i);
     }
}

// int main(){
//      cin.tie(0) -> sync_with_stdio(0);
//      freopen("in.in", "r", stdin);
//      freopen("out.out", "w", stdout);
//      int n; cin >> n; ::n = n;
//      int q; cin >> q;
//      rep(i,1,n+1) cin >> h[i]; h[0] = h[n+1] = inf;
//      vector<int> st = {0};
//      rep(i,1,n + 1){
//           while(h[st.back()] < h[i]) st.pop_back();
//           lx[i] = st.back(), st.pb(i);
//      } st = {n+1};
//      per(i,n,1){
//           while(h[st.back()] < h[i]) st.pop_back();
//           rx[i] = st.back(), st.pb(i);
//      }
//      while(q--){
//           int a, b, c, d; cin >> a >> b >> c >> d; 
//           cout << minimum_jumps(a, b, c, d) << '\n';
//      }
//      return 0; 
// }

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:10:28: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   10 |         #define rep(i,l,r) for(int i = (l); i < (r); i++)
      |                            ^~~
jumps.cpp:56:6: note: in expansion of macro 'rep'
   56 |      rep(i,0,n) h[i+1] = H[i]; h[0] = h[n+1] = inf;
      |      ^~~
jumps.cpp:56:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   56 |      rep(i,0,n) h[i+1] = H[i]; h[0] = h[n+1] = inf;
      |                                ^

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Execution timed out 4035 ms 4380 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 22 ms 208 KB Output is correct
7 Correct 14 ms 208 KB Output is correct
8 Correct 20 ms 328 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 23 ms 208 KB Output is correct
11 Correct 171 ms 208 KB Output is correct
12 Correct 131 ms 208 KB Output is correct
13 Correct 72 ms 208 KB Output is correct
14 Correct 37 ms 208 KB Output is correct
15 Correct 107 ms 208 KB Output is correct
16 Correct 44 ms 208 KB Output is correct
17 Correct 5 ms 336 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 4 ms 336 KB Output is correct
21 Correct 10 ms 208 KB Output is correct
22 Correct 4 ms 208 KB Output is correct
23 Correct 13 ms 208 KB Output is correct
24 Correct 4 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 2 ms 208 KB Output is correct
30 Correct 2 ms 208 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 1 ms 264 KB Output is correct
38 Correct 3 ms 276 KB Output is correct
39 Correct 6 ms 208 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 22 ms 208 KB Output is correct
7 Correct 14 ms 208 KB Output is correct
8 Correct 20 ms 328 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 23 ms 208 KB Output is correct
11 Correct 171 ms 208 KB Output is correct
12 Correct 131 ms 208 KB Output is correct
13 Correct 72 ms 208 KB Output is correct
14 Correct 37 ms 208 KB Output is correct
15 Correct 107 ms 208 KB Output is correct
16 Correct 44 ms 208 KB Output is correct
17 Correct 5 ms 336 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 4 ms 336 KB Output is correct
21 Correct 10 ms 208 KB Output is correct
22 Correct 4 ms 208 KB Output is correct
23 Correct 13 ms 208 KB Output is correct
24 Correct 4 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 2 ms 208 KB Output is correct
30 Correct 2 ms 208 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 1 ms 264 KB Output is correct
38 Correct 3 ms 276 KB Output is correct
39 Correct 6 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 0 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 24 ms 208 KB Output is correct
46 Correct 11 ms 208 KB Output is correct
47 Correct 21 ms 208 KB Output is correct
48 Correct 3 ms 208 KB Output is correct
49 Correct 22 ms 208 KB Output is correct
50 Correct 165 ms 336 KB Output is correct
51 Correct 130 ms 208 KB Output is correct
52 Correct 75 ms 208 KB Output is correct
53 Correct 36 ms 336 KB Output is correct
54 Correct 106 ms 208 KB Output is correct
55 Correct 42 ms 208 KB Output is correct
56 Correct 4 ms 336 KB Output is correct
57 Correct 0 ms 208 KB Output is correct
58 Execution timed out 4062 ms 336 KB Time limit exceeded
59 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Execution timed out 4041 ms 3368 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 663 ms 2116 KB Output is correct
5 Execution timed out 4042 ms 4164 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 663 ms 2116 KB Output is correct
5 Execution timed out 4042 ms 4164 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Execution timed out 4035 ms 4380 KB Time limit exceeded
4 Halted 0 ms 0 KB -