結果
問題 | No.2510 Six Cube Sum Counting |
ユーザー |
|
提出日時 | 2023-10-20 22:55:32 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2,459 ms / 4,000 ms |
コード長 | 3,837 bytes |
コンパイル時間 | 10,746 ms |
コンパイル使用メモリ | 293,976 KB |
最終ジャッジ日時 | 2025-02-17 10:32:45 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 26 |
ソースコード
#line 1 "combined.cpp"#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#pragma region Macros#include <bits/stdc++.h>using namespace std;template <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;}#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {os << '{';for(int i = 0; i < (int)v.size(); i++) {if(i) { os << ','; }os << v[i];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifstruct Setup {Setup() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}} __Setup;using ll = long long;#define OVERLOAD3(_1, _2, _3, name, ...) name#define ALL(v) (v).begin(), (v).end()#define RALL(v) (v).rbegin(), (v).rend()#define REP1(i, n) for(int i = 0; i < int(n); i++)#define REP2(i, a, b) for(int i = (a); i < int(b); i++)#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())#define REVERSE(v) reverse(ALL(v))#define SZ(v) ((int)(v).size())const int INF = 1 << 30;const ll LLINF = 1LL << 60;constexpr int MOD = 1000000007;constexpr int MOD2 = 998244353;const int dx[4] = {1, 0, -1, 0};const int dy[4] = {0, 1, 0, -1};void Case(int i) { cout << "Case #" << i << ": "; }int popcount(int x) { return __builtin_popcount(x); }ll popcount(ll x) { return __builtin_popcountll(x); }#pragma endregion Macros#line 2 "/Users/siro53/kyo-pro/compro_library/misc/compress.hpp"#line 5 "/Users/siro53/kyo-pro/compro_library/misc/compress.hpp"template <typename T> class Compress {public:Compress() = default;explicit Compress(const std::vector<T> &v) : dat(v) {build();}void push_back(T val) { dat.push_back(val); }void build() {std::sort(dat.begin(), dat.end());dat.erase(std::unique(dat.begin(), dat.end()), dat.end());}int get(T val) const {int pos = std::lower_bound(dat.begin(), dat.end(), val) - dat.begin();return pos;}T operator[](int i) const { return dat[i]; }size_t size() const { return dat.size(); }private:std::vector<T> dat;};#line 78 "combined.cpp"void solve() {int X, ans = 0;cin >> X;vector<tuple<int, int, int>> ev;Compress<int> comp;REP(a, 300 + 1) {REP(b, a, 300 + 1) {REP(c, b, 300 + 1) {int s = a * a * a + b * b * b + c * c * c;if(s > X) continue;ev.emplace_back(c, 0, s);ev.emplace_back(a, 1, s);comp.push_back(s);}}}sort(ALL(ev));comp.build();int sz = SZ(comp);vector<int> cnt(sz, 0);for(const auto& [_, type, s] : ev) {if(type == 0) {cnt[comp.get(s)]++;} else {int pos = comp.get(X - s);if(comp[pos] == X - s) ans += cnt[pos];}}cout << ans << endl;}int main() {int T = 1;// cin >> T;while(T--) solve();}