#545381 (C++17) No.1200 お菓子配り-3

• 問題: No.1200 お菓子配り-3
• ユーザー: kcvlex
• 提出日時: 2020-08-31 23:20:44
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 4,255 bytes
• コンパイル時間: 1,398 ms
• コンパイル使用メモリ: 143,924 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-17 02:48:17
• 合計ジャッジ時間: 17,595 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	3 ms; 5,248 KB
testcase_03	AC	3 ms; 5,248 KB
testcase_04	AC	3 ms; 5,248 KB
testcase_05	AC	3 ms; 5,248 KB
testcase_06	AC	3 ms; 5,248 KB
testcase_07	AC	13 ms; 5,248 KB
testcase_08	AC	13 ms; 5,248 KB
testcase_09	AC	13 ms; 5,248 KB
testcase_10	AC	12 ms; 5,248 KB
testcase_11	AC	11 ms; 5,248 KB
testcase_12	AC	106 ms; 5,248 KB
testcase_13	AC	105 ms; 5,248 KB
testcase_14	AC	104 ms; 5,248 KB
testcase_15	AC	108 ms; 5,248 KB
testcase_16	AC	107 ms; 5,248 KB
testcase_17	AC	385 ms; 5,248 KB
testcase_18	AC	553 ms; 5,248 KB
testcase_19	AC	130 ms; 5,248 KB
testcase_20	AC	1,062 ms; 5,248 KB
testcase_21	AC	1,032 ms; 5,248 KB
testcase_22	AC	1,256 ms; 5,248 KB
testcase_23	AC	1,070 ms; 5,248 KB
testcase_24	AC	1,046 ms; 5,248 KB
testcase_25	AC	1,049 ms; 5,248 KB
testcase_26	AC	1,049 ms; 5,248 KB
testcase_27	AC	2 ms; 5,248 KB
testcase_28	AC	829 ms; 5,248 KB
testcase_29	AC	2,312 ms; 5,248 KB
testcase_30	AC	2,284 ms; 5,248 KB
testcase_31	WA	-
testcase_32	AC	2 ms; 5,248 KB

ソースコード

#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}
#endif

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}
template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}
template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }
#define CPP17


ll solve() {
    ll x, y;
    std::cin >> x >> y;
    if (x < y) std::swap(x, y);
    ll diff = x - y, ans = 0;
    
    // ab + c = ac + b
    // b - c = a(b - c)
    // (a - 1)(b - c) = 0
    // a = 1 || b = c
    if (x == y) {
        // a = 1
        ans += x - 1;

        // b = c
        // ab + c = (a + 1)b
        for (ll a1 = 2; a1 * a1 <= x; a1++) {
            if (x % a1) continue;
            ll a2 = x / a1;
            ans++;
            if (a1 < a2) ans++;
        }
    }
    
    // x = ab + c
    // y = ac + b
    // x = a(y - ac) + c
    //   = ay - a*a*c + c
    // (a^2 - 1)c = ay - x
    // c = (ay - x) / (a^2 - 1)

    auto update = [&](ll a) {
        if (a == 1) return;
        ll num = a * y - x;
        if (num <= 0) return;
        ll den = a * a - 1;
        if (den <= 0) return;
        if (num % den) return;
        ll c = num / den;
        ll b = y - a * c;
        if (b <= 0) return;
        ans++;
    };
    for (ll a1 = 1; a1 * a1 <= diff; a1++) {
        if (diff % a1) continue;
        update(a1 + 1);
        ll a2 = diff / a1;
        if (a1 < a2) update(a2 + 1);
    }
    return ans;
}

int main() {
    ll n;
    std::cin >> n;
    while (n--) std::cout << solve() << "\n";
    return 0;
}