Submission #962502

#	Time	Username	Problem	Language	Result	Execution time	Memory
962502		BhavayGoyal	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	36 / 100	1070 ms	2772 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(i);
    }

    priority_queue<array<int, 2>, vector<array<int, 2>>, greater<>> q;
    q.push({0, 1}); //  curr dist, curr doge
    vi dis(m+1, inf);
    dis[1] = 0;
    while (!q.empty()) {
        array<int, 2> f = q.top(); q.pop();
        int currDoge = f[1], dist = f[0];
        if (dist != dis[currDoge]) continue;

        if (currDoge == 2) {
            cout << dist << endl; 
            return;
        }

        int currBuild = position[currDoge], pow = power[currDoge];

        for (int temppp = 0; temppp < 2; temppp++) {
            int currJump = 0;
            for (int x = currBuild; x <= n && x >= 1; x += pow) {
                for (auto ch : building[x]) {
                    if (dis[ch] > dis[currDoge] + currJump) {
                        dis[ch] = dis[currDoge] + currJump;
                        q.push({dis[ch], ch});
                    }
                }
                currJump++;
            }
            pow *= -1;
        }
    }

    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: 0 / 21
• Subtask 5: 0 / 43