Submission #255899

#	Time	Username	Problem	Language	Result	Execution time	Memory
255899		KoD	Circle selection (APIO18_circle_selection)	C++17	0 / 100	1553 ms	47956 KiB

circle_selection

#line 1 "main.cpp"

/**
 * @title Template
 */

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

#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 18 "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;

constexpr bool judge(i64 x, i64 y, i64 r) {
  return x * x + y * y <= r * r;
}

int main() {
  i32 N;
  std::cin >> N;
  std::vector<i64> X(N), Y(N), R(N);
  for (auto i: range(0, N)) {
    std::cin >> X[i] >> Y[i] >> R[i];
    assert(Y[i] == 0);
  }
  std::vector<i32> order(N);
  std::iota(order.begin(), order.end(), 0);
  std::sort(order.begin(), order.end(), [&](i32 i, i32 j) {
    if (R[i] != R[j]) return R[i] > R[j];
    return i < j;
  });
  std::set<std::pair<i64, i32>> set;
  for (auto i: range(0, N)) {
    set.emplace(X[i] - R[i], i);
    set.emplace(X[i] + R[i], i);
  }
  std::vector<i32> ans(N, -1);
  for (const auto i: range(0, N)) {
    if (ans[i] != -1) {
      continue;
    }
    ans[i] = i;
    set.erase(std::make_pair(X[i] - R[i], i));
    set.erase(std::make_pair(X[i] + R[i], i));
    auto itr = set.lower_bound(std::make_pair(X[i] - R[i], -1));
    while (itr != set.end() && itr -> first <= X[i] + R[i]) {
      i32 j = itr -> second;
      assert(ans[j] == -1);
      ans[j] = i;
      set.erase(std::make_pair(X[j] - R[j], j));
      set.erase(std::make_pair(X[j] + R[j], j));
      itr = set.lower_bound(std::make_pair(X[i] - R[i], -1));
    }
  }
  for (auto i: range(0, N)) {
    std::cout << ans[i] + 1 << " \n"[i + 1 == N];
  }
  return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13