제출 #255888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
255888		KoD	새 집 (APIO18_new_home)	C++17	12 / 100	2069 ms	10488 KiB

new_home

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <tuple>
#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;

struct query_t {
  i32 idx;
  i32 type; // 0: add store, 1: answer query, 2: remove store
  bool operator < (const query_t &q) const {
    return type < q.type;
  }
};

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  i32 N, K, Q;
  std::cin >> N >> K >> Q;
  assert(K <= 400);
  std::vector<i32> X(N), T(N), A(N), B(N);
  std::vector<std::pair<i32, query_t>> query;
  query.reserve(N * 2 + Q);

  for (auto i: range(0, N)) {
    std::cin >> X[i] >> T[i] >> A[i] >> B[i];
    --T[i];
    query.emplace_back(A[i], query_t{ i, 0 });
    query.emplace_back(B[i], query_t{ i, 2 });
  }
  std::vector<i32> L(Q), Y(Q);
  for (auto i: range(0, Q)) {
    std::cin >> L[i] >> Y[i];
    query.emplace_back(Y[i], query_t{ i, 1 });
  }
  std::sort(query.begin(), query.end());
  std::vector<std::multiset<i32>> store(K);
  std::vector<i32> ans(Q);
  for (auto [ignore, q]: query) {
    auto [i, t] = q;
    if (t == 0) {
      store[T[i]].insert(X[i]);
    }
    else if (t == 2) {
      store[T[i]].erase(store[T[i]].find(X[i]));
    }
    else {
      for (auto k: range(0, K)) {
        auto itr = store[k].lower_bound(L[i]);
        i32 tmp = inf32;
        if (itr != store[k].end()) {
          chmin(tmp, *itr - L[i]);
        }
        if (itr != store[k].begin()) {
          chmin(tmp, L[i] - *std::prev(itr));
        }
        chmax(ans[i], tmp);
      }
    }
  }
  for (auto i: range(0, Q)) {
    std::cout << (ans[i] == inf32 ? -1 : ans[i]) << '\n';
  }
  return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

main.cpp: In function 'int main()':
main.cpp:49:44: warning: narrowing conversion of 'i' from 'long int' to 'i32 {aka int}' inside { } [-Wnarrowing]
main.cpp:50:44: warning: narrowing conversion of 'i' from 'long int' to 'i32 {aka int}' inside { } [-Wnarrowing]
main.cpp:55:44: warning: narrowing conversion of 'i' from 'long int' to 'i32 {aka int}' inside { } [-Wnarrowing]
main.cpp:60:23: warning: unused variable 'ignore' [-Wunused-variable]

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 23
• Subtask 5: 0 / 35
• Subtask 6: 0 / 20