제출 #979786

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
979786		VMaksimoski008	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	88 ms	6616 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

const int M = 3e4 + 5;
vector<int> mp[M+1], B(M+1), P(M+1), D(M+1, 1e9);
set<int> S[M+1];

int main() {
    int n, m;
    cin >> n >> m;

    for(int i=0; i<m; i++) {
        cin >> B[i] >> P[i];
        if(!S[++B[i]].count(P[i])) mp[B[i]].push_back(P[i]);
        S[B[i]].insert(P[i]);
    }

    priority_queue<pii, vector<pii>, greater<pii> > pq;

    D[B[0]] = 0;
    pq.push({ 0, B[0] });

    while(!pq.empty()) {
        auto [d, u] = pq.top();
        pq.pop();

        if(d != D[u]) continue;
       
        for(int &j : mp[u]) {
            int v = u + j;
            while(v <= n) {
                if(D[v] > d + (v - u) / j) {
                    D[v] = d + (v - u) / j;
                    pq.push({ D[v], v });
                }
                if(S[v].count(j)) break;
                v += j;
            }

            v = u - j;
            while(v >= 1) {
                if(D[v] > d + (u - v) / j) {
                    D[v] = d + (u - v) / j;
                    pq.push({ D[v], v });
                }
                if(S[v].count(j)) break;
                v -= j;
            }
        }
    }

    cout << (D[B[1]] == 1e9 ? -1 : D[B[1]]) << '\n';
    return 0;
}

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