제출 #1202978

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1202978		rshohruh	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	100 / 100	589 ms	8872 KiB

skyscraper

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define inf 1e18

const int MXN = 3e4 + 5;

int b[MXN], p[MXN], dist[MXN];
vector<int> adj[MXN];
map<int, int> mp[MXN];

signed main() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) dist[i] = inf;
    for (int i = 0; i < m; i++) {
        cin >> b[i] >> p[i];
        adj[b[i]].push_back(p[i]);
    }
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    dist[b[0]] = 0;
    pq.push({0, b[0]});
    while (!pq.empty()) {
        auto [k, u] = pq.top();
        pq.pop();
        if (k > dist[u]) continue;
        for (int v : adj[u]) {
            if (mp[v].find(u) != mp[v].end()) continue;
            mp[v][u];
            for (int i = u - v, t = 1; i >= 0; i -= v, ++t) {
                if (dist[i] > dist[u] + t) {
                    dist[i] = dist[u] + t;
                    pq.push({dist[i], i});
                }
            }
            for (int i = u + v, t = 1; i < n; i += v, ++t) {
                if (dist[i] > dist[u] + t) {
                    dist[i] = dist[u] + t;
                    pq.push({dist[i], i});
                }
            }
        }
    }
    cout << (dist[b[1]] >= inf ? -1 : dist[b[1]]) << '\n';
}

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