oj.uz

Submission #374955

# Submission time Handle Problem Language Result Execution time Memory
374955 2021-03-08T16:50:42 Z Alma Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 1 ms 384 KB 
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> position;
vector<int> DP;

int minimumJumps (int l, int r, int idx, vector<bool> & visited, int jumps) {
    if (idx == 1) {
        return 0;
    } else if (DP[idx] != -1) {
        return DP[idx];
    }
    visited[idx] = true;
    int left, right, p = position[idx];
    left = idx - p;
    for (int i = 1; left >= l; i++) {
        if (position[left] != 0 && !visited[left]) {
            jumps = min(jumps, i + minimumJumps(l, r, left, visited, jumps));
        }
        left -= p;
    }
    right = idx + p;
    for (int i = 1; right <= r; i++) {
        if (position[right] != 0 && !visited[right]) {
            jumps = min(jumps, i + minimumJumps(l, r, right, visited, jumps));
        }
        right += p;
    }
    return DP[idx] = jumps;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m, x, p, answer;
    cin >> n >> m;
    position.assign(n, 0);
    DP.assign(n, -1);
    vector<bool> visited(n, false);
    while (m--) {
        cin >> x >> p;
        position[x] = p;
    }
    position[1] = 1e9;
    answer = minimumJumps(0, n-1, 0, visited, 1e9);
    if (answer == 1e9) {
        cout << -1 << '\n';
    } else {
        cout << answer << '\n';
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -