結果
問題 | No.1203 お菓子ゲーム |
ユーザー | opt |
提出日時 | 2020-08-29 00:46:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 466 ms / 2,000 ms |
コード長 | 3,997 bytes |
コンパイル時間 | 2,306 ms |
コンパイル使用メモリ | 204,736 KB |
実行使用メモリ | 47,812 KB |
最終ジャッジ日時 | 2024-04-26 15:42:00 |
合計ジャッジ時間 | 27,298 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 424 ms
47,608 KB |
testcase_01 | AC | 410 ms
47,676 KB |
testcase_02 | AC | 411 ms
47,680 KB |
testcase_03 | AC | 413 ms
47,676 KB |
testcase_04 | AC | 414 ms
47,680 KB |
testcase_05 | AC | 413 ms
47,684 KB |
testcase_06 | AC | 427 ms
47,684 KB |
testcase_07 | AC | 412 ms
47,676 KB |
testcase_08 | AC | 428 ms
47,676 KB |
testcase_09 | AC | 408 ms
47,684 KB |
testcase_10 | AC | 437 ms
47,680 KB |
testcase_11 | AC | 406 ms
47,680 KB |
testcase_12 | AC | 449 ms
47,680 KB |
testcase_13 | AC | 410 ms
47,676 KB |
testcase_14 | AC | 438 ms
47,684 KB |
testcase_15 | AC | 422 ms
47,812 KB |
testcase_16 | AC | 435 ms
47,680 KB |
testcase_17 | AC | 414 ms
47,680 KB |
testcase_18 | AC | 428 ms
47,804 KB |
testcase_19 | AC | 413 ms
47,808 KB |
testcase_20 | AC | 436 ms
47,812 KB |
testcase_21 | AC | 402 ms
47,808 KB |
testcase_22 | AC | 436 ms
47,684 KB |
testcase_23 | AC | 403 ms
47,680 KB |
testcase_24 | AC | 442 ms
47,680 KB |
testcase_25 | AC | 401 ms
47,808 KB |
testcase_26 | AC | 423 ms
47,680 KB |
testcase_27 | AC | 404 ms
47,684 KB |
testcase_28 | AC | 444 ms
47,676 KB |
testcase_29 | AC | 405 ms
47,680 KB |
testcase_30 | AC | 449 ms
47,808 KB |
testcase_31 | AC | 427 ms
47,680 KB |
testcase_32 | AC | 443 ms
47,552 KB |
testcase_33 | AC | 427 ms
47,808 KB |
testcase_34 | AC | 456 ms
47,680 KB |
testcase_35 | AC | 426 ms
47,676 KB |
testcase_36 | AC | 426 ms
47,680 KB |
testcase_37 | AC | 451 ms
47,680 KB |
testcase_38 | AC | 458 ms
47,676 KB |
testcase_39 | AC | 448 ms
47,804 KB |
testcase_40 | AC | 462 ms
47,608 KB |
testcase_41 | AC | 461 ms
47,676 KB |
testcase_42 | AC | 465 ms
47,808 KB |
testcase_43 | AC | 464 ms
47,680 KB |
testcase_44 | AC | 463 ms
47,676 KB |
testcase_45 | AC | 453 ms
47,684 KB |
testcase_46 | AC | 447 ms
47,680 KB |
testcase_47 | AC | 451 ms
47,808 KB |
testcase_48 | AC | 466 ms
47,804 KB |
testcase_49 | AC | 448 ms
47,680 KB |
testcase_50 | AC | 439 ms
47,724 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; #define rep2(i, m, n) for (int i = (m); i < (n); ++i) #define rep(i, n) rep2(i, 0, n) #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) #define all(a) (a).begin(), (a).end() template<typename T = int> using V = vector<T>; template<typename T = int> using P = pair<T, T>; using Vi = V<int>; using Vl = V<ll>; using Vd = V<ld>; using Vb = V<bool>; using VVi = V<Vi>; using VVl = V<Vl>; using VVb = V<Vb>; using Pi = P<int>; using Pl = P<ll>; using Pd = P<ld>; template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); } template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); } template<typename T> inline int sz(T &x) { return x.size(); } template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r) inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x)) inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x)) inline int popcount(const ll x) { return __builtin_popcountll(x); } inline void fail() { cout << -1 << '\n'; exit(0); } struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; // const int INF = 1<<30; // const ll INFll = 1ll<<60; // const ld EPS = 1e-10; // const ld PI = acos(-1.0); // const int MOD = int(1e9)+7; // const int MOD = 998244353; struct Eratos { vector<int> primes, min_factor; vector<bool> isprime; Eratos(int MAX) : primes(), isprime(MAX+1, true), min_factor(MAX+1, -1) { isprime[0] = isprime[1] = false; min_factor[0] = 0, min_factor[1] = 1; for (int i = 2; i <= MAX; i++) { if (!isprime[i]) continue; primes.push_back(i); min_factor[i] = i; for (int j = i*2; j <= MAX; j += i) { isprime[j] = false; if (min_factor[j] == -1) min_factor[j] = i; } } } // prime factorization vector<pair<int,int>> factorize(int n) { vector<pair<int,int>> res; while (n != 1) { int prime = min_factor[n]; int exp = 0; while (min_factor[n] == prime) { ++exp; n /= prime; } res.emplace_back(prime, exp); } return res; } // enumerate divisors vector<int> divisors(int n) { vector<int> res({1}); auto pf = factorize(n); for (auto p : pf) { int k = res.size(); for (int i = 0; i < k; ++i) { int v = 1; for (int j = 0; j < p.second; ++j) { v *= p.first; res.push_back(res[i] * v); } } } return res; } }; Eratos er(int(1e7)+2); ll solve(ll x, ll y) { auto dv = er.divisors(y); ll res = 0; for (ll b : dv) { if (b % 2 == 0) continue; ll z = y / b * (b*b-1); if (z % (2*x) != 0) continue; ll a = z / (2*x); if (1 <= b && b < a && a <= int(1e8)) ++res; } if (y > 2*x) res += int(1e8) / y; return res; } int main() { int Q; cin >> Q; rep(_, Q) { int x, y; cin >> x >> y; int ans = solve(x, y) + solve(y-x, y); cout << ans << '\n'; } }