제출 #490308

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
490308		JerryLiu06	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	148 ms	65584 KiB

skyscraper

// https://oj.uz/problem/view/BOI16_park
 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 3e4 + 10;
const ll INF = 1e18;

int N, M, B[MX], P[MX]; vpi adj[MX]; unordered_set<int> MP[MX];

int main() {
    FASTIO;

    cin >> N >> M;

    F0R(i, M) {
        cin >> B[i] >> P[i];

        MP[B[i]].insert(P[i]);
    }
    F0R(i, N) {
        EACH(D, MP[i]) {
            int curNode = i + D, dist = 1;

            while (curNode < N) {
                adj[i].pb({curNode, dist});
                
                if (MP[curNode].count(D)) {
                    break;
                }
                curNode += D, dist++;
            }
            curNode = i - D, dist = 1;

            while (curNode >= 0) {
                adj[i].pb({curNode, dist});
                
                if (MP[curNode].count(D)) {
                    break;
                }
                curNode -= D, dist++;
            }
        }
    }
    priority_queue<pi, vpi, greater<pi>> PQ;

    int minDist[MX]; 

    F0R(i, N) {
        minDist[i] = MOD;
    }
    minDist[B[0]] = 0;

    PQ.push({0, B[0]});

    while (!PQ.empty()) {
        pi cur = PQ.top(); PQ.pop();

        if (cur.s == B[1]) {
            return cout << minDist[B[1]], 0;
        }
        if (cur.f > minDist[cur.s]) {
            continue;
        }
        EACH(nxt, adj[cur.s]) {
            if (minDist[nxt.f] > minDist[cur.s] + nxt.s) {
                minDist[nxt.f] = minDist[cur.s] + nxt.s;
                
                PQ.push({minDist[nxt.f], nxt.f});
            }
        }
    }
    cout << "-1";
}

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