Submission #962514

#	Time	Username	Problem	Language	Result	Execution time	Memory
962514		BhavayGoyal	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	530 ms	7624 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 3e4+4;
int n, m, power[N], position[N];
vi building[N];

void sol() {
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, p; cin >> x >> p; x++;
        position[i] = x;
        power[i] = p;
        building[x].pb(power[i]);
    }
    for (int i = 1; i <= n; i++) sort(all(building[i])), building[i].erase(unique(all(building[i])), building[i].end());

    priority_queue<pii, vector<pii>, greater<>> q;
    q.push({0, position[1]}); // dist, curr building
    vi dis(n+1, inf); dis[position[1]] = 0;
    while (!q.empty()) {
        pii f = q.top(); q.pop();
        int currBuild = f.s, dist = f.f;
        if (dist != dis[currBuild]) continue;
        if (currBuild == position[2]) {
            cout << dist << endl;
            return;
        }

        for (auto x : building[currBuild]) {
            int count = 0;
            for (int i = currBuild; i <= n; i += x) {
                if (dis[i] > dis[currBuild] + count) {
                    dis[i] = dis[currBuild] + count;
                    q.push({dis[i], i});
                }
                count++;
            }
            count = 0;
            for (int i = currBuild; i >= 1; i -= x) {
                if (dis[i] > dis[currBuild] + count) {
                    dis[i] = dis[currBuild] + count;
                    q.push({dis[i], i});
                }
                count++;
            }
        }
    }
    
    cout << -1 << endl;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

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