제출 #1128853

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128853		Nonoze	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	57 / 100	1094 ms	2116 KiB

skyscraper

/*
*	Author: Nonoze
*	Created: Sunday 22/12/2024
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef _IN_LOCAL
	#define dbg(...)
#endif

#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

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 sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

#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(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




int n, k, m, q;
vector<pair<int, int>> a;


void solve() {
	read(k, n);
	a.clear(), a.resize(n); read(a);
	set<int> left; for (auto [u, v]: a) left.insert(u);
	int beg=a[0].fi, end=a[1].fi;
	vector<vector<int>> g(k);
	for (auto u: a) g[u.fi].pb(u.se);
	vector<int> dist(k, inf);
	vector<bool> possible(k, 1); dist[beg] = 0;
	while (1) {
		int d=inf, u=-1;
		for (int i=0; i<k; i++) {
			if (possible[i] && dist[i]<d) d=dist[i], u=i;
		}
		if (d==inf) break;
		possible[u]=0;
		left.erase(u);
		for (auto v: g[u]) {
			for (auto i: left) {
				if (abs(i-u)%v) continue;
				int dd = abs(i-u)/v;
				if (dist[i] > d+dd) {
					dist[i] = d+dd;
				}
			}
		}
	}
	if (dist[end] == inf) cout << -1 << endl;
	else cout << dist[end] << endl;
}

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