Submission #1120123

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120123		mmdrzada	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	0 / 100	1 ms	760 KiB

skyscraper

#include <bits/stdc++.h>
 
using namespace std;

typedef vector<int> vi;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
 
#define sep ' '
#define F first
#define S second
#define fastIO   ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define kill(x) {cout << x << endl;return;}
#define sz(x) int(x.size())
#define SP(x) setprecision(x) 
#define mod(x) (1ll*x%M+M)%M
#define pq priority_queue
#define mid (l+r)/2
// #define mid2 (l+r+1)/2
#define pll pair<ll, ll>
#define REP(i, k) for (int i = 0 ; i < k ; i ++)
#define MP make_pair

const int M = 998244353;
const int N = 5e3+1;
int n, m;
vector<pair<int, int>> adj[N];
ll dis[N];

void solve() {
	// input in 0-index itself
	cin >> n >> m;
	for(int i = 0 ; i < m ; i ++) {
		int b, p; cin >> b >> p;
		for(int j = b+p, cnt = 1 ; j < n ; j += p, cnt++) {
			adj[b].pb({j, cnt});
		}
		for(int j = b-p, cnt = 1 ; j >= 0 ; j -= p, cnt ++) {
			adj[b].pb({j, cnt});
		}
	}
	fill(dis, dis+n, -1);
	pq<pair<ll, int>> q;
	q.push({0, 0});
	while(!q.empty()) {
		auto [d, u] = q.top();
		q.pop();
		if (dis[u] != -1) continue;
		dis[u] = -d;
		for(auto [neigh, w]: adj[u]) {
			if (dis[neigh] == -1 || dis[neigh] > 0ll + dis[u] - d) {
				q.push({0ll + -dis[u] - w, neigh});
			}
		}
	}
	cout << dis[1] << endl;
}

// check MAXN
int32_t main() {
	fastIO;
	solve();
	
	return 0;
}

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