#357100 (C++14) No.849 yuki国の分割統治

• 問題: No.849 yuki国の分割統治
• ユーザー: noshi91
• 提出日時: 2019-07-05 22:23:16
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 135 ms / 2,000 ms
• コード長: 3,121 bytes
• コンパイル時間: 857 ms
• コンパイル使用メモリ: 79,264 KB
• 実行使用メモリ: 8,576 KB
• 最終ジャッジ日時: 2024-10-06 22:17:42
• 合計ジャッジ時間: 4,273 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	98 ms; 5,248 KB
testcase_08	AC	104 ms; 5,888 KB
testcase_09	AC	104 ms; 5,248 KB
testcase_10	AC	105 ms; 5,248 KB
testcase_11	AC	95 ms; 5,248 KB
testcase_12	AC	98 ms; 5,248 KB
testcase_13	AC	110 ms; 5,248 KB
testcase_14	AC	105 ms; 5,248 KB
testcase_15	AC	97 ms; 5,632 KB
testcase_16	AC	129 ms; 7,424 KB
testcase_17	AC	97 ms; 5,248 KB
testcase_18	AC	131 ms; 7,808 KB
testcase_19	AC	107 ms; 5,248 KB
testcase_20	AC	122 ms; 6,272 KB
testcase_21	AC	87 ms; 5,248 KB
testcase_22	AC	121 ms; 6,912 KB
testcase_23	AC	118 ms; 6,528 KB
testcase_24	AC	101 ms; 5,248 KB
testcase_25	AC	135 ms; 8,576 KB
testcase_26	AC	2 ms; 5,248 KB
testcase_27	AC	1 ms; 5,248 KB
testcase_28	AC	2 ms; 5,248 KB
testcase_29	AC	2 ms; 5,248 KB

ソースコード

//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr usize operator"" _z(unsigned long long x) noexcept {
  return static_cast<usize>(x);
}

class rep {
  const usize f, l;

public:
  class itr {
    friend rep;
    usize i;
    constexpr itr(const usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr rep(const usize first, const usize last) noexcept
      : f(first), l(last) {}
  constexpr itr begin() const noexcept { return itr(f); }
  constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
  const usize f, l;

public:
  class itr {
    friend revrep;
    usize i;
    constexpr itr(usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
  constexpr itr begin() const noexcept { return itr(l); }
  constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
  return a < b ? b - a : a - b;
}

} // namespace n91

#include <utility>

namespace n91 {

template <class T> constexpr T gcd(T m, T n) noexcept {
  while (n != static_cast<T>(0)) {
    m %= n;
    std::swap(m, n);
  }
  return m;
}

template <class T> constexpr T lcm(const T &m, const T &n) noexcept {
  return m / gcd(m, n) * n;
}

} // namespace n91

#include <algorithm>
#include <iostream>
#include <set>
#include <utility>

namespace n91 {

void main_() {
  i64 a, b, c, d;
  usize n;
  std::cin >> a >> b >> c >> d >> n;
  const i64 det = std::abs(a * d - b * c);
  if (det != static_cast<i64>(0)) {
    std::set<std::pair<i64, i64>> clus;
    const auto norm = [det](const i64 x) { return (x % det + det) % det; };
    for (const auto i : rep(0_z, n)) {
      i64 x, y;
      std::cin >> x >> y;
      clus.emplace(norm(d * x - c * y), norm(-b * x + a * y));
    }
    std::cout << clus.size() << std::endl;
  } else {
    const i64 mod = gcd(a + b, c + d);
    std::set<std::pair<i64, i64>> clus;
    for (const auto i : rep(0_z, n)) {
      i64 x, y;
      std::cin >> x >> y;
      clus.emplace(-b * x + a * y, (x + y) % mod);
    }
    std::cout << clus.size() << std::endl;
  }
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}