結果
問題 | No.800 四平方定理 |
ユーザー | tokoharu_procon |
提出日時 | 2019-03-17 21:35:11 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,756 bytes |
コンパイル時間 | 1,483 ms |
コンパイル使用メモリ | 182,212 KB |
実行使用メモリ | 136,240 KB |
最終ジャッジ日時 | 2024-07-07 20:58:26 |
合計ジャッジ時間 | 5,954 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 16 ms
11,904 KB |
testcase_01 | AC | 31 ms
8,824 KB |
testcase_02 | AC | 21 ms
7,272 KB |
testcase_03 | AC | 25 ms
8,080 KB |
testcase_04 | AC | 20 ms
7,104 KB |
testcase_05 | AC | 24 ms
7,532 KB |
testcase_06 | AC | 38 ms
9,688 KB |
testcase_07 | AC | 29 ms
8,548 KB |
testcase_08 | AC | 40 ms
9,980 KB |
testcase_09 | AC | 34 ms
9,140 KB |
testcase_10 | TLE | - |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | TLE | - |
testcase_16 | TLE | - |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 1 ms
5,376 KB |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long LL;typedef pair<LL, LL> PII;// chmax, chmintemplate <class T>inline bool chmax(T& a, T b) {if (a < b) {a = b;return 1;}return 0;}template <class T>inline bool chmin(T& a, T b) {if (a > b) {a = b;return 1;}return 0;}template <typename T>function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };template <typename T>function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };template <typename T>function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };namespace detail {template <typename T, std::size_t NDIMS>struct vector_builder {using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;static type make(std::vector<std::size_t> dims, const T& v = {}) {const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);if (!dims.empty()) dims.pop_back();return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);}};template <typename T>struct vector_builder<T, 1> {using type = std::vector<T>;static type make(std::vector<std::size_t> dims, const T& v = {}) {return type(dims.empty() ? 0 : dims.back(), v);}};} // namespace detailtemplate <typename T, typename... SIZE_T>auto exvector(const T& v, SIZE_T... dims) {static_assert(sizeof...(dims) != 0, "invalid dimension");std::vector<std::size_t> vec_dims{dims...};return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);}using namespace std;//******************** dumps ************************//template <typename T>void dump(const T& data, vector<int>& iter) {cout << data << " ";}template <typename T>void dump(const vector<T>& data, vector<int>& iter) {for (auto elem : data) dump(elem, iter);cout << endl;}template <typename T>void dump(const vector<vector<T>>& data, vector<int>& iter) {for (auto elem : iter) {cout << "[" << elem << "]";}cout << endl;for (int i = 0; i < data.size(); i++) {iter.push_back(i);dump(data[i], iter);iter.pop_back();}cout << endl;}template <typename T>void dump(const vector<T>& data, int dummy) {for (int i = 0; i < data.size(); i++) {cout << "[" << i << "] " << data[i] << endl;}}template <typename T>void dump(const T& data) { // T : data, U = base type val.vector<int> iter;dump(data, iter);}///////////////////////////////////////////////long long mul(long long a, long long b, const long long MOD) {return b ? (mul(a * 2, b / 2, MOD) + (b & 1 ? a : 0)) % MOD : 0;}long long bpow(long long a, long long b, const long long MOD) {return (b ? bpow(a * a % MOD, b / 2, MOD) * (b & 1 ? a : 1) : 1) % MOD;}long long inv(long long a, const long long MOD) {return bpow(a, MOD - 2, MOD);}vector<long long> MODS = {1000000007};template <int kind = 0>class mint {public:long long v;mint() : v(0) {}mint(long long v) : v((v % MODS[kind] + MODS[kind]) % MODS[kind]) {}long long get_mod() { return MODS[kind]; }long long get_val() { return v; }};template <int kind>ostream& operator<<(ostream& os, const mint<kind>& x) {return os << x.v;}template <int kind>mint<kind>& operator+=(mint<kind>& a, mint<kind> b) {return a = a.v + b.v;}template <int kind>mint<kind>& operator-=(mint<kind>& a, mint<kind> b) {return a = a.v - b.v;}template <int kind>mint<kind>& operator*=(mint<kind>& a, mint<kind> b) {return a = a.v * b.v;}template <int kind>mint<kind>& operator/=(mint<kind>& a, mint<kind> b) {return a = a.v * inv(b.v, a.get_mod());}template <int kind>mint<kind> operator+(mint<kind> a, mint<kind> b) {return a += b;}template <int kind>mint<kind> operator-(mint<kind> a, mint<kind> b) {return a -= b;}template <int kind>mint<kind> operator*(mint<kind> a, mint<kind> b) {return a *= b;}template <int kind>mint<kind> operator/(mint<kind> a, mint<kind> b) {return a /= b;}template <int kind>mint<kind>& operator+=(mint<kind>& a, long long b) {return a = a.v + b;}template <int kind>mint<kind>& operator-=(mint<kind>& a, long long b) {return a = a.v - b;}template <int kind>mint<kind>& operator*=(mint<kind>& a, long long b) {return a = a.v * b;}template <int kind>mint<kind>& operator/=(mint<kind>& a, long long b) {return a = a.v * inv(b, a.get_mod());}template <int kind>mint<kind> operator+(mint<kind> a, long long b) {return a += b;}template <int kind>mint<kind> operator-(mint<kind> a, long long b) {return a -= b;}template <int kind>mint<kind> operator*(mint<kind> a, long long b) {return a *= b;}template <int kind>mint<kind> operator/(mint<kind> a, long long b) {return a /= b;}vector<mint<>> kaijo;void init() {kaijo.push_back(mint<>(1));for (int i = 1; i <= 400000; i++) {kaijo.push_back(kaijo.back() * i);}}mint<> comb(LL N, LL K) {if (K < 0) return mint<>(0);if (K > N) return mint<>(0);return kaijo[N] / kaijo[N - K] / kaijo[K];}int main() {LL ans = 0;LL N, D;cin >> N >> D;map<LL, LL> A, B;// vector<LL> A, B;for (LL i = 1; i <= N; i++) {for (LL j = 1; j <= N; j++) {A[i * i + j * j]++;B[i * i - j * j]++;// A.push_back(i * i + j * j);// B.push_back(i * i - j * j);}}/*sort(A.begin(), A.end());sort(B.begin(), B.end());*/vector<PII> X, Y;for (auto a : A) X.push_back(a);for (auto b : B) Y.push_back(b);Y.push_back(PII(100000000, 0));int iter = 0;for (auto x : X) {LL val = x.first;LL cnt = x.second;while (Y[iter].first < val - D) iter++;if (Y[iter].first == val - D) {ans += Y[iter].second * cnt;}}cout << ans << endl;return 0;}