結果
問題 | No.2510 Six Cube Sum Counting |
ユーザー |
|
提出日時 | 2023-10-20 22:35:08 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3,103 ms / 4,000 ms |
コード長 | 4,615 bytes |
コンパイル時間 | 4,507 ms |
コンパイル使用メモリ | 235,828 KB |
実行使用メモリ | 140,404 KB |
最終ジャッジ日時 | 2024-09-20 20:25:15 |
合計ジャッジ時間 | 80,750 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>// url#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=b-1;i>=a;i--)#define all(x) (x).begin(),(x).end()#define pb(x) push_back(x);template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }typedef long long ll;typedef long double lld;using namespace std;using namespace atcoder;using mint = static_modint<998244353>;const ll mod=998244353;// using mint = static_modint<1000000007>;//const ll mod=1e9+7;int dx[4]={1,0,-1,0};int dy[4]={0,1,0,-1};const string zton="0123456789";const string atoz="abcdefghijklmnopqrstuvwxyz";const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";const ll inf=(1ll<<60);// const int inf=(1<<30);lld dist(lld x1,lld x2,lld y1,lld y2){lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);res=sqrt(abs(res));return res;}lld arg(lld x,lld y){const lld eps=1e-8;lld res=0;if(abs(x)+abs(y)<=eps)return 0.0;else if(abs(x)<=eps){if(y>=0.0)return (M_PI/2);else return (M_PI/2+M_PI);}else if(abs(y)<=eps){if(x>=0.0)return 0.0;else return M_PI;}res=atan2(abs(y),abs(x));if(x<=0&&y>=0)res=(M_PI-res);else if(x<=0&&y<=0)res+=(M_PI);else if(x>=0&&y<=0)res=(M_PI*2-res);return res;}ll gcd(ll a,ll b){if(a==0||b==0)return a+b;ll r;r=a%b;if(r==0){return b;}else{return gcd(b,r);}}std::ostream &operator<<(std::ostream &dest, __int128_t value) {std::ostream::sentry s(dest);if (s) {__uint128_t tmp = value < 0 ? -value : value;char buffer[128];char *d = std::end(buffer);do {--d;*d = "0123456789"[tmp % 10];tmp /= 10;} while (tmp != 0);if (value < 0) {--d;*d = '-';}int len = std::end(buffer) - d;if (dest.rdbuf()->sputn(d, len) != len) {dest.setstate(std::ios_base::badbit);}}return dest;}__int128 parse128(string &s) {__int128 ret = 0;for (int i = 0; i < s.length(); i++){if ('0' <= s[i] && s[i] <= '9'){ret = 10 * ret + s[i] - '0';}}return ret;}using l3 = __int128;bool comp_arg(pair<ll,ll> a,pair<ll,ll> b){if(a.second>=0&&b.second<0)return true;else if(a.second<0&&b.second>=0)return false;if(a.second>=0&&b.second>=0){if(a.first>=0&&b.first<0)return true;}else{if(a.first>=0&&b.first<0)return false;}ll det=a.first*b.second-a.second*b.first;if(det>0)return true;return false;}typedef pair<ll,int> P;int main(void){ios::sync_with_stdio(false);cin.tie(nullptr);ll X;cin >> X;ll A[301];rep(i,0,301){A[i]=1;rep(j,0,3){A[i]*=i;}}vector<ll> v;rep(d,0,301){rep(e,d,301){rep(f,e,301){ll tmp=A[d]+A[e]+A[f];v.pb(tmp);}}}sort(all(v));v.erase(unique(all(v)),v.end());int n=v.size();ll s[n];fill(s,s+n,-1);rep(i,0,n){ll tmp=X-v[i];if(tmp<0)break;ll x=lower_bound(all(v),tmp)-v.begin();if(v[x]==tmp){s[i]=x;}}ll cnt[n];fill(cnt,cnt+n,0);vector<ll> G[301];rep(d,0,301){rep(e,d,301){rep(f,e,301){ll tmp=A[d]+A[e]+A[f];ll x=lower_bound(all(v),tmp)-v.begin();if(v[x]==tmp){cnt[x]++;G[d].pb(x);}}}}ll ans=0;rep(c,0,301){rep(b,0,c+1){rep(a,0,b+1){ll tmp=X-A[a]-A[b]-A[c];if(tmp<0)break;ll x=lower_bound(all(v),tmp)-v.begin();if(v[x]==tmp){ans+=cnt[x];}}}// for(auto x:cnt1[c]){// ll tmp=x.first;// ll num=x.second;// if(cnt.count(tmp)){// cnt[tmp]-=num;// }// }// rep(b,c+1,301)rep(a,b+1,301){// ll tmp=A[a]+A[b]+A[c];// ll x=lower_bound(all(v),tmp)-v.begin();// if(v[x]==tmp){// cnt[x]--;// }// }for(auto x:G[c]){cnt[x]--;}}cout << ans << endl;}