#832936 (C++17) No.2187 三立法和 mod 333

提出ソース

結果

問題	No.2187 三立法和 mod 333
ユーザー	hamath
提出日時	2023-01-13 22:49:51
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	2 ms / 100 ms
コード長	8,284 bytes
コンパイル時間	3,463 ms
コンパイル使用メモリ	222,056 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-06 23:43:02
合計ジャッジ時間	3,835 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	1 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	1 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	1 ms 6,940 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	2 ms 6,944 KB
testcase_22	AC	1 ms 6,944 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	2 ms 6,944 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	1 ms 6,940 KB
testcase_29	AC	2 ms 6,940 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#else
    #pragma GCC optimize("O3")
    #pragma GCC optimize("unroll-loops")
    #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#endif

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<VP> VVP;
typedef vector<Vec> VV;
typedef vector<Vi> VVi;
typedef vector<Vc> VVc;
typedef vector<VV> VVV;
typedef vector<VVV> VVVV;
#define MAKEVV(variable, a, ...) VV variable(a, Vec(__VA_ARGS__))
#define MAKEVVc(variable, a, ...) VVc variable(a,Vc(__VA_ARGS__))
#define MAKEVVV(variable, a, b, ...) VVV variable(a, VV(b, Vec(__VA_ARGS__)))
#define MAKEVVVV(variable, a, b, c, ...) VVVV variable(a, VVV(b, (VV(c, Vec(__VA_ARGS__)))))

#define endl '\n'
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 4'000'000'000'000'000'010LL;
const ll MOD=998244353;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#define SUM(a) accumulate(ALL(a),0LL)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;
#define dbgarr(n,m,arr) rep(iii,n){rep(jjj,m){cerr<<arr[iii][jjj]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(iii,n){cerr<<arr[iii]<<" ";}cerr<<endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout<<a<<endl
#define outminusone(a) cout<< ( a==INF ? -1 : a ) <<endl
#define out2(a,b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>auto lb(T &X, ll x){return lower_bound(ALL(X),x) - X.begin();}
template<class T>auto ub(T &X, ll x){return upper_bound(ALL(X),x) - X.begin();}
ll popcnt(ll x){return __builtin_popcount(x);}
ll topbit(ll t){return t==0?-1:63-__builtin_clzll(t);}
ll floor(ll y,ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return (y-x+1)/x;}return y/x;};
ll ceil(ll y, ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return y/x;}return (y+x-1)/x;};

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

template<typename T1, typename T2>
istream &operator>>(istream &i, pair<T1, T2> &p) { return i>>p.first>>p.second; }

