結果
問題 | No.1200 お菓子配り-3 |
ユーザー | simasima_71 |
提出日時 | 2020-08-28 21:50:52 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,881 bytes |
コンパイル時間 | 1,294 ms |
コンパイル使用メモリ | 123,316 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-14 14:37:37 |
合計ジャッジ時間 | 31,031 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 5 ms
6,820 KB |
testcase_03 | AC | 4 ms
6,816 KB |
testcase_04 | AC | 5 ms
6,816 KB |
testcase_05 | AC | 4 ms
6,820 KB |
testcase_06 | AC | 4 ms
6,816 KB |
testcase_07 | AC | 25 ms
6,816 KB |
testcase_08 | AC | 25 ms
6,816 KB |
testcase_09 | AC | 24 ms
6,816 KB |
testcase_10 | AC | 25 ms
6,816 KB |
testcase_11 | AC | 26 ms
6,820 KB |
testcase_12 | AC | 220 ms
6,816 KB |
testcase_13 | AC | 221 ms
6,816 KB |
testcase_14 | AC | 223 ms
6,816 KB |
testcase_15 | AC | 227 ms
6,820 KB |
testcase_16 | AC | 224 ms
6,824 KB |
testcase_17 | AC | 811 ms
6,816 KB |
testcase_18 | AC | 1,166 ms
6,824 KB |
testcase_19 | AC | 270 ms
6,820 KB |
testcase_20 | AC | 2,240 ms
6,820 KB |
testcase_21 | AC | 2,243 ms
6,816 KB |
testcase_22 | AC | 2,651 ms
6,816 KB |
testcase_23 | AC | 2,247 ms
6,816 KB |
testcase_24 | AC | 2,250 ms
6,820 KB |
testcase_25 | AC | 2,230 ms
6,820 KB |
testcase_26 | AC | 2,241 ms
6,816 KB |
testcase_27 | WA | - |
testcase_28 | AC | 3,714 ms
6,820 KB |
testcase_29 | AC | 2,735 ms
6,816 KB |
testcase_30 | AC | 2,739 ms
6,816 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
ソースコード
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <utility> #include <tuple> #include <cstdint> #include <cstdio> #include <map> #include <queue> #include <set> #include <stack> #include <deque> #include <unordered_map> #include <unordered_set> #include <bitset> #include <cctype> #include <functional> #include <ctime> #include <fstream> #include <cmath> #include <limits> #include <numeric> #include <type_traits> #include <iomanip> #include <float.h> #include <math.h> #include <cassert> #pragma warning (disable: 4996) using namespace std; using ll = long long; unsigned euclidean_gcd(unsigned a, unsigned b) { if (a < b) return euclidean_gcd(b, a); unsigned r; while ((r = a % b)) { a = b; b = r; } return b; } ll ll_gcd(ll a, ll b) { if (a < b) return ll_gcd(b, a); ll r; while ((r = a % b)) { a = b; b = r; } return b; } struct UnionFind { vector <ll> par; vector <ll> siz; UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) { for (ll i = 0; i < sz_; ++i) par[i] = i; } void init(ll sz_) { par.resize(sz_); siz.assign(sz_, 1LL); for (ll i = 0; i < sz_; ++i) par[i] = i; } ll root(ll x) { while (par[x] != x) { x = par[x] = par[par[x]]; } return x; } bool merge(ll x, ll y) { x = root(x); y = root(y); if (x == y) return false; if (siz[x] < siz[y]) swap(x, y); siz[x] += siz[y]; par[y] = x; return true; } bool issame(ll x, ll y) { return root(x) == root(y); } ll size(ll x) { return siz[root(x)]; } }; long long modpow(long long a, long long n, long long mod) { if (n < 0)return 0; long long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); } vector<int> tpsort(vector<vector<int>>& G) { int V = G.size(); vector<int> sorted_vertices; queue<int> que; vector<int> indegree(V); for (int i = 0; i < V; i++) { for (int j = 0; j < G[i].size(); j++) { indegree[G[i][j]]++; } } for (int i = 0; i < V; i++) { if (indegree[i] == 0) { que.push(i); } } while (que.empty() == false) { int v = que.front(); que.pop(); for (int i = 0; i < G[v].size(); i++) { int u = G[v][i]; indegree[u] -= 1; if (indegree[u] == 0) que.push(u); } sorted_vertices.push_back(v); } return sorted_vertices; } struct Point { double x; double y; }; struct LineSegment { Point start; Point end; }; double tenkyori(const LineSegment& line, const Point& point) { double x0 = point.x, y0 = point.y; double x1 = line.start.x, y1 = line.start.y; double x2 = line.end.x, y2 = line.end.y; double a = x2 - x1; double b = y2 - y1; double a2 = a * a; double b2 = b * b; double r2 = a2 + b2; double tt = -(a * (x1 - x0) + b * (y1 - y0)); if (tt < 0) return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0)); else if (tt > r2) return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0)); double f1 = a * (y1 - y0) - b * (x1 - x0); return sqrt((f1 * f1) / r2); } ll merge_cnt(vector<int>& a) { int n = a.size(); if (n <= 1) { return 0; } ll cnt = 0; vector<int> b(a.begin(), a.begin() + n / 2); vector<int> c(a.begin() + n / 2, a.end()); cnt += merge_cnt(b); cnt += merge_cnt(c); int ai = 0, bi = 0, ci = 0; while (ai < n) { if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) { a[ai++] = b[bi++]; } else { cnt += n / 2 - bi; a[ai++] = c[ci++]; } } return cnt; } struct edge { ll to, cost; }; typedef pair<ll, ll> P; struct graph { ll V; vector<vector<edge> > G; vector<ll> d; graph(ll n) { init(n); } void init(ll n) { V = n; G.resize(V); d.resize(V); for (int i = 0; i < V; i++) { d[i] = 2000000000000000000; } } void add_edge(ll s, ll t, ll cost) { edge e; e.to = t, e.cost = cost; G[s].push_back(e); } void dijkstra(ll s) { for (int i = 0; i < V; i++) { d[i] = 2000000000000000000; } d[s] = 0; priority_queue<P, vector<P>, greater<P> > que; que.push(P(0, s)); while (!que.empty()) { P p = que.top(); que.pop(); ll v = p.second; if (d[v] < p.first) continue; for (auto e : G[v]) { if (d[e.to] > d[v] + e.cost) { d[e.to] = d[v] + e.cost; que.push(P(d[e.to], e.to)); } } } } }; int main() { ll s; cin >> s; for (int h = 0; h < s; h++) { ll a, b; cin >> a >> b; if (a == b)cout << a - 1 << endl; else { ll c = a + b; ll u = 0; vector<int> g; for (int i = 2; i <= sqrt(c); i++) { if (i * i == c) { g.push_back(i); break; } if (c % i == 0) { g.push_back(i); g.push_back(c / i); } } for (int i = 0; i < g.size(); i++) { int p = g[i] - 2; if (p == 0)continue; if ((a - (c / g[i])) % p == 0 && (a - (c / g[i])) / p >= 0 && (b - (c / g[i])) / p >= 0)u++; } cout << u << endl; } } }