#911474 (C++17) No.2420 Simple Problem

• 問題: No.2420 Simple Problem
• ユーザー: OnjoujiToki
• 提出日時: 2023-09-08 04:21:07
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 101 ms / 2,000 ms
• コード長: 5,536 bytes
• コンパイル時間: 1,255 ms
• コンパイル使用メモリ: 122,148 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-25 21:36:10
• 合計ジャッジ時間: 8,588 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	42 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	17 ms; 5,376 KB
testcase_04	AC	79 ms; 5,376 KB
testcase_05	AC	52 ms; 5,376 KB
testcase_06	AC	101 ms; 5,376 KB
testcase_07	AC	100 ms; 5,376 KB
testcase_08	AC	100 ms; 5,376 KB
testcase_09	AC	98 ms; 5,376 KB
testcase_10	AC	99 ms; 5,376 KB
testcase_11	AC	100 ms; 5,376 KB
testcase_12	AC	99 ms; 5,376 KB
testcase_13	AC	98 ms; 5,376 KB
testcase_14	AC	99 ms; 5,376 KB
testcase_15	AC	100 ms; 5,376 KB
testcase_16	AC	100 ms; 5,376 KB
testcase_17	AC	99 ms; 5,376 KB
testcase_18	AC	101 ms; 5,376 KB
testcase_19	AC	99 ms; 5,376 KB
testcase_20	AC	99 ms; 5,376 KB
testcase_21	AC	99 ms; 5,376 KB
testcase_22	AC	100 ms; 5,376 KB
testcase_23	AC	98 ms; 5,376 KB
testcase_24	AC	100 ms; 5,376 KB
testcase_25	AC	99 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	79 ms; 5,376 KB
testcase_28	AC	79 ms; 5,376 KB
testcase_29	AC	80 ms; 5,376 KB
testcase_30	AC	80 ms; 5,376 KB
testcase_31	AC	78 ms; 5,376 KB
testcase_32	AC	2 ms; 5,376 KB
testcase_33	AC	41 ms; 5,376 KB

ソースコード

/* 💕💕💕💕💕
💗💗💗💗💗
  /)/)
( . .)
( づ💗

    💗💗💗  💗💗💗
  💗💗💗💗💗💗💗💗💗
  💗💗💗💗💗💗💗💗💗
    💗💗💗💗💗💗💗
      💗💗💗💗💗
        💗💗💗
          💗

*/

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt &operator^=(long long p) {  // quick_pow here:3
    ModInt res = 1;
    for (; p; p >>= 1) {
      if (p & 1) res *= *this;
      *this *= *this;
    }
    return *this = res;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  ModInt operator^(long long p) const { return ModInt(*this) ^= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }
  explicit operator int() const { return x; }  // added by QCFium
  ModInt operator=(const int p) {
    x = p;
    return ModInt(*this);
  }  // added by QCFium
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      a -= t * b;
      std::swap(a, b);
      u -= t * v;
      std::swap(u, v);
    }
    return ModInt(u);
  }
  friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &p) {
    return os << p.x;
  }
  friend std::istream &operator>>(std::istream &is, ModInt<mod> &a) {
    long long x;
    is >> x;
    a = ModInt<mod>(x);
    return (is);
  }
};
template <typename T>
struct DSU {
  std::vector<T> f, siz;
  DSU(int n) : f(n), siz(n, 1) { std::iota(f.begin(), f.end(), 0); }
  T leader(T x) {
    while (x != f[x]) x = f[x] = f[f[x]];
    return x;
  }
  bool same(T x, T y) { return leader(x) == leader(y); }
  bool merge(T x, T y) {
    x = leader(x);
    y = leader(y);
    if (x == y) return false;
    siz[x] += siz[y];
    f[y] = x;
    return true;
  }
  T size(int x) { return siz[leader(x)]; }
};
using mint = ModInt<998244353>;
template <typename T>
struct SegmentTree {
  using Monoid = typename T::Monoid;

  explicit SegmentTree(int n) : SegmentTree(std::vector<Monoid>(n, T::id())) {}

  explicit SegmentTree(const std::vector<Monoid> &a) : n(a.size()), sz(1) {
    while (sz < n) sz <<= 1;
    data.assign(sz << 1, T::id());
    std::copy(a.begin(), a.end(), data.begin() + sz);
    for (int i = sz - 1; i > 0; --i) {
      data[i] = T::merge(data[i << 1], data[(i << 1) + 1]);
    }
  }

  void set(int idx, const Monoid val) {
    idx += sz;
    data[idx] = val;
    while (idx >>= 1)
      data[idx] = T::merge(data[idx << 1], data[(idx << 1) + 1]);
  }

  Monoid get(int left, int right) const {
    Monoid res_l = T::id(), res_r = T::id();
    for (left += sz, right += sz; left < right; left >>= 1, right >>= 1) {
      if (left & 1) res_l = T::merge(res_l, data[left++]);
      if (right & 1) res_r = T::merge(data[--right], res_r);
    }
    return T::merge(res_l, res_r);
  }

  Monoid operator[](const int idx) const { return data[idx + sz]; }

 private:
  const int n;
  int sz;  // sz + 原数组坐标 = 线段树里的编号，1 based
  std::vector<Monoid> data;
};

namespace monoid {

template <typename T>
struct RangeMinimumQuery {
  using Monoid = T;
  static constexpr Monoid id() {
    return std::numeric_limits<Monoid>::max() / 2;
  }
  static Monoid merge(const Monoid &a, const Monoid &b) {
    return std::min(a, b);
  }
};

template <typename T>
struct RangeMaximumQuery {
  using Monoid = T;
  static constexpr Monoid id() { return std::numeric_limits<Monoid>::lowest(); }
  static Monoid merge(const Monoid &a, const Monoid &b) {
    return std::max(a, b);
  }
};

template <typename T>
struct RangeSumQuery {
  using Monoid = T;
  static constexpr Monoid id() { return 0; }
  static Monoid merge(const Monoid &a, const Monoid &b) { return a + b; }
};

}  // namespace monoid
void solve() {
  int t;
  std::cin >> t;

  while (t--) {
    // find first x.(x ^ 2 - (a + b)) * x ^ 2 - (a + b) > 4 * a *b
    unsigned long long a, b;
    std::cin >> a >> b;
    unsigned long long l = 2, r = 70000;
    while (l < r) {
      unsigned long long x = (l + r) / 2;
      unsigned long long d = x * x - (a + b);
      if (4 * a * b < d * d and x * x > a + b) {
        r = x;
      } else
        l = x + 1;
    }
    std::cout << l << '\n';
  }
}

int main() {
  int t = 1;
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  // std::cin >> t;

  while (t--) solve();
  return 0;
}