oj.uz

답안 #561312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561312 2022-05-12T15:43:35 Z InternetPerson10 밀림 점프 (APIO21_jumps) C++17
27 / 100
 1621 ms 75852 KB 
#include "jumps.h"
#include <bits/stdc++.h>

using namespace std;

int subtask = 1;

int n;
vector<int> nums, l, r;
vector<vector<int>> liftBig, liftRight, liftLeft;

bool invalid(int k) {
    if(k == -1 || k == n) return true;
    return false;
}

int bigger(int a, int b) {
    if(invalid(a) && invalid(b)) return -1;
    if(invalid(a)) return b;
    if(invalid(b)) return a;
    if(nums[a] > nums[b]) return a;
    return b;
}

void init(int N, std::vector<int> H) {
    bool subtask1 = true;
    for(int i = 0; i < N; i++) {
        if(H[i] != i+1) subtask1 = false;
        H[i]--;
    }
    if(subtask1) subtask = 1;
    else if(N <= 200) subtask = 2;
    else subtask = 3;
    n = N;
    nums = H;
    l.resize(n, -1);
    r.resize(n, n);
    liftBig.resize(n, vector<int>(20));
    liftRight.resize(n, vector<int>(20));
    liftLeft.resize(n, vector<int>(20));
    vector<int> v;
    v.push_back(0);
    for(int i = 1; i < n; i++) {
        while(v.size()) {
            if(nums[v.back()] < nums[i]) {
                r[v.back()] = i;
                v.pop_back();
            }
            else break;
        }
        v.push_back(i);
    }
    v.clear();
    v.push_back(n-1);
    for(int i = n-2; i >= 0; i--) {
        while(v.size()) {
            if(nums[v.back()] < nums[i]) {
                l[v.back()] = i;
                v.pop_back();
            }
            else break;
        }
        v.push_back(i);
    }
    for(int j = 0; j < N; j++) {
        liftBig[j][0] = bigger(l[j], r[j]);
        liftLeft[j][0] = l[j];
        if(r[j] == n) liftRight[j][0] = -1;
        else liftRight[j][0] = r[j];
    }
    for(int i = 1; i < 20; i++) {
        for(int j = 0; j < N; j++) {
            if(liftBig[j][i-1] == -1) liftBig[j][i] = -1;
            else liftBig[j][i] = liftBig[liftBig[j][i-1]][i-1];
            if(liftRight[j][i-1] == -1) liftRight[j][i] = -1;
            else liftRight[j][i] = liftRight[liftRight[j][i-1]][i-1];
            if(liftLeft[j][i-1] == -1) liftLeft[j][i] = -1;
            else liftLeft[j][i] = liftLeft[liftLeft[j][i-1]][i-1];
        }
    }
}

int BIG = 1e9 + 7;

int reachable(int x, int C, int D) {
    if(C <= x && x <= D) return 0;
    if(x > D) return -1;
    int ans2 = BIG, tot = 0;
    for(int i = 19; i >= 0; i--) {
        if(liftRight[x][i] == -1) continue;
        if(liftRight[x][i] > D) continue;
        if(liftRight[x][i] >= C) ans2 = min(ans2, tot + (1 << i));
        else {
            x = liftRight[x][i];
            tot += (1 << i);
        }
    }
    if(ans2 == BIG) return -1;
    return ans2;
}

int single_min_jumps(int x, int C, int D) {
    int r = reachable(x, C, D);
    if(r == -1) return BIG;
    int ans = r;
    int tot = 0;
    if(subtask == 2) {
        while(liftBig[x][0] != -1) {
            x = liftBig[x][0];
            tot++;
            r = reachable(x, C, D);
            if(r != -1) ans = min(ans, r + tot);
        }
    }
    for(int i = 19; i >= 0; i--) {
        if(liftBig[x][i] == -1) continue;
        int r = reachable(liftBig[x][i], C, D);
        if(r == -1) continue;
        ans = min(ans, tot + (1 << i) + r);
        if(r != 0) {
            x = liftBig[x][i];
            tot += (1 << i);
        }
    }
    return ans;
}

