結果

問題 No.3397 Max Weighted Floor of Linear
コンテスト
ユーザー KumaTachiRen
提出日時 2025-12-04 02:26:13
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 315 ms / 2,000 ms
コード長 4,936 bytes
記録
コンパイル時間 3,527 ms
コンパイル使用メモリ 279,064 KB
実行使用メモリ 7,720 KB
最終ジャッジ日時 2025-12-04 02:26:25
合計ジャッジ時間 11,170 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#line 2 "library/template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#line 2 "library/template/macro.hpp"
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";
#line 6 "library/template/template.hpp"

#line 2 "library/template/util.hpp"
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <class T, class S = T>
S SUM(const vector<T>& a) {
  return accumulate(ALL(a), S(0));
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template <class T>
int popcnt(T x) {
  return __builtin_popcountll(x);
}
template <class T>
int topbit(T x) {
  return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <class T>
int lowbit(T x) {
  return (x == 0 ? -1 : __builtin_ctzll(x));
}
#line 8 "library/template/template.hpp"

#line 2 "library/template/inout.hpp"
struct Fast {
  Fast() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} fast;

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << " " << p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& a) {
  for (auto& v : a) is >> v;
  return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& a) {
  for (auto it = a.begin(); it != a.end();) {
    os << *it;
    if (++it != a.end()) os << " ";
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& st) {
  os << "{";
  for (auto it = st.begin(); it != st.end();) {
    os << *it;
    if (++it != st.end()) os << ",";
  }
  os << "}";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2>& mp) {
  os << "{";
  for (auto it = mp.begin(); it != mp.end();) {
    os << it->first << ":" << it->second;
    if (++it != mp.end()) os << ",";
  }
  os << "}";
  return os;
}

void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T& t, const U&... u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}
#line 10 "library/template/template.hpp"

#line 2 "library/template/debug.hpp"
#ifdef LOCAL
#define debug 1
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define debug 0
#define show(...) true
#endif
template <class T>
void _show(int i, T name) {
  cerr << '\n';
}
template <class T1, class T2, class... T3>
void _show(int i, const T1& a, const T2& b, const T3&... c) {
  for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i];
  cerr << ":" << b << " ";
  _show(i + 1, a, c...);
}
#line 2 "main.cpp"

#line 2 "library/math/floor-monoid-product.hpp"

template <class T, T (*op)(T, T), T (*e)(), std::unsigned_integral U = uint64_t>
T FloorMonoidProduct(U n, U m, U a, U b, T x, T y, function<T(T, U)> pow = nullptr) {
  if (!pow) {
    pow = [](T t, U n) {
      T p = e();
      while (n) {
        if (n & 1) p = op(p, t);
        t = op(t, t);
        n >>= 1;
      }
      return p;
    };
  }
  assert(m != 0);
  T pl = e(), pr = e();
  while (true) {
    if (a >= m) {
      U q = a / m;
      x = op(x, pow(y, q));
      a -= m * q;
    }
    if (b >= m) {
      U q = b / m;
      pl = op(pl, pow(y, q));
      b -= m * q;
    }
    U c = a * n + b;
    if (c < m) {
      pl = op(pl, pow(x, n));
      break;
    }
    pr = op(op(y, pow(x, c % m / a)), pr);
    n = c / m - 1;
    b = m + a - b - 1;
    swap(a, m);
    swap(x, y);
  }
  return op(pl, pr);
}

/**
 * @brief モノイド版 Floor Sum
 * @docs docs/math/floor-monoid-product.md
 */
#line 4 "main.cpp"

// x=(a,0),y=(b,-INF)
static const ll INF = 1ll << 62;
struct S {
  ll sum, ans;
};
S op(S x, S y) { return S{x.sum + y.sum, max(x.ans, x.sum + y.ans)}; }
S e() { return S{0, -INF}; }

void solve() {
  ll n, m, a, b, c, d;
  in(n, m, a, b, c, d);
  auto p = FloorMonoidProduct<S, op, e, ull>(n, m, c, d, S{a, 0}, S{b, -INF});
  out(p.ans);
}

int main() {
  int t = 1;
  in(t);
  while (t--) solve();
}
0