template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,v.size())i>>v[j];return i;}

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len=v.size();
    for(int i=0; i<len; ++i) {
        s<<v[i];
        if(i<len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    s<<endl;
    int len=vv.size();
    for(int i=0; i<len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}

ll solve(ll a, VV &g){
    ll mx = 4444;
    ll mod = 333;
    ll summx = 1;
    rep(i,4)summx *= mx;
    ll ans = 0;
    REP(x,1,mx){
        REP(y,1,mx){
            ll nokori = summx - x*x*x*x - y*y*y*y;
            if(nokori < 0) continue;
            ll tmd = (x*x*x + y*y*y) % mod;
            ll nmd = (a - tmd + mod) % mod;
            ans += lb(g[nmd],nokori);
        }
    }
    return ans;
}

ll solve2(ll a) {
    if(a == 333){
        return 353412483;
    }
    Vec v = {353412483, 499853409, 198066141, 65944976, 0, 0, 83359314, 197704749, 499956396, 461596998, 499924557,
             250031589, 66025737, 0, 0, 65922195, 197880351, 395804754, 461671050, 395752629, 197825844, 65951319, 0, 0,
             65936360, 197777304, 499639056, 583029498, 395715012, 249552855, 66073349, 0, 0, 66026043, 197876565,
             395514645, 582863367, 303214194, 249900573, 66080034, 0, 0, 65941840, 249952551, 395548158, 583092006,
             395796816, 250096923, 83408904, 0, 0, 83352606, 197785611, 395734917, 461688090, 395834907, 197910177,
             65958885, 0, 0, 83129445, 197879421, 395601315, 583179990, 499975596, 197894460, 83217288, 0, 0, 65851552,
             197977152, 395723337, 461598072, 499492386, 151682058, 83391159, 0, 0, 65982393, 197810568, 499698792,
             461615477, 499465320, 197929308, 83479962, 0, 0, 66034772, 249868407, 395609340, 461586120, 395850384,
             197943681, 65989561, 0, 0, 66018201, 249605913, 395763186, 461545017, 500244135, 250121904, 65992770, 0, 0,
             83439696, 197582427, 395906010, 461534357, 395972283, 249747105, 50667829, 0, 0, 65970890, 197840178,
             395783145, 582714366, 395839320, 249607272, 66034569, 0, 0, 65970813, 197862537, 499837770, 461586033,
             395704725, 197937468, 66025153, 0, 0, 65971953, 197855130, 499324197, 461779937, 395694588, 250272546,
             83394459, 0, 0, 65931391, 250137234, 395347209, 461799958, 395664129, 198104688, 83187177, 0, 0, 65844093,
             197915487, 395640954, 461877100, 499267476, 197996145, 83116794, 0, 0, 83077128, 197816517, 395716419,
             583089981, 395680647, 197847309, 66034770, 0, 0, 65927544, 197856531, 395729877, 582755274, 395784210,
             197870754, 83518725, 0, 0, 83482623, 197741811, 500063223, 461407793, 395845749, 197818044, 66124482, 0, 0,
             83419152, 197585898, 395806743, 461487779, 396117981, 249519294, 66035306, 0, 0, 83193621, 249380424,
             395683833, 461503212, 500027589, 197855943, 65988450, 0, 0, 65930507, 197764092, 395690775, 461566449,
             499518105, 197901777, 65986020, 0, 0, 65933772, 250096410, 395624835, 583102701, 395703927, 197915679,
             65987298, 0, 0, 50523021, 249970845, 395405595, 461756184, 395565168, 198146163, 83144547, 0, 0, 65983467,
             249543381, 499087524, 461617473, 395695518, 250057275, 65957211, 0, 0, 65974043, 197782437, 395546595,
             461593956, 395765376, 249800436, 65946828, 0, 0, 83100603, 197759865, 499933236, 461658190, 499637970,
             197937693, 65994989, 0, 0, 83165199, 151389405, 499921449, 461545845, 395752965, 197762508, 66111248, 0, 0,
             83355123, 197818980, 499370913, 582628467, 395794911, 197844207, 83457036, 0, 0, 66017907, 197835168,
             395622237, 461486226, 395661093, 197892921, 83237010, 0, 0, 83211351, 249550986, 395580453, 582788094,
             395923029, 249712644, 66025575, 0, 0, 65897514, 249726033, 302922846, 583014219, 395884293, 197863206,
             65933645, 0, 0, 65893369, 250099782, 395686374, 582793884, 499733808, 197928006, 66021523, 0, 0, 66010887,
             197890128, 395726169, 461611814, 395609376, 197826183, 66037128, 0, 0, 65941779, 249662991, 499401411,
             461547663, 499391031, 198039087, 83234613, 0, 0, 66018343, 197644773, 499469412};
    return v[a];
}
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(20);
    ll a;cin>>a;
    ll ans = solve2(a);
    out(ans);
//    string t = "{";
//    ll mx = 4444;
//    ll mod = 333;
//    VV g(mod);
//    REP(x,1,mx){
//        ll m = x * x * x;
//        ll v = x * x * x * x;
//        g[m%mod].pb(v);
//    }
//    rep(i,mod){
//        sort(ALL(g[i]));
//    }
//    rep(a,333){
//        ll ans = solve(a,g);
//        t += to_string(ans);
//        t += ",";
//    }
//    t += ")";
//    out(t);
}

yukicoder

結果

テストケース

ソースコード