結果

問題 No.1318 ABCD quadruplets
ユーザー ningenMe
提出日時 2020-12-16 02:43:51
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 478 ms / 2,000 ms
コード長 3,372 bytes
コンパイル時間 2,198 ms
コンパイル使用メモリ 201,224 KB
最終ジャッジ日時 2025-01-17 01:47:41
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = 1'000'000'000LL + 7; //'
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x
    .second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj
    .begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != 
    obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << 
    obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, 
    delemiter) ) res.push_back(buffer); return res;}
int msb(int x) {return x?31-__builtin_clz(x):-1;}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
/**
 * @url 
 * @est
 */ 
int main() {
    int N,M; cin >> N >> M;
    vector<int> ans(N+1,0);
    for(int a=0;a*a<=N && a<=M;++a) {
        for(int b=a;a*a+a*b+b*b<=N && b<=M;++b) {
            for(int c=b;a*a+a*b+a*c+b*b+b*c+c*c<=N && c<=M;++c) {
                for(int d=c;a*a+a*b+a*c+a*d+b*b+b*c+b*d+c*c+c*d+d*d<=N && d<=M;++d) {
                    int s=a*a+a*b+a*c+a*d+b*b+b*c+b*d+c*c+c*d+d*d;
                    if(a==b&&b==c&&c==d) ans[s]+=1;
                    if(a< b&&b==c&&c==d) ans[s]+=4;
                    if(a==b&&b< c&&c==d) ans[s]+=6;
                    if(a==b&&b==c&&c< d) ans[s]+=4;
                    if(a< b&&b< c&&c==d) ans[s]+=12;
                    if(a< b&&b==c&&c< d) ans[s]+=12;
                    if(a==b&&b< c&&c< d) ans[s]+=12;
                    if(a< b&&b< c&&c< d) ans[s]+=24;
                }
            }
        }
    }
    for(int i=0;i<=N;++i) cout << ans[i] << "\n";
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0