結果

問題 No.1318 ABCD quadruplets
ユーザー heno239heno239
提出日時 2020-12-15 01:14:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 320 ms / 2,000 ms
コード長 3,981 bytes
コンパイル時間 2,036 ms
コンパイル使用メモリ 141,176 KB
実行使用メモリ 20,976 KB
最終ジャッジ日時 2023-10-20 05:34:41
合計ジャッジ時間 6,061 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
20,040 KB
testcase_01 AC 10 ms
20,040 KB
testcase_02 AC 10 ms
20,040 KB
testcase_03 AC 10 ms
20,040 KB
testcase_04 AC 10 ms
20,040 KB
testcase_05 AC 10 ms
20,040 KB
testcase_06 AC 10 ms
20,040 KB
testcase_07 AC 10 ms
20,040 KB
testcase_08 AC 9 ms
20,040 KB
testcase_09 AC 10 ms
20,044 KB
testcase_10 AC 10 ms
20,044 KB
testcase_11 AC 10 ms
20,044 KB
testcase_12 AC 10 ms
20,040 KB
testcase_13 AC 13 ms
20,168 KB
testcase_14 AC 99 ms
20,712 KB
testcase_15 AC 12 ms
20,044 KB
testcase_16 AC 134 ms
20,448 KB
testcase_17 AC 18 ms
20,448 KB
testcase_18 AC 89 ms
20,712 KB
testcase_19 AC 42 ms
20,712 KB
testcase_20 AC 13 ms
20,164 KB
testcase_21 AC 23 ms
20,044 KB
testcase_22 AC 21 ms
20,976 KB
testcase_23 AC 315 ms
20,976 KB
testcase_24 AC 282 ms
20,976 KB
testcase_25 AC 56 ms
20,976 KB
testcase_26 AC 35 ms
20,976 KB
testcase_27 AC 194 ms
20,976 KB
testcase_28 AC 64 ms
20,976 KB
testcase_29 AC 78 ms
20,976 KB
testcase_30 AC 320 ms
20,976 KB
testcase_31 AC 59 ms
20,976 KB
testcase_32 AC 320 ms
20,976 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
struct modint {
    ll n;
    modint() :n(0) { ; }
    modint(ll m) :n(m) {
        if (n >= mod)n %= mod;
        else if (n < 0)n = (n % mod + mod) % mod;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}


void solve() {
    int n, m; cin >> n >> m;
    int cnt[8];
    cnt[0] = 24;
    cnt[1] = 12;
    cnt[2] = 12;
    cnt[3] = 4;
    cnt[4] = 12;
    cnt[5] = 6;
    cnt[6] = 4;
    cnt[7] = 1;
    vector<ll> ans(n + 1);
    for (int a = 0; a <= m; a++) {
        for (int b = a; b <= m; b++) {
            for (int c = b; c <= m; c++) {
                if (a * a + b * b + c * c + (a + b + c) * (a + b + c) > 2 * n)break;
                for (int d = c; d <= m; d++) {
                    int sum = a * a + b * b + c * c + d * d + (a + b + c + d) * (a + b + c + d);
                    if (sum > 2 * n)break;
                    int x = 0;
                    if (a == b)x |= 1;
                    if (b == c)x |= 2;
                    if (c == d)x |= 4;
                    ans[sum / 2] += cnt[x];
                }
            }
        }
    }
    rep(i, n + 1) {
        cout << ans[i] << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    //init_f();
    //init();
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
0