oj.uz

답안 #980374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980374 2024-05-12T06:50:57 Z vjudge1 밀림 점프 (APIO21_jumps) C++17
21 / 100
 596 ms 1048576 KB 
#include "jumps.h"
#include<bits/stdc++.h>

using namespace std;
#define ll long long
const int mod = 1e9 + 7;
const int inf = 1e9;

template<typename T>
int len(T &a){return a.size();}

vector<int> lef, rig;
vector<vector<int>> g;
int n;
bool sub1 = 1;
vector<vector<int>> dis;

struct Segtree{
  vector<int> t;
  int n;
  void init(int _n){
    n = _n;
    t.resize(2 * n);
  }
  int merge(const int &a, const int &b){
    return min(a, b);
  }
  void build(vector<int> &a){
    init(len(a));
    for(int i = 0; i < n; i ++) t[i + n] = a[i];
    for(int i = n - 1; i > 0; i --) t[i] = merge(t[i << 1], t[i << 1 | 1]);
  }

  int get(int l, int r){
    l += n; r += n;
    int res = inf;
    while(l <= r){
      if(l % 2) res = merge(res, t[l ++]);
      if(r % 2 == 0) res = merge(res, t[r --]);
      l /= 2; r /= 2;
    }
    return res;
  }
};
vector<Segtree> t;


void init(int N, vector<int> h) {
  n = N;
  vector<int> st;
  lef.resize(n), rig.resize(n); g.resize(n);
  t.resize(n);
  dis.assign(n, vector<int> (n, inf));
  for(int i = 0; i < n; i ++){
    if(h[i] != i + 1) sub1 = 0;
    while(!st.empty() && h[st.back()] <= h[i]) st.pop_back();
    if(st.empty()) lef[i] = -1;
    else lef[i] = st.back();
    st.push_back(i);
  }
  if(sub1) return;
  st.clear();
  for(int i = n - 1; i >= 0; i --){
    while(!st.empty() && h[st.back()] <= h[i]) st.pop_back();
    if(st.empty()) rig[i] = n;
    else rig[i] = st.back();
    st.push_back(i);
  }

  for(int i = 0; i < n; i ++){
    if(~lef[i]) g[i].push_back(lef[i]);
    if(rig[i] != n) g[i].push_back(rig[i]);
  }

  auto bfs = [&](int beg){
    queue<int> q; q.push(beg);
    dis[beg][beg] = 0;
    while(!q.empty()){
      int f = q.front(); q.pop();
      for(auto u : g[f]){
        if(dis[beg][u] != inf) continue;
        dis[beg][u] = dis[beg][f] + 1;
        q.push(u);
      }
    }
  };  
  for(int i = 0; i < n; i ++){
    bfs(i);
    t[i].build(dis[i]);
  }

}

int minimum_jumps(int A, int B, int C, int D) {
  if(sub1) return C - B;
  int mn = inf;
  for(int i = A; i <= B; i ++) mn = min(mn, t[i].get(C, D));
  return (mn == inf ? -1 : mn);
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Runtime error 596 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 496 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 856 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 856 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 2 ms 856 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 2 ms 856 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 2 ms 856 KB Output is correct
21 Correct 2 ms 856 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 2 ms 856 KB Output is correct
24 Correct 1 ms 856 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 856 KB Output is correct
29 Correct 1 ms 856 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 1 ms 1108 KB Output is correct
32 Correct 2 ms 856 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 856 KB Output is correct
36 Correct 1 ms 856 KB Output is correct
37 Correct 1 ms 856 KB Output is correct
38 Correct 1 ms 856 KB Output is correct
39 Correct 1 ms 856 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 496 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 856 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 856 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 2 ms 856 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 2 ms 856 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 2 ms 856 KB Output is correct
21 Correct 2 ms 856 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 2 ms 856 KB Output is correct
24 Correct 1 ms 856 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 856 KB Output is correct
29 Correct 1 ms 856 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 1 ms 1108 KB Output is correct
32 Correct 2 ms 856 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 856 KB Output is correct
36 Correct 1 ms 856 KB Output is correct
37 Correct 1 ms 856 KB Output is correct
38 Correct 1 ms 856 KB Output is correct
39 Correct 1 ms 856 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 2 ms 856 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 1 ms 856 KB Output is correct
48 Correct 1 ms 600 KB Output is correct
49 Correct 2 ms 856 KB Output is correct
50 Correct 1 ms 600 KB Output is correct
51 Correct 2 ms 856 KB Output is correct
52 Correct 2 ms 856 KB Output is correct
53 Correct 2 ms 856 KB Output is correct
54 Correct 1 ms 856 KB Output is correct
55 Correct 1 ms 856 KB Output is correct
56 Correct 2 ms 856 KB Output is correct
57 Correct 1 ms 856 KB Output is correct
58 Correct 62 ms 34784 KB Output is correct
59 Correct 92 ms 47692 KB Output is correct
60 Correct 10 ms 8536 KB Output is correct
61 Correct 97 ms 47724 KB Output is correct
62 Correct 7 ms 856 KB Output is correct
63 Correct 89 ms 47704 KB Output is correct
64 Correct 14 ms 16472 KB Output is correct
65 Correct 119 ms 47772 KB Output is correct
66 Correct 112 ms 47952 KB Output is correct
67 Correct 101 ms 47688 KB Output is correct
68 Correct 93 ms 47704 KB Output is correct
69 Correct 72 ms 47700 KB Output is correct
70 Correct 51 ms 47704 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 2 ms 1016 KB Output is correct
74 Correct 1 ms 856 KB Output is correct
75 Correct 1 ms 856 KB Output is correct
76 Correct 2 ms 856 KB Output is correct
77 Correct 2 ms 856 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 ms 856 KB Output is correct
82 Correct 1 ms 856 KB Output is correct
83 Correct 1 ms 856 KB Output is correct
84 Correct 1 ms 856 KB Output is correct
85 Correct 1 ms 856 KB Output is correct
86 Correct 1 ms 344 KB Output is correct
87 Correct 0 ms 600 KB Output is correct
88 Correct 1 ms 856 KB Output is correct
89 Correct 1 ms 856 KB Output is correct
90 Correct 1 ms 856 KB Output is correct
91 Correct 1 ms 856 KB Output is correct
92 Correct 1 ms 856 KB Output is correct
93 Correct 1 ms 856 KB Output is correct
94 Correct 2 ms 1112 KB Output is correct
95 Correct 49 ms 47692 KB Output is correct
96 Correct 52 ms 47952 KB Output is correct
97 Correct 58 ms 47684 KB Output is correct
98 Correct 54 ms 47704 KB Output is correct
99 Correct 63 ms 47696 KB Output is correct
100 Correct 1 ms 856 KB Output is correct
101 Correct 6 ms 7000 KB Output is correct
102 Correct 40 ms 47932 KB Output is correct
103 Correct 48 ms 47808 KB Output is correct
104 Correct 36 ms 47704 KB Output is correct
105 Correct 42 ms 47704 KB Output is correct
106 Correct 48 ms 47696 KB Output is correct
107 Correct 1 ms 856 KB Output is correct
108 Correct 6 ms 10584 KB Output is correct
109 Correct 25 ms 47688 KB Output is correct
110 Correct 38 ms 47700 KB Output is correct
111 Correct 26 ms 47688 KB Output is correct
112 Correct 34 ms 47440 KB Output is correct
113 Correct 36 ms 47700 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Runtime error 381 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Runtime error 364 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Runtime error 364 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Runtime error 596 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -