제출 #539071

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
539071		SlavicG	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	438 ms	262144 KiB

skyscraper

#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

const int N = 3e5 + 10;
vector<pair<int,int>> adj[N];
vector<int> dog[N];
bool vis[N];

void solve() {
    int n, m; cin >> n >> m;
    vector<int> b(m), p(m);

    int start = -1, endd = -1;
    for(int i = 0;i < m; ++i) {
        cin >> b[i] >> p[i];
        dog[b[i]].pb(i);
        if(i == 0) start = b[i];
        if(i == 1) endd = b[i];
    } 

    for(int i = 0;i < n; ++i) {
        vector<bool> viss((int)3e4 + 5, false);
        for(int f: dog[i]) {
            int c = p[f];
            if(viss[c]) continue;
            viss[c] = true;
            int pp = i;
            int jumps = 0;
            while(pp + c < n) {
                ++jumps;
                adj[i].pb({pp + c, jumps});
                pp += c;
            }
            pp = i, jumps = 0;
            while(pp - c >= 0) {
                ++jumps;
                adj[i].pb({pp - c, jumps});
                pp -= c;
            }
        }
    }

    vector<int> dist(N, INT_MAX);
    
    priority_queue<pair<int,int>> q;
    q.push({0, start});
    dist[start] = 0;
    
    while(!q.empty()) {
        int u = q.top().second;
        q.pop();
        if(vis[u]) continue;
        vis[u] = true;

        for(auto x: adj[u]) {
            int w = x.second, v = x.first; 
            if(dist[v] > dist[u] + w) {
                dist[v] = dist[u] + w;
                q.push({-dist[v], v});
            }
        }
    }
    
    if(dist[endd] == INT_MAX) cout << "-1\n";
    else
    cout << dist[endd] << "\n";
}

 
int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

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