結果

問題 No.1318 ABCD quadruplets
ユーザー ir5ir5
提出日時 2024-07-12 21:05:50
言語 C++23(gcc13)
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 371 ms / 2,000 ms
コード長 4,334 bytes
コンパイル時間 3,198 ms
コンパイル使用メモリ 156,028 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-12 21:06:15
合計ジャッジ時間 9,487 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 1 ms
5,376 KB
testcase_13 AC 21 ms
5,376 KB
testcase_14 AC 212 ms
5,376 KB
testcase_15 AC 22 ms
5,376 KB
testcase_16 AC 209 ms
5,376 KB
testcase_17 AC 130 ms
5,376 KB
testcase_18 AC 195 ms
5,376 KB
testcase_19 AC 186 ms
5,376 KB
testcase_20 AC 22 ms
5,376 KB
testcase_21 AC 50 ms
5,376 KB
testcase_22 AC 192 ms
5,376 KB
testcase_23 AC 366 ms
5,376 KB
testcase_24 AC 360 ms
5,376 KB
testcase_25 AC 219 ms
5,376 KB
testcase_26 AC 197 ms
5,376 KB
testcase_27 AC 290 ms
5,376 KB
testcase_28 AC 224 ms
5,376 KB
testcase_29 AC 244 ms
5,376 KB
testcase_30 AC 361 ms
5,376 KB
testcase_31 AC 213 ms
5,376 KB
testcase_32 AC 371 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

namespace solver {

template<typename T1, typename T2> struct In2 {
  T1 a; T2 b;
  friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};

template<typename T1, typename T2, typename T3> struct In3 {
  T1 a; T2 b; T3 c;
  friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};

ll n, m;

void read() {
  cin >> n >> m;
}

ll sq(ll x) { return x * x; }

void expe() {
  map<ll, vector<ll>> mp;

  ll tot = 0;
  for (ll a : range(m + 1))
  for (ll b : range(m + 1)) if (sq(a + b) + sq(a) + sq(b) <= 2 * n) {
    mp[a + b].push_back(sq(a) + sq(b));
    tot++;
  }
  dump(tot);

  for (auto& p : mp) ranges::sort(p.second);
}

using RetType = void;

RetType run() {

  int val[2][2][2];
  val[0][0][0] = 24;
  val[1][0][0] = 24 / 2;
  val[0][1][0] = 24 / 2;
  val[0][0][1] = 24 / 2;
  val[1][1][0] = 24 / 6;
  val[0][1][1] = 24 / 6;
  val[1][0][1] = 24 / 4;
  val[1][1][1] = 24 / 24;

  vector<int> res(n + 1);

  for (int a = 0; a <= m; ++a) {
    int t1 = a * a;
    if (t1 > n) break;

    for (int b = a; b <= m; ++b) {
      int s2 = a + b;
      int t2 = t1 + b * s2;
      int eq2 = a == b;
      if (t2 > n) break;

      for (int c = b; c <= m; ++c) {
        int s3 = s2 + c;
        int t3 = t2 + c * s3;
        int eq3 = b == c;
        if (t3 > n) break;

        for (int d = c; d <= m; ++d) {
          int s4 = s3 + d;
          int t4 = t3 + d * s4;
          int eq4 = c == d;
          if (t4 > n) break;

          // dump(a << " " << b << " " << c << " " << d);
          // dump(t4 << " <- " << eq2 << eq3 << eq4)

          res[t4] += val[eq2][eq3][eq4];
        }
      }
    }
  }

  for (int i : range(n + 1)) dump(i << " : " << res[i]);

  for (int i : range(n + 1)) cout << res[i] << endl;

  /*
  {
    for (ll a = 0, sqa = 0; a <= m; ++a, sqa = a * a) {
      if (sq(a) + sqa > 2 * n) break;

      for (ll b = a, sb = b + a, sqb = sqa + b * b; b <= m; b++, sb = a + b, sqb = sqa + b * b) {
        if (sq(sb) + sqb > 2 * n) break;

        for (ll c = b, sc = sb + c, sqc = sqb + c * c; c <= m; c++, sc = sb + c, sqc = sqb + c * c) {
          if (sq(sc) + sqc > 2 * n) break;

          for (ll d = c, sd = sc + d, sqd = sqc + d * d; d <= m; d++, sd = sc + d, sqd = sqc + d * d) {
            if (sq(sd) + sqd > 2 * n) break;

            res[(sq(sd) + sqd) >> 1]++;
          }
        }
      }
    }
    dump(tot);
  }
  */
}

}  // namespace

template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }

int main(int argc, char** argv) {
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase = 1;
  if (argc > 1) testcase = atoi(argv[1]);
  while (testcase--) {
    solver::read();
  }
  run(solver::run);
}
0