Submission #887506

#	Time	Username	Problem	Language	Result	Execution time	Memory
887506		stdfloat	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	0 / 100	0 ms	348 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    vector<int> a(n, 0);
    for (int i = 0; i < m; i++) {
        int b;
        cin >> b >> a[b];

        if (!i) assert(!b);
    }

    vector<int> dis(n, INT_MAX); dis[0] = 0;
    priority_queue<vector<int>> q; q.push({0, 0});
    while (!q.empty()) {
        vector<int> v = q.top(); q.pop();

        for (int i = v[1] - a[v[1]]; i >= 0; i -= a[v[1]]) {
            if (dis[i] > dis[v[1]] + (v[1] - i) / a[v[1]]) {
                dis[i] = dis[v[1]] + (v[1] - i) / a[v[1]];
                if (a[i]) q.push({-dis[i], i});
            }
        }
        for (int i = v[1] + a[v[1]]; i < n; i += a[v[1]]) {
            if (dis[i] > dis[v[1]] + (i - v[1]) / a[v[1]]) {
                dis[i] = dis[v[1]] + (i - v[1]) / a[v[1]];
                if (a[i]) q.push({-dis[i], i});
            }
        }
    }

    cout << (dis[1] != INT_MAX ? dis[1] : -1);
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43