Submission #1129545

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129545		belgianbot	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	36 / 100	1096 ms	1380 KiB

skyscraper

/*
    AUTHOR : BELGIANBOT
*/

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

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define pb push_back
#define fi first
#define se second
#define ordered_set tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sz(x) (int)(x.size())
#define YES cout<<"YES\n";
#define Yes cout<<"Yes\n";
#define NO cout<<"NO\n";
#define No cout << "No\n";
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
//#define int long long
#define double long double


const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;

void solve();

signed main() {
   ios::sync_with_stdio(false);
   int t = 1;
   //cin >> t;
   while (t--) solve();
   return 0;
}

vector<pair<int,int>>  b;
int n, m;
void solve() {
    cin >> n >> m;
    b.clear();
    b.resize(m);
    for (int i = 0; i < m; i++) {
        cin >> b[i].fi >> b[i].se;
    }

    pair<int,int> start = b[0];
    pair<int,int> end = b[1];
    sort(all(b));
    int index = lower_bound(all(b), start) - b.begin();
    int index2 = lower_bound(all(b), end) - b.begin();
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> q;
    q.push({0,index});
    vector<int> dist(m, inf); dist[index] = 0;
    vector<bool> processed(m, false);

    while(!q.empty()) {
        auto [u,v] = q.top(); q.pop();
        if(v==index2) break;
        if (processed[v]) continue;
        processed[v] = true;
        for (int i = v + 1; i < m; i++) {
            if (processed[i]) continue;
            if ( (b[i].fi - b[v].fi) % b[v].se == 0) {
                if (dist[i] > dist[v] + (b[i].fi - b[v].fi) / b[v].se) {
                    dist[i] = dist[v] + (b[i].fi - b[v].fi) / b[v].se;
                    q.push({dist[i], i});
                }
                if (b[i].se == b[v].se) break;
            }
            
        }
        for (int i = v - 1; i >= 0; i--) {
            if (processed[i]) continue;
            if ( (b[v].fi - b[i].fi) % b[v].se == 0) {
                if (dist[i] > dist[v] + (b[v].fi - b[i].fi) / b[v].se) {
                    dist[i] = dist[v] + (b[v].fi - b[i].fi) / b[v].se;
                    q.push({dist[i], i});
                }
                if (b[i].se == b[v].se) break;
            }
        }
    }
    cout << (dist[index2] == inf ? -1 : dist[index2]) << '\n';
}

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