結果
問題 | No.1318 ABCD quadruplets |
ユーザー |
![]() |
提出日時 | 2020-12-15 17:46:49 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 917 ms / 2,000 ms |
コード長 | 6,307 bytes |
コンパイル時間 | 2,644 ms |
コンパイル使用メモリ | 207,220 KB |
最終ジャッジ日時 | 2025-01-17 01:06:39 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
//#define _GLIBCXX_DEBUG#include<bits/stdc++.h>using namespace std;#define endl '\n'#define lfs cout<<fixed<<setprecision(10)#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()#define spa << " " <<#define fi first#define se second#define MP make_pair#define MT make_tuple#define PB push_back#define EB emplace_back#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)using ll = long long;using ld = long double;const ll MOD1 = 1e9+7;const ll MOD9 = 998244353;const ll INF = 1e18;using P = pair<ll, ll>;template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){auto tmp = v;for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];}template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){rearrange(ord, head);rearrange(ord, tail...);}//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());int popcount(ll x){return __builtin_popcountll(x);};int poplow(ll x){return __builtin_ctzll(x);};int pophigh(ll x){return 63 - __builtin_clzll(x);};namespace FastFourierTransform {using real = double;struct C {real x, y;C() : x(0), y(0) {}C(real x, real y) : x(x), y(y) {}inline C operator+(const C &c) const { return C(x + c.x, y + c.y); }inline C operator-(const C &c) const { return C(x - c.x, y - c.y); }inline C operator*(const C &c) const { return C(x * c.x - y * c.y, x * c.y + y * c.x); }inline C conj() const { return C(x, -y); }};const real PI = acosl(-1);int base = 1;vector< C > rts = { {0, 0},{1, 0} };vector< int > rev = {0, 1};void ensure_base(int nbase) {if(nbase <= base) return;rev.resize(1 << nbase);rts.resize(1 << nbase);for(int i = 0; i < (1 << nbase); i++) {rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));}while(base < nbase) {real angle = PI * 2.0 / (1 << (base + 1));for(int i = 1 << (base - 1); i < (1 << base); i++) {rts[i << 1] = rts[i];real angle_i = angle * (2 * i + 1 - (1 << base));rts[(i << 1) + 1] = C(cos(angle_i), sin(angle_i));}++base;}}void fft(vector< C > &a, int n) {assert((n & (n - 1)) == 0);int zeros = __builtin_ctz(n);ensure_base(zeros);int shift = base - zeros;for(int i = 0; i < n; i++) {if(i < (rev[i] >> shift)) {swap(a[i], a[rev[i] >> shift]);}}for(int k = 1; k < n; k <<= 1) {for(int i = 0; i < n; i += 2 * k) {for(int j = 0; j < k; j++) {C z = a[i + j + k] * rts[j + k];a[i + j + k] = a[i + j] - z;a[i + j] = a[i + j] + z;}}}}vector< int64_t > multiply(const vector< int > &a, const vector< int > &b) {int need = (int) a.size() + (int) b.size() - 1;int nbase = 1;while((1 << nbase) < need) nbase++;ensure_base(nbase);int sz = 1 << nbase;vector< C > fa(sz);for(int i = 0; i < sz; i++) {int x = (i < (int) a.size() ? a[i] : 0);int y = (i < (int) b.size() ? b[i] : 0);fa[i] = C(x, y);}fft(fa, sz);C r(0, -0.25 / (sz >> 1)), s(0, 1), t(0.5, 0);for(int i = 0; i <= (sz >> 1); i++) {int j = (sz - i) & (sz - 1);C z = (fa[j] * fa[j] - (fa[i] * fa[i]).conj()) * r;fa[j] = (fa[i] * fa[i] - (fa[j] * fa[j]).conj()) * r;fa[i] = z;}for(int i = 0; i < (sz >> 1); i++) {C A0 = (fa[i] + fa[i + (sz >> 1)]) * t;C A1 = (fa[i] - fa[i + (sz >> 1)]) * t * rts[(sz >> 1) + i];fa[i] = A0 + A1 * s;}fft(fa, sz >> 1);vector< int64_t > ret(need);for(int i = 0; i < need; i++) {ret[i] = llround(i & 1 ? fa[i >> 1].y : fa[i >> 1].x);}return ret;}};int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;ll n,m;cin>>n>>m;vector<ll>ret(n+1);rep(i,0,3*m+1){vector<int>x(n+1);rep(a,0,m+1)rep(b,0,m+1){int c=i-a-b;if(c<0||c>m)continue;int v=a*(a+b+c)+b*(b+c)+c*c;if(v>n)continue;x[v]++;}int cnt=0;rep(j,0,n+1)if(x[j]>0)cnt++;if(cnt<=INF){rep(j,0,n+1){if(x[j]==0)continue;rep(d,0,m+1){int add=d*(i+d);if(j+add>n)break;ret[j+add]+=x[j];}}}else{vector<int>y(n+1);rep(d,0,m+1)if(d*(i+d)<=n)y[d*(i+d)]++;auto z=FastFourierTransform::multiply(x,y);rep(j,0,n+1)ret[j]+=z[j];}}rep(i,0,n+1)cout<<ret[i]<<endl;return 0;}