結果

問題 No.2546 Many Arithmetic Sequences
ユーザー 👑 hitonanodehitonanode
提出日時 2023-11-25 13:42:46
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 147 ms / 2,000 ms
コード長 12,054 bytes
コンパイル時間 2,124 ms
コンパイル使用メモリ 200,008 KB
実行使用メモリ 22,404 KB
最終ジャッジ日時 2023-11-25 20:45:46
合計ジャッジ時間 6,571 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,676 KB
testcase_01 AC 2 ms
6,676 KB
testcase_02 AC 2 ms
6,676 KB
testcase_03 AC 61 ms
10,568 KB
testcase_04 AC 110 ms
13,776 KB
testcase_05 AC 89 ms
11,848 KB
testcase_06 AC 20 ms
6,676 KB
testcase_07 AC 43 ms
7,668 KB
testcase_08 AC 14 ms
6,676 KB
testcase_09 AC 41 ms
8,956 KB
testcase_10 AC 73 ms
12,892 KB
testcase_11 AC 80 ms
15,580 KB
testcase_12 AC 35 ms
7,824 KB
testcase_13 AC 72 ms
11,732 KB
testcase_14 AC 75 ms
14,364 KB
testcase_15 AC 22 ms
6,676 KB
testcase_16 AC 70 ms
14,356 KB
testcase_17 AC 93 ms
13,700 KB
testcase_18 AC 55 ms
9,668 KB
testcase_19 AC 64 ms
10,332 KB
testcase_20 AC 40 ms
8,164 KB
testcase_21 AC 41 ms
8,812 KB
testcase_22 AC 76 ms
11,488 KB
testcase_23 AC 141 ms
21,532 KB
testcase_24 AC 143 ms
21,540 KB
testcase_25 AC 147 ms
21,532 KB
testcase_26 AC 145 ms
21,544 KB
testcase_27 AC 144 ms
21,536 KB
testcase_28 AC 104 ms
22,404 KB
testcase_29 AC 104 ms
22,404 KB
testcase_30 AC 104 ms
22,404 KB
testcase_31 AC 105 ms
22,404 KB
testcase_32 AC 103 ms
22,404 KB
testcase_33 AC 1 ms
6,676 KB
testcase_34 AC 122 ms
21,120 KB
testcase_35 AC 2 ms
6,676 KB
testcase_36 AC 112 ms
21,120 KB
testcase_37 AC 2 ms
6,676 KB
testcase_38 AC 2 ms
6,676 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


// Convex Hull Trick
// Implementation Idea:
// https://github.com/satanic0258/Cpp_snippet/blob/master/src/technique/ConvexHullTrick.cpp
// #include <boost/multiprecision/cpp_int.hpp>
// using mpint = boost::multiprecision::cpp_int;
namespace CHT {
using T_CHT = long long;
static const T_CHT T_MIN = std::numeric_limits<T_CHT>::lowest() + 1;
struct Line {
    T_CHT a, b; // y = ax + b
    mutable std::pair<T_CHT, T_CHT>
        rp; // (numerator, denominator) `x` coordinate of the crossing point with next line
    Line(T_CHT a, T_CHT b) : a(a), b(b), rp(T_MIN, T_MIN) {}
    static std::pair<T_CHT, T_CHT> cross(const Line &ll, const Line &lr) {
        return std::make_pair(ll.b - lr.b, lr.a - ll.a); // `ll.a < lr.a` is assumed implicitly
    }
    bool operator<(const Line &r) const {
        if (b == T_MIN) {
            return r.rp.first == T_MIN ? true : a * r.rp.second < r.rp.first;
        } else if (r.b == T_MIN) {
            return rp.first == T_MIN ? false : !(r.a * rp.second < rp.first);
        } else {
            return a < r.a;
        }
    }
};
template <typename T_MP> struct Lines : std::multiset<Line> {
    bool flg_min; // true iff for minimization
    inline bool isNeedless(iterator itr) {
        if (size() == 1) return false;
        auto nxt = std::next(itr);
        if (itr == begin())
            return itr->a == nxt->a and itr->b <= nxt->b;
        else {
            auto prv = std::prev(itr);
            if (nxt == end())
                return itr->a == prv->a and itr->b <= prv->b;
            else
                return T_MP(prv->b - itr->b) * (nxt->a - itr->a) >=
                       T_MP(itr->b - nxt->b) * (itr->a - prv->a);
        }
    }
    void add_line(T_CHT a, T_CHT b) {
        if (flg_min) a = -a, b = -b;
        auto itr = insert({a, b});
        if (isNeedless(itr))
            erase(itr);
        else {
            while (std::next(itr) != end() and isNeedless(std::next(itr))) {
                erase(std::next(itr));
            }
            while (itr != begin() and isNeedless(std::prev(itr))) { erase(std::prev(itr)); }
            if (std::next(itr) != end()) { itr->rp = CHT::Line::cross(*itr, *std::next(itr)); }
            if (itr != begin()) { std::prev(itr)->rp = CHT::Line::cross(*std::prev(itr), *itr); }
        }
    }
    Lines(bool is_minimizer) : flg_min(is_minimizer) {}
    std::pair<T_CHT, T_CHT> get(T_CHT x) {
        auto itr = lower_bound({x, CHT::T_MIN});
        T_CHT retval = CHT::T_MIN, reta = CHT::T_MIN;
        if (itr != end()) { retval = itr->a * x + itr->b, reta = itr->a; }
        if (itr != begin()) {
            T_CHT tmp = std::prev(itr)->a * x + std::prev(itr)->b;
            if (tmp >= retval) { retval = tmp, reta = std::max(reta, std::prev(itr)->a); }
        }
        return std::make_pair(flg_min ? -retval : retval, flg_min ? -reta : reta);
    }
};
} // namespace CHT

