제출 #838944

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
838944		tch1cherin	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	273 ms	262144 KiB

skyscraper

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

template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, M;
  cin >> N >> M;
  vector<vector<pair<int, int>>> G(N);
  vector<int> B(M), P(M);
  for (int i = 0; i < M; i++) {
    cin >> B[i] >> P[i];
    for (int j = B[i] % P[i]; j < N; j += P[i]) {
      G[B[i]].push_back({j, abs(B[i] - j) / P[i]});
    }
  }
  min_heap<pair<int, int>> Q;
  vector<int> dist(N, INT_MAX);
  dist[B[0]] = 0;
	Q.push({0, B[0]});
  while (!Q.empty()) {
    auto [d, u] = Q.top();
    Q.pop();
    if (d > dist[u]) {
      continue;
    }
    for (auto [v, w] : G[u]) {
			if (dist[u] + w < dist[v]) {
				dist[v] = dist[u] + w;
				Q.push({dist[v], v});
			}
    }
  }
	cout << (dist[B[1]] == INT_MAX ? -1 : dist[B[1]]) << "\n";
}

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