Submission #928135

#	Time	Username	Problem	Language	Result	Execution time	Memory
928135		OAleksa	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1054 ms	67040 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int N = 30069;
const int inf = 1e18;
int n, m, a[N], b[N], dis[N];;
vector<int> c[N];
vector<pair<int, int>> g[N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n >> m;
  	for (int i = 1;i <= m;i++) {
  		cin >> a[i] >> b[i], ++a[i];
  		c[a[i]].push_back(i);
  	}
  	for (int i = 1;i <= n;i++) {
  		dis[i] = inf;
  	}
  	for (int i = 1;i <= n;i++) {
  		if (!c[i].empty()) {
  			for (int j = 1;j <= n;j++) {
  				if (!c[j].empty()) {
  					int mn = inf;
  					for (auto u : c[i]) {
  						if (abs(a[u] - j) % b[u] == 0) {
  							int d = abs(a[u] - j) / b[u];
  							mn = min(mn, d);
  						}
  					}
  					if (mn != inf) 
  						g[i].push_back({j, mn});
  				}
  			}
  		}
  	}
		priority_queue<pair<int, int>> q;
		q.push({0, a[1]});
		dis[a[1]] = 0;
		while (!q.empty()) {
			auto v = q.top().s;
			q.pop();
			for (auto u : g[v]) {
				if (dis[u.f] <= dis[v] + u.s)
					continue;
				dis[u.f] = dis[v] + u.s;
				q.push({-dis[u.f], u.f});
			}
		}
  	if (dis[a[2]] == inf)
  		cout << -1 << '\n';
  	else
  		cout << dis[a[2]] << '\n';
  }
  return 0;
}

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