template <typename T_MP> struct ConvexHullTrick {
    using T_CHT = CHT::T_CHT;
    CHT::Lines<T_MP> lines;
    ConvexHullTrick(bool is_minimizer) : lines(is_minimizer) {}
    void add_line(T_CHT a, T_CHT b) { lines.add_line(a, b); } // Add y = ax + b
    std::pair<T_CHT, T_CHT> get(T_CHT x) { return lines.get(x); }
    void add_convex_parabola(T_CHT c, T_CHT a, T_CHT b) {
        add_line(c * a * (-2), c * a * a + b);
    } // Add y = c(x - a)^2 + b
    T_CHT parabola_lower_bound(T_CHT c, T_CHT x) { return lines.get(x).first + c * x * x; }
};



lint f(lint a, lint d, lint x) {
    // a + a + d + a + 2d + ... + a + (x-1)d
    // = x * a + d * (x-1) * x / 2
    return (a + a + d * (x - 1)) * x / 2;
}

int main() {
    int N, M;
    cin >> N >> M;
    vector<lint> A(N), D(N);
    REP(i, N) cin >> A.at(i) >> D.at(i);

    vector<lint> X(N);
    lint ret = -(1LL << 61);

    priority_queue<plint> pq;
    lint tmp = 0;
    REP(i, N) {
        if (D.at(i) <= 0) pq.emplace(f(A.at(i), D.at(i), 1), i);
    }

    vector<lint> diffs;

    REP(_, M) {
        if (pq.empty()) {
            diffs.push_back(-1e12);
            continue;
        }
        auto [diff, i] = pq.top();
        dbgif(M <= 10, make_tuple(diff, i));
        pq.pop();
        tmp += diff;
        diffs.push_back(diff);
        X.at(i)++;
        pq.emplace(f(A.at(i), D.at(i), X.at(i) + 1) - f(A.at(i), D.at(i), X.at(i)), i);
    }

    dbgif(M <= 10, diffs);
    vector<lint> diffs_sum(M + 1);
    FOR(i, 1, diffs_sum.size()) diffs_sum.at(i) = diffs_sum.at(i - 1) + diffs.at(i - 1);
    dbgif(M <= 10, diffs_sum);

    chmax(ret, diffs_sum.back());
    ConvexHullTrick<__int128> cht(false);

    bool flg = false;
    REP(i, N) {
        if (D.at(i) > 0) {
            cht.add_line(D.at(i), A.at(i) * 2 - D.at(i));
            flg = true;
            // int lo = 0, hi = M;
            // auto e = [&](int j) -> lint { return f(A.at(i), D.at(i), j) + diffs_sum.at(M - j); };

            // while (hi - lo > 2) {
            //     int mid1 = (lo * 2 + hi) / 3;
            //     int mid2 = (lo + hi * 2) / 3;
            //     if (e(mid1) < e(mid2)) {
            //         lo = mid1;
            //     } else {
            //         hi = mid2;
            //     }
            // }
            // FOR(j, lo, hi + 1) chmax(ret, e(j));
        }
    }
    REP(m, M + 1) {
        if (!flg) continue;
        lint v = cht.get(m).first * m / 2;
        dbgif(M <= 100, make_tuple(m, v));
        chmax(ret, v + diffs_sum.at(M - m));
    }

    cout << ret << '\n';
}
0