結果
問題 | No.1200 お菓子配り-3 |
ユーザー |
|
提出日時 | 2020-08-28 22:54:53 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,953 bytes |
コンパイル時間 | 2,507 ms |
コンパイル使用メモリ | 200,596 KB |
最終ジャッジ日時 | 2025-01-13 19:00:51 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 26 WA * 2 TLE * 3 |
ソースコード
#line 1 "/workspaces/compro/lib/template.hpp"#line 1 "/workspaces/compro/lib/io/vector.hpp"#include <iostream>#include <vector>#ifndef IO_VECTOR#define IO_VECTORtemplate <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {int size = v.size();for (int i = 0; i < size; i++) {std::cout << v[i];if (i != size - 1)std::cout << " ";}return out;}template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {for (auto &el : v) {std::cin >> el;}return in;}#endif#line 4 "/workspaces/compro/lib/template.hpp"#include <bits/stdc++.h>#define REP(i, n) for (int i = 0; i < n; i++)#define FOR(i, m, n) for (int i = m; i < n; i++)#define ALL(v) (v).begin(), (v).end()#define coutd(n) cout << fixed << setprecision(n)#define ll long long int#define vl vector<ll>#define vi vector<int>#define MM << " " <<using namespace std;template <class T> void say(bool val, T yes, T no) { cout << (val ? yes : no) << "\n"; }void say(bool val, string yes = "Yes", string no = "No") { say<string>(val, yes, no); }template <class T> void chmin(T &a, T b) {if (a > b)a = b;}template <class T> void chmax(T &a, T b) {if (a < b)a = b;}// C++ 17に完全移行したら消す// 最大公約数を求めるtemplate <class T> T gcd(T n, T m) { return n ? gcd(m % n, n) : m; }// 最小公倍数を求めるtemplate <class T> T lcm(T n, T m) {int g = gcd(n, m);return n * m / g;}// 重複を消す。計算量はO(NlogN)template <class T> void unique(std::vector<T> &v) {std::sort(v.begin(), v.end());v.erase(std::unique(v.begin(), v.end()), v.end());}#line 2 "main.cpp"ll solve(ll x, ll y) {ll n = x + y;ll m = max(x, y) - min(x, y);set<ll> s;for (ll i = 1; i * i <= n; i++) {if (n % i == 0) {s.insert(i - 1);s.insert(n / i - 1);}}int ans = 0;vl candidate;for (ll i = 1; i * i <= m; i++) {if (m % i == 0) {if (s.count(i + 1)) {candidate.push_back(i + 1);}if (i != m / i && s.count(m / i + 1)) {candidate.push_back(m / i + 1);}}}auto isIn = [&](ll l, ll t, ll u) -> bool { return l < t && t < u; };for (const auto &a : candidate) {ll u = n / (a + 1), v = m / (a - 1);if (u % 2 != v % 2)continue;int b, c;if (x > y) {b = (u + v) / 2;c = (u - v) / 2;} else {b = (u - v) / 2;c = (u + v) / 2;}if (isIn(0, a, min(x, y)) && isIn(0, b, y) && isIn(0, c, x) && a * b == x - c && a * c == y - b)ans++;}return ans;}// generated by online-judge-template-generator v4.4.0 (https://github.com/kmyk/online-judge-template-generator)int main() {int S;std::cin >> S;// failed to analyze output format// TODO: edit hereREP(i, S) {int x, y;cin >> x >> y;cout << solve(x, y) << endl;}return 0;}