제출 #259598

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259598		KoD	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	143 ms	7916 KiB

skyscraper

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <queue>
#include <set>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = typename std::decay<T>::type::reverse_iterator;

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 19 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  i32 N, M;
  std::cin >> N >> M;
  std::vector<i32> B(M), P(M);
  std::vector<std::set<i32>> lives(N);
  for (auto i: range(0, M)) {
    std::cin >> B[i] >> P[i];
    lives[B[i]].insert(P[i]);
  }
  std::priority_queue<std::pair<i32, i32>, std::vector<std::pair<i32, i32>>, std::greater<std::pair<i32, i32>>> que;
  std::vector<i32> dist(N, inf32);
  dist[B[0]] = 0;
  que.emplace(dist[B[0]], B[0]);
  while (!que.empty()) {
    const auto [d, u] = que.top();
    que.pop();
    if (d > dist[u]) {
      continue;
    }
    for (auto p: lives[u]) {
      {
        i32 cost = 1;
        i32 v = u - p;
        while (v >= 0) {
          if (chmin(dist[v], dist[u] + cost)) {
            que.emplace(dist[v], v);
            lives[v].erase(p);
          }
          ++cost;
          v -= p;
        }
      }
      {
        i32 cost = 1;
        i32 v = u + p;
        while (v < N) {
          if (chmin(dist[v], dist[u] + cost)) {
            que.emplace(dist[v], v);
            lives[v].erase(p);
          }
          ++cost;
          v += p;
        }
      }
    }
  }
  std::cout << (dist[B[1]] == inf32 ? -1 : dist[B[1]]) << '\n';
  return 0;
}

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