Submission #256012

#	Time	Username	Problem	Language	Result	Execution time	Memory
256012		KoD	Circle selection (APIO18_circle_selection)	C++17	0 / 100	1086 ms	35960 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;

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<std::pair<i64, i32>> event;
  event.reserve(3 * N);
  for (auto i: range(0, N)) {
    event.emplace_back(X[i] - R[i], i);
    event.emplace_back(X[i] + R[i], i +  N);
  }
  std::sort(event.begin(), event.end());
  std::vector<i32> ans(N);
  std::iota(ans.begin(), ans.end(), 0);
  std::set<std::pair<i64, i32>> cur;
  auto judge = [&](i32 i, i32 j) {
    i64 x = X[i] - X[j], y = Y[i] - Y[j], r = R[i] + R[j];
    return x * x + y * y <= r * r;
  };
  auto comp = [&](i32 i, i32 j) {
    if (R[i] != R[j]) return R[i] > R[j];
    return i < j;
  };
  for (auto [ignore, idx]: event) {
    if (idx < N) {
      auto itr = cur.lower_bound(std::make_pair(Y[idx], -1));
      if (itr != cur.end()) {
        i32 k = itr -> second;
        if (judge(k, idx)) {
          if (comp(k, idx)) {
            ans[idx] = k;
          }
          else {
            ans[k] = idx;
          }
        }
      }
      if (itr != cur.begin()) {
        --itr;
        i32 k = itr -> second;
        if (judge(k, idx)) {
          if (comp(k, idx)) {
            ans[idx] = k;
          }
          else {
            ans[k] = idx;
          }
        }
      }
      cur.insert(std::make_pair(Y[idx], idx));
    }
    else {
      idx -= N;
      auto itr = cur.erase(cur.find(std::make_pair(Y[idx], idx)));
      if (itr != cur.end() && itr != cur.begin()) {
        i32 k = itr -> second;
        i32 l = std::prev(itr) -> second;
        if (judge(k, l)) {
          if (comp(k, l)) {
            ans[l] = k;
          }
          else {
            ans[k] = l;
          }
        }
      }
    }
  }
  for (auto i: range(0, N)) {
    std::cout << ans[i] + 1 << (i + 1 == N ? '\n' : ' ');
  }
  return 0;
}

Compilation message (stderr)

main.cpp: In function 'int main()':
main.cpp:53:25: warning: unused variable 'ignore' [-Wunused-variable]

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