Submission #1183760

#	Time	Username	Problem	Language	Result	Execution time	Memory
1183760		swishy123	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	0 / 100	1 ms	328 KiB

skyscraper

#include <iostream>
#include <algorithm>
#include <vector>
#include <random>
#include <chrono>
#include <set>
#include <map>
#include <stack>
#include <functional>
#include <iomanip>
#include <queue>
#include <cassert>
#include <complex>
#include <cstring>
#include <memory>
#include <bitset>
#include <sstream>
#include <cmath>
#include <numeric>
#include <numbers>
#include <fstream>

using namespace std;

#ifndef template
#ifndef define
 
#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define pi pair<int, int>
#define nl cout << '\n';
#define x first
#define y second 
#define cbit(x) __builtin_popcountll(x)
#define uid(a, b) uniform_int_distribution<ll>(a, b)(rng) 
#define siz(x) (int)x.size()
 
#endif
 
#ifndef print
void print(size_t x) {cout << x << ' ';}
void print(int x) {cout << x << ' ';}
void print(long long x) {cout << x << ' ';}
void print(float x) {cout << x << ' ';}
void print(long double x) {cout << x << ' ';}
void print(char x) {cout << x << ' ';}
void print(const char* x) {cout << x << ' ';}
void print(bool x) {cout << x << ' ';}
void print(string &x) {cout << x << ' ';}
 
template<typename T, typename V>
void print(pair<T, V> &p) {print(p.x); print(p.y);}
template<typename T>
void print(vector<T> v) {for (int i = 0; i < v.size(); i++) print(v[i]);}
template<typename T>
void print(vector<vector<T>> v) {
    for (int i = 0; i < v.size(); i++){
        for (int j = 0; j < v[i].size(); j++)
            print(v[i][j]);
        nl;
    }
}
template <typename T, typename... V>
void print(T t, V&&... v) {print(t); print(v...);}
 
#endif
 
#ifndef read
void read(int &x) {cin >> x;}
void read(long long &x) {cin >> x;}
void read(unsigned &x) {cin >> x;}
void read(unsigned long long &x) {cin >> x;}
void read(float &x) {cin >> x;}
void read(long double &x) {cin >> x;}
void read(char &x) {cin >> x;}
void read(string &x) {cin >> x;}
void read(bool &x) {cin >> x;}
 
template<typename T> 
void read(vector<T> &v) {
    for (int i = 0; i < v.size(); i++)
        read(v[i]);
}
template <typename T, typename... V>
void read(T &t, V&... v) {read(t); read(v...);}
#endif
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool maxi(T& a, const T& b) {
    return a < b ? a = b, 1 : 0;
}
template<class T> bool mini(T& a, const T& b) {
    return a > b ? a = b, 1 : 0;
}
template<class... Args>
auto vec(size_t n, Args&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector(n, args...);
    else
        return vector(n, vec(args...));
}

#endif

using namespace std;
const int inf = 1e9;
const ll def = 1e7+1;
const ll mod = 998244353;

void solve(){  
    int n, m;
    read(n, m);

    auto dp = vec(n, inf);
    vector<vector<int>> doge(n);

    for (int i = 0; i < m; i++){
        int u, x;
        read(u, x);
        doge[u].push_back(x);
    }
    priority_queue<pi, vector<pi>, greater<pi>> pq;
    dp[0] = 0;
    
    pq.push({0, 0});
    while (pq.size()){
        auto [dis, u] = pq.top(); pq.pop();
        if (dis > dp[u])
            continue;
        for (int x : doge[u]){
            for (int v = u % x; v < n; v += x){
                int ndis = dis + abs(v - u) / x;
                if (ndis < dp[v]){
                    pq.push({ndis, v});
                    dp[v] = ndis;
                }
            }
        }
    }
    int res = dp[1];
    if (res == inf)
        res = -1;
    print(res);
}       

/*
*/

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    // if (ifstream("input.txt").good()){
    //     freopen("input.txt", "r", stdin);
    //     freopen("output.txt", "w", stdout);
    // }

    int t;  
    t = 1;

    while (t--){
        solve();
        nl;
    }
}

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