제출 #388796

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388796		talant117408	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	0 / 100	2 ms	1740 KiB

skyscraper

/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
 
const int mod = 998244353;
 
ll mode(ll a) {
    a %= mod;
    if (a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 3e4+7;
int dist[N];
vector <int> who[N];
vector <pii> graph[N];

void dijkstra() {
	for (int i = 1; i < N; i++) {
		dist[i] = 1e9;
	}
	priority_queue <pii> K;
	K.push(mp(0, 0));
	
	while(!K.empty()) {
		auto v = K.top().second; K.pop();
		for (auto to : graph[v]) {
			if (dist[to.first] > dist[v]+to.second) {
				dist[to.first] = dist[v]+to.second;
				K.push(mp(-dist[to.first], to.first));
			}
		}
	}
}

int main() {
    do_not_disturb
    
    int h, n;
    cin >> h >> n;
    vector <pii> doges(n);
    for (auto &to : doges) cin >> to.first >> to.second;
    for (int i = 0; i < n; i++) {
		who[doges[i].first].pb(i);
	}
	
	for (int i = 0; i < n; i++) {
		int cnt = 0;
		int j = doges[i].first;
		int jump = doges[i].second;
		while (j+jump < h) {
			j += jump;
			cnt++;
			for (auto to : who[j]) {
				graph[i].pb(mp(to, cnt));
			}
		}
		j = doges[i].first;
		cnt = 0;
		while (j-jump >= 0) {
			j -= jump;
			cnt++;
			for (auto to : who[j]) {
				graph[i].pb(mp(to, cnt));
			}
		}
	}
	
	dijkstra();
	cout << (dist[1] >= 1e9 ? -1 : dist[1]);
    
    return 0;
}

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