int minimum_jumps(int A, int B, int C, int D) {
    if(subtask == 1) {
        return C - B;
    }
    for(int i = 19; i >= 0; i--) {
        if(liftLeft[B][i] == -1) continue;
        if(liftLeft[B][i] < A) continue;
        B = liftLeft[B][i];
    }
    int ans = single_min_jumps(B, C, D);
    if(ans == BIG) return -1;
    return ans;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 226 ms 60572 KB Output is correct
4 Correct 984 ms 75816 KB Output is correct
5 Correct 715 ms 38320 KB Output is correct
6 Correct 858 ms 75712 KB Output is correct
7 Correct 610 ms 52176 KB Output is correct
8 Correct 834 ms 75792 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Incorrect 2 ms 208 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Incorrect 2 ms 208 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 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 Correct 140 ms 60124 KB Output is correct
6 Correct 179 ms 74668 KB Output is correct
7 Correct 94 ms 38352 KB Output is correct
8 Correct 180 ms 74552 KB Output is correct
9 Correct 26 ms 11464 KB Output is correct
10 Correct 170 ms 74664 KB Output is correct
11 Correct 170 ms 75816 KB Output is correct
12 Incorrect 191 ms 75708 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 311 ms 34288 KB Output is correct
5 Correct 950 ms 74648 KB Output is correct
6 Correct 606 ms 12568 KB Output is correct
7 Correct 977 ms 74776 KB Output is correct
8 Correct 528 ms 25908 KB Output is correct
9 Correct 876 ms 74640 KB Output is correct
10 Correct 1012 ms 75816 KB Output is correct
11 Correct 1321 ms 75820 KB Output is correct
12 Correct 1256 ms 75800 KB Output is correct
13 Correct 941 ms 74656 KB Output is correct
14 Correct 1469 ms 75204 KB Output is correct
15 Correct 1124 ms 75792 KB Output is correct
16 Correct 928 ms 75812 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 19 ms 976 KB Output is correct
28 Correct 22 ms 976 KB Output is correct
29 Correct 25 ms 976 KB Output is correct
30 Correct 13 ms 976 KB Output is correct
31 Correct 22 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 110 ms 43344 KB Output is correct
34 Correct 180 ms 74668 KB Output is correct
35 Correct 201 ms 75824 KB Output is correct
36 Correct 187 ms 74688 KB Output is correct
37 Correct 242 ms 75236 KB Output is correct
38 Correct 197 ms 75852 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 311 ms 34288 KB Output is correct
5 Correct 950 ms 74648 KB Output is correct
6 Correct 606 ms 12568 KB Output is correct
7 Correct 977 ms 74776 KB Output is correct
8 Correct 528 ms 25908 KB Output is correct
9 Correct 876 ms 74640 KB Output is correct
10 Correct 1012 ms 75816 KB Output is correct
11 Correct 1321 ms 75820 KB Output is correct
12 Correct 1256 ms 75800 KB Output is correct
13 Correct 941 ms 74656 KB Output is correct
14 Correct 1469 ms 75204 KB Output is correct
15 Correct 1124 ms 75792 KB Output is correct
16 Correct 928 ms 75812 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 19 ms 976 KB Output is correct
28 Correct 22 ms 976 KB Output is correct
29 Correct 25 ms 976 KB Output is correct
30 Correct 13 ms 976 KB Output is correct
31 Correct 22 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 110 ms 43344 KB Output is correct
34 Correct 180 ms 74668 KB Output is correct
35 Correct 201 ms 75824 KB Output is correct
36 Correct 187 ms 74688 KB Output is correct
37 Correct 242 ms 75236 KB Output is correct
38 Correct 197 ms 75852 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 258 ms 34292 KB Output is correct
43 Correct 1193 ms 74660 KB Output is correct
44 Correct 627 ms 12496 KB Output is correct
45 Correct 874 ms 74668 KB Output is correct
46 Correct 430 ms 25912 KB Output is correct
47 Correct 1036 ms 74664 KB Output is correct
48 Correct 860 ms 75816 KB Output is correct
49 Correct 1516 ms 75816 KB Output is correct
50 Correct 1621 ms 75768 KB Output is correct
51 Correct 898 ms 74664 KB Output is correct
52 Correct 1447 ms 75184 KB Output is correct
53 Correct 1045 ms 75732 KB Output is correct
54 Correct 1181 ms 75812 KB Output is correct
55 Correct 1 ms 208 KB Output is correct
56 Incorrect 265 ms 74284 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 226 ms 60572 KB Output is correct
4 Correct 984 ms 75816 KB Output is correct
5 Correct 715 ms 38320 KB Output is correct
6 Correct 858 ms 75712 KB Output is correct
7 Correct 610 ms 52176 KB Output is correct
8 Correct 834 ms 75792 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Incorrect 2 ms 208 KB Output isn't correct
14 Halted 0 ms 0 KB -