Submission #995750

#	Time	Username	Problem	Language	Result	Execution time	Memory
995750		dreamboy	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	934 ms	7120 KiB

skyscraper

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define russian setlocale(LC_ALL,"Russian_Russia.20866");
#define file freopen("onlyone.in", "r", stdin), freopen("onlyone.out", "w", stdout);
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define pb push_back
#define ins insert
#define mp make_pair
#define sz(x) x.size()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define mem(x) memset(x, 0, sizeof(x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 30010;
const ll M = 600000;
const ll block = 316;
const ll mod = 998244353;
const ll P = 263;
const ld pi = acos(-1);
const ll inf = 1e9;

ll add(ll a, ll b) {
    if(a + b < 0) return a + b + mod;
    if(a + b >= mod) return a + b - mod;
    return a + b;
}

ll sub(ll a, ll b) {
    return (a - b + mod) % mod;
}

ll mul(ll a, ll b) {
    return a * 1LL * b % mod;
}

ll binpow(ll a, ll n) {
    ll res = 1LL;
    while(n) {
        if(n & 1) res = mul(res, a); // if(n % 2 == 1)
        a = mul(a, a);
        n >>= 1; //n / 2
    }
    return res;
}

ll inv(ll x) {//число х в степени -1
    return binpow(x, mod - 2);
}
ll n, m;
ll b[N], p[N], d[N];
vector<ll> g[N];
priority_queue<pll> q;
void solve() {
    cin >> n >> m;
    for(ll i = 0; i < m; i++) {
        cin >> b[i] >> p[i];//b-дом p-прыжок
        g[b[i]].pb(p[i]);
    }
    fill(d, d + n, LLONG_MAX);
    d[b[0]] = 0LL;
    q.push({d[b[0]], b[0]});
    while(!q.empty()) {
        ll v = q.top().S;
        q.pop();
        for(auto to: g[v]) {
            ll delta = v + to, dist = 1LL;
            while(delta < n) {
                if(d[delta] > d[v] + dist) {
                    d[delta] = d[v] + dist;
                    q.push({-d[delta], delta});
                }
                delta += to;
                dist++;
            }
            delta = v - to, dist = 1LL;
            while(delta >= 0) {
                if(d[delta] > d[v] + dist) {
                    d[delta] = d[v] + dist;
                    q.push({-d[delta], delta});
                }
                delta -= to;
                dist++;
            }
        }
    }
    cout << (d[b[1]] == LLONG_MAX ? -1 : d[b[1]]) << '\n';
}
signed main() {
    speed;
    //file;
    int test = 1;
    //cin >> test;
    while(test--) {
        solve();
    }
}

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