oj.uz

답안 #561324

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561324 2022-05-12T16:15:15 Z InternetPerson10 밀림 점프 (APIO21_jumps) C++17
8 / 100
 4000 ms 526980 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) { // With a series of right jumps
    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);
        }
        return ans;
    }
    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;
}

map<pair<int, pair<int, int>>, int> dp;

int single_min_jumps_brute(int x, int C, int D) {
    if(invalid(x)) return BIG;
    pair<int, pair<int, int>> p = {x, {C, D}};
    if(dp.count(p)) return dp[p];
    if(C <= x && x <= D) return dp[p] = 0;
    return dp[p] = min(single_min_jumps_brute(l[x], C, D),
            single_min_jumps_brute(r[x], C, D)) + 1;
}

int minimum_jumps(int A, int B, int C, int D) {
    if(subtask == 1) {
        // return C - B;
    }
    int ans2 = BIG;
    for(int i = A; i <= B; i++) {
        ans2 = min(ans2, single_min_jumps_brute(i, C, D));
    }
    if(ans2 == BIG) ans2 = -1;
    for(int i = 19; i >= 0; i--) {
        if(liftLeft[B][i] == -1) continue;
        if(liftLeft[B][i] < A) continue;
        if(reachable(liftLeft[B][i], C, D) == -1) continue;
        B = liftLeft[B][i];
    }
    int ans = single_min_jumps(B, C, D);
    if(ans == BIG) ans = -1;
    /*
    cout << "CASE: " << A << ' ' << B << ' ' << C << ' ' << D << '\n';
    cout << "ANS: " << ans << '\n';
    cout << "BRUTE: " << ans2 << '\n';
    */
    assert(ans == ans2);
    return ans;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Execution timed out 4038 ms 526980 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.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 1 ms 208 KB Output is correct
5 Correct 3 ms 304 KB Output is correct
6 Correct 11 ms 1012 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 9 ms 976 KB Output is correct
9 Correct 2 ms 464 KB Output is correct
10 Correct 9 ms 976 KB Output is correct
11 Correct 9 ms 1360 KB Output is correct
12 Correct 11 ms 1284 KB Output is correct
13 Correct 12 ms 1296 KB Output is correct
14 Correct 12 ms 1016 KB Output is correct
15 Correct 16 ms 1872 KB Output is correct
16 Correct 12 ms 1396 KB Output is correct
17 Correct 7 ms 804 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 9 ms 720 KB Output is correct
21 Correct 6 ms 976 KB Output is correct
22 Correct 7 ms 800 KB Output is correct
23 Correct 11 ms 1176 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Correct 0 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 4 ms 336 KB Output is correct
29 Correct 6 ms 720 KB Output is correct
30 Correct 5 ms 336 KB Output is correct
31 Correct 10 ms 1096 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 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct

Subtask #3
0 / 13.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 1 ms 208 KB Output is correct
5 Correct 3 ms 304 KB Output is correct
6 Correct 11 ms 1012 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 9 ms 976 KB Output is correct
9 Correct 2 ms 464 KB Output is correct
10 Correct 9 ms 976 KB Output is correct
11 Correct 9 ms 1360 KB Output is correct
12 Correct 11 ms 1284 KB Output is correct
13 Correct 12 ms 1296 KB Output is correct
14 Correct 12 ms 1016 KB Output is correct
15 Correct 16 ms 1872 KB Output is correct
16 Correct 12 ms 1396 KB Output is correct
17 Correct 7 ms 804 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 9 ms 720 KB Output is correct
21 Correct 6 ms 976 KB Output is correct
22 Correct 7 ms 800 KB Output is correct
23 Correct 11 ms 1176 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Correct 0 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 4 ms 336 KB Output is correct
29 Correct 6 ms 720 KB Output is correct
30 Correct 5 ms 336 KB Output is correct
31 Correct 10 ms 1096 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 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 1 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 10 ms 1016 KB Output is correct
46 Correct 5 ms 756 KB Output is correct
47 Correct 10 ms 976 KB Output is correct
48 Correct 2 ms 464 KB Output is correct
49 Correct 12 ms 976 KB Output is correct
50 Correct 12 ms 1452 KB Output is correct
51 Correct 10 ms 1388 KB Output is correct
52 Correct 10 ms 1232 KB Output is correct
53 Correct 9 ms 960 KB Output is correct
54 Correct 16 ms 1872 KB Output is correct
55 Correct 12 ms 1324 KB Output is correct
56 Correct 6 ms 720 KB Output is correct
57 Correct 0 ms 336 KB Output is correct
58 Correct 535 ms 40344 KB Output is correct
59 Runtime error 117 ms 23496 KB Execution killed with signal 6
60 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 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 210 ms 64424 KB Output is correct
6 Correct 275 ms 85060 KB Output is correct
7 Correct 85 ms 38384 KB Output is correct
8 Correct 295 ms 87964 KB Output is correct
9 Correct 38 ms 13288 KB Output is correct
10 Correct 223 ms 78712 KB Output is correct
11 Correct 476 ms 133272 KB Output is correct
12 Correct 467 ms 113964 KB Output is correct
13 Correct 350 ms 109068 KB Output is correct
14 Correct 241 ms 82104 KB Output is correct
15 Runtime error 612 ms 257544 KB Execution killed with signal 6
16 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 712 ms 63460 KB Output is correct
5 Correct 3548 ms 207280 KB Output is correct
6 Correct 2008 ms 81404 KB Output is correct
7 Execution timed out 4083 ms 208228 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 712 ms 63460 KB Output is correct
5 Correct 3548 ms 207280 KB Output is correct
6 Correct 2008 ms 81404 KB Output is correct
7 Execution timed out 4083 ms 208228 KB Time limit exceeded
8 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 Execution timed out 4038 ms 526980 KB Time limit exceeded
4 Halted 0 ms 0 KB -