제출 #398367

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398367		kylych03	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1022 ms	3116 KiB

skyscraper

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
int d[30300][2];
vector<int> v[30300];
int p[30300];
int e[30303];
int main() {
  int n,m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> d[i][0] >> d[i][1];
    int x = d[i][0];
    int y = d[i][1];
    v[x].push_back(y);
  }
  priority_queue<pair<int,int>> q;

  for (int i = 0; i < 30300; i++)
    e[i] = 1e9;
  q.push({0,d[0][0]});
  e[d[0][0]] = 0;
  while(!q.empty()) {
    int s = q.top().s;
    int x = -q.top().f;
    q.pop();
    if (x > e[s]) continue;
    if (s == d[1][0]) {
      cout << x << "\n";
      return 0;
    }
    for (int u : v[s]) {
      int it = 1;
      for (int i = s-u; i >= 0; i -= u) {
        if (e[s] + it < e[i]) {
//          cout << s << " -> " << i << " " << it <<"\n";
          e[i] = it + e[s];
          q.push({-e[i],i});
        }
        ++it;
      }
      it = 1;
      for (int i = s+u; i < n; i += u) {
        if (e[s] + it < e[i]) {
//          cout << s << " -> " << i << " " << it << "\n";
          e[i] = it + e[s];
          q.push({-e[i],i});
        }
        ++it;
      }
    }
  }
  cout << -1 << "\n";
}

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