結果
問題 | No.2510 Six Cube Sum Counting |
ユーザー |
|
提出日時 | 2023-10-20 23:17:38 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3,608 ms / 4,000 ms |
コード長 | 5,101 bytes |
コンパイル時間 | 2,145 ms |
コンパイル使用メモリ | 196,716 KB |
実行使用メモリ | 211,672 KB |
最終ジャッジ日時 | 2024-09-20 22:44:18 |
合計ジャッジ時間 | 8,004 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 26 |
ソースコード
#line 1 "template/template.hpp"#include <algorithm>#include <bit>#include <bitset>#include <cassert>#include <chrono>#include <climits>#include <cmath>#include <complex>#include <cstddef>#include <cstdint>#include <cstdlib>#include <cstring>#include <functional>#include <iomanip>#include <iostream>#include <limits>#include <map>#include <memory>#include <numbers>#include <numeric>#include <optional>#include <queue>#include <random>#include <ranges>#include <set>#include <stack>#include <string>#include <tuple>#include <type_traits>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)#define all(v) (v).begin(), (v).end()#define rall(v) (v).rbegin(), (v).rend()#line 2 "template/debug_template.hpp"#line 4 "template/debug_template.hpp"namespace ebi {#ifdef LOCAL#define debug(...) \std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \debug_out(__VA_ARGS__)#else#define debug(...)#endifvoid debug_out() {std::cerr << std::endl;}template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {std::cerr << " " << h;if (sizeof...(t) > 0) std::cerr << " :";debug_out(t...);}}#line 2 "template/int_alias.hpp"#line 4 "template/int_alias.hpp"namespace ebi {using std::size_t;using i8 = std::int8_t;using u8 = std::uint8_t;using i16 = std::int16_t;using u16 = std::uint16_t;using i32 = std::int32_t;using u32 = std::uint32_t;using i64 = std::int64_t;using u64 = std::uint64_t;using i128 = __int128_t;using u128 = __uint128_t;}#line 2 "template/io.hpp"#line 7 "template/io.hpp"namespace ebi {template <typename T1, typename T2>std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {return os << pa.first << " " << pa.second;}template <typename T1, typename T2>std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {return os >> pa.first >> pa.second;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template <typename T>std::istream &operator>>(std::istream &os, std::vector<T> &vec) {for (T &e : vec) std::cin >> e;return os;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {if (opt) {os << opt.value();} else {os << "invalid value";}return os;}void fast_io() {std::cout << std::fixed << std::setprecision(15);std::cin.tie(nullptr);std::ios::sync_with_stdio(false);}} // namespace ebi#line 2 "template/utility.hpp"#line 5 "template/utility.hpp"#line 7 "template/utility.hpp"namespace ebi {template <class T> inline bool chmin(T &a, T b) {if (a > b) {a = b;return true;}return false;}template <class T> inline bool chmax(T &a, T b) {if (a < b) {a = b;return true;}return false;}template <class T> T safe_ceil(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return (a / b) + 1;elsereturn -((-a) / b);}template <class T> T safe_floor(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return a / b;elsereturn -((-a) / b) - 1;}constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;constexpr int INF = std::numeric_limits<int>::max() / 2;const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};} // namespace ebi#line 2 "a.cpp"namespace ebi {void main_() {i64 x;std::cin >> x;const int max = 300;std::vector table(max + 1, std::vector<i64>());std::unordered_map<i64,i64> map;rep(d,0,max+1) {if(d * d * d > x) break;rep(e,d,max+1) {if(d * d * d + e * e * e > x) break;rep(f,e,max+1) {i64 ret = d * d * d + e * e * e + f * f * f;if(ret > x) break;table[d].emplace_back(ret);}}}i64 ans = 0;rrep(c,0,max+1) {if(c * c * c > x) continue;for(auto x: table[c]) map[x]++;rep(b,0,c+1) {if(c * c * c + b * b * b > x) break;rep(a,0,b+1) {i64 ret = a * a * a + b * b * b + c * c * c;if(ret > x) break;if(map.contains(x - ret)) ans += map[x - ret];}}}std::cout << ans << '\n';}} // namespace ebiint main() {ebi::fast_io();int t = 1;// std::cin >> t;while (t--) {ebi::main_();}return 0;}