結果

問題 No.1265 Balloon Survival
ユーザー KoDKoD
提出日時 2020-10-23 22:29:18
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,106 bytes
コンパイル時間 656 ms
コンパイル使用メモリ 73,088 KB
最終ジャッジ日時 2023-09-28 16:34:27
合計ジャッジ時間 1,041 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: 関数 ‘int main()’ 内:
main.cpp:45:16: エラー: ‘const std::tuple<long int, long unsigned int, long unsigned int> <structured bindings>’ has incomplete type
   45 |     constexpr void operator ++ () noexcept { ++M_position; }
      |                ^~~~~~~~~
次のファイルから読み込み:  /usr/local/gcc7/include/c++/12.2.0/vector:64,
         次から読み込み:  main.cpp:10:
/usr/local/gcc7/include/c++/12.2.0/bits/stl_vector.h: In instantiation of ‘std::_Vector_base<_Tp, _Alloc>::~_Vector_base() [with _Tp = std::tuple<long int, long unsigned int, long unsigned int>; _Alloc = std::allocator<std::tuple<long int, long unsigned int, long unsigned int> >]’:
/usr/local/gcc7/include/c++/12.2.0/bits/stl_vector.h:526:7:   required from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue() [with _Seq = std::vector<std::tuple<long int, long unsigned int, long unsigned int> >; _Requires = void; _Tp = std::tuple<long int, long unsigned int, long unsigned int>; _Sequence = std::vector<std::tuple<long int, long unsigned int, long unsigned int> >; _Compare = std::greater<std::tuple<long int, long unsigned int, long unsigned int> >]’
main.cpp:36:71:   required from here
/usr/local/gcc7/include/c++/12.2.0/bits/stl_vector.h:367:49: エラー: invalid use of incomplete type ‘class std::tuple<long int, long unsigned int, long unsigned int>’
  367 |                       _M_impl._M_end_of_storage - _M_impl._M_start);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
次のファイルから読み込み:  /usr/local/gcc7/include/c++/12.2.0/bits/stl_algobase.h:64,
         次から読み込み:  /usr/local/gcc7/include/c++/12.2.0/string:50,
         次から読み込み:  /usr/local/gcc7/include/c++/12.2.0/bits/locale_classes.h:40,
         次から読み込み:  /usr/local/gcc7/include/c++/12.2.0/bits/ios_base.h:41,
         次から読み込み:  /usr/local/gcc7/include/c++/12.2.0/ios:42,
         次��

ソースコード

diff # 

#line 1 "main.cpp"

/**
 * @title Template
 */

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

#line 2 "/Users/kodamankod/Desktop/cpp_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/cpp_programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_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 17 "main.cpp"

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

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

int main() {
  usize N;
  std::cin >> N;
  std::vector<i64> A(N), B(N);
  for (auto i: range(0, N)) {
    std::cin >> A[i] >> B[i];
  }
  using state = std::tuple<i64, usize, usize>;
  std::priority_queue<state, std::vector<state>, std::greater<state>> que;
  for (auto i: range(0, N)) {
    for (auto j: range(i + 1, N)) {
      que.emplace((A[i] - A[j]) * (A[i] - A[j]) + (B[i] - B[j]) * (B[i] - B[j]), i, j);
    }
  }
  std::vector<bool> done(N);
  usize ans = 0;
  while (!que.empty()) {
    const auto [d, u, v] = que.top();
    que.pop();
    if (done[u] || done[v]) {
      continue;
    }
    if (u == 0) {
      done[v] = true;
      ans += 1;
    }
    else {
      done[u] = true;
      done[v] = true;
    }
  }
  std::cout << ans << '\n';
  return 0;
}
0