結果
| 問題 | No.1200 お菓子配り-3 |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-08-29 15:10:26 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,055 bytes |
| コンパイル時間 | 1,710 ms |
| コンパイル使用メモリ | 172,820 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-11-14 17:33:12 |
| 合計ジャッジ時間 | 9,923 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,820 KB |
| testcase_01 | AC | 2 ms
6,816 KB |
| testcase_02 | AC | 3 ms
6,816 KB |
| testcase_03 | AC | 3 ms
6,816 KB |
| testcase_04 | AC | 2 ms
6,816 KB |
| testcase_05 | AC | 3 ms
6,816 KB |
| testcase_06 | AC | 2 ms
6,816 KB |
| testcase_07 | AC | 7 ms
6,816 KB |
| testcase_08 | AC | 8 ms
6,816 KB |
| testcase_09 | AC | 7 ms
6,820 KB |
| testcase_10 | AC | 8 ms
6,816 KB |
| testcase_11 | AC | 8 ms
6,816 KB |
| testcase_12 | AC | 57 ms
6,816 KB |
| testcase_13 | AC | 58 ms
6,816 KB |
| testcase_14 | AC | 58 ms
6,816 KB |
| testcase_15 | AC | 58 ms
6,820 KB |
| testcase_16 | AC | 58 ms
6,816 KB |
| testcase_17 | AC | 204 ms
6,816 KB |
| testcase_18 | AC | 293 ms
6,820 KB |
| testcase_19 | AC | 70 ms
6,816 KB |
| testcase_20 | AC | 562 ms
6,820 KB |
| testcase_21 | AC | 563 ms
6,820 KB |
| testcase_22 | AC | 666 ms
6,816 KB |
| testcase_23 | AC | 562 ms
6,820 KB |
| testcase_24 | AC | 561 ms
6,816 KB |
| testcase_25 | AC | 559 ms
6,816 KB |
| testcase_26 | AC | 563 ms
6,816 KB |
| testcase_27 | AC | 2 ms
6,816 KB |
| testcase_28 | AC | 927 ms
6,816 KB |
| testcase_29 | AC | 680 ms
6,820 KB |
| testcase_30 | AC | 681 ms
6,816 KB |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("arch=skylake-avx512")
#pragma region template
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
#define bis(x, y) ((ll)(lower_bound(all(x), y) - (x).begin()))
using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<pair<ll, T>>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
ll a, b;
is >> a >> b;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb(b);
if (__DIRECTED__ == false) g[b].pb(a);
return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
ll a, b;
T c;
is >> a >> b >> c;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb({b, c});
if (__DIRECTED__ == false) g[b].pb({a, c});
return is;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(__i, h) { \
rep(__j, w) { \
if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-'; \
if (abs(a[__i][__j]) >= INF / 2) cerr << "∞" << sp; \
else \
cerr << a[__i][__j] << sp; \
} \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) { \
if (__i) cerr << sp; \
if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-'; \
if (abs(a[__i]) >= INF / 2) cerr << "∞" << sp; \
else \
cerr << a[__i]; \
} \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast,unroll-loops")
// Math
inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
#pragma endregion
struct Rational {
using Int = long long;
using Double = long double;
Int n, d;
Rational(Int x = 0, Int y = 1) : n(x), d(y) {
Int g = gcd(abs(n), abs(d));
if (d < 0) g *= -1;
n /= g, d /= g;
// if (d == 0) n = 1;
// inf と -inf を同一視したくない場合は消す
}
Rational operator-() const { return Rational(-n, d); }
Rational &operator+=(const Rational &a) { return *this = Rational(n * a.d + d * a.n, d * a.d); }
Rational &operator-=(const Rational &a) { return *this = Rational(n * a.d - d * a.n, d * a.d); }
Rational &operator*=(const Rational &a) { return *this = Rational(n * a.n, d * a.d); }
Rational &operator/=(const Rational &a) { return *this = Rational(n * a.d, d * a.n); }
Rational operator+(const Rational &a) const { return Rational(*this) += a; }
Rational operator-(const Rational &a) const { return Rational(*this) -= a; }
Rational operator*(const Rational &a) const { return Rational(*this) *= a; }
Rational operator/(const Rational &a) const { return Rational(*this) /= a; }
bool operator==(const Rational &a) const { return n == a.n and d == a.d; }
bool operator!=(const Rational &a) const { return n != a.n or d != a.d; }
bool operator<=(const Rational &a) const { return n * a.d <= d * a.n; }
bool operator<(const Rational &a) const { return n * a.d < d * a.n; }
friend Int rtoi(const Rational &a) { return a.n / a.d; }
friend Double rtod(const Rational &a) { return Double(a.n) / Double(a.d); }
friend istream &operator>>(istream &is, Rational &a) {
string x;
is >> x;
Int y = 1;
auto iter = find(x.begin(), x.end(), '.');
if (iter != x.end()) {
Int dig = x.end() - iter - 1;
for (Int i = 0; i < dig; i++) y *= 10;
x.erase(iter);
}
a = Rational(stol(x), y);
return is;
}
friend ostream &operator<<(ostream &os, const Rational &a) {
os << a.n << '/' << a.d;
return os;
}
};
inline bool check(int a, int &X, int &Y) {
ll b = (ll) a * a - 1, d = (ll) a * Y - X;
if (d < b or d % b != 0) return 0;
ll c = X - d / b;
if (c < a or c % a != 0) return 0;
return 1;
}
signed main() {
int T;
cin >> T;
rep(i, T) {
int X, Y, N;
cin >> X >> Y;
N = X + Y;
int res = 0;
for (int i = 1; i * i <= N; i++) {
if (N % i == 0) {
if (i * i == N) {
if (i > 2) res += check(i - 1, X, Y);
} else {
if (i > 2) res += check(i - 1, X, Y);
if (N / i > 2) res += check(N / i - 1, X, Y);
}
}
}
cout << res << rt;
}
}