結果

問題 No.2546 Many Arithmetic Sequences
ユーザー hitonanodehitonanode
提出日時 2023-11-24 22:47:24
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
(最新)
AC  
(最初)
実行時間 -
コード長 8,639 bytes
コンパイル時間 2,179 ms
コンパイル使用メモリ 192,532 KB
実行使用メモリ 21,472 KB
最終ジャッジ日時 2024-09-26 09:57:09
合計ジャッジ時間 6,895 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 61 ms
8,964 KB
testcase_04 AC 120 ms
13,600 KB
testcase_05 AC 95 ms
11,728 KB
testcase_06 AC 21 ms
5,376 KB
testcase_07 AC 45 ms
7,412 KB
testcase_08 AC 13 ms
5,376 KB
testcase_09 AC 45 ms
8,960 KB
testcase_10 AC 82 ms
12,720 KB
testcase_11 AC 91 ms
14,428 KB
testcase_12 AC 38 ms
7,700 KB
testcase_13 AC 80 ms
11,736 KB
testcase_14 AC 83 ms
13,724 KB
testcase_15 AC 24 ms
6,256 KB
testcase_16 AC 79 ms
12,696 KB
testcase_17 AC 105 ms
13,564 KB
testcase_18 AC 62 ms
9,548 KB
testcase_19 AC 68 ms
10,208 KB
testcase_20 AC 43 ms
8,168 KB
testcase_21 AC 43 ms
8,560 KB
testcase_22 AC 86 ms
11,364 KB
testcase_23 AC 161 ms
20,068 KB
testcase_24 AC 166 ms
20,060 KB
testcase_25 AC 164 ms
20,064 KB
testcase_26 AC 162 ms
20,064 KB
testcase_27 AC 156 ms
20,188 KB
testcase_28 AC 107 ms
21,472 KB
testcase_29 AC 105 ms
21,340 KB
testcase_30 AC 106 ms
21,216 KB
testcase_31 AC 109 ms
21,348 KB
testcase_32 AC 109 ms
21,348 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 129 ms
19,556 KB
testcase_35 AC 2 ms
5,376 KB
testcase_36 AC 119 ms
19,680 KB
testcase_37 RE -
testcase_38 AC 2 ms
5,376 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



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);

    REP(i, N) {
        lint tmp = f(A.at(i), D.at(i), M);
        dbg(make_tuple(i, tmp));
        chmax(ret, tmp);
    }


    {
        // vector<lint> X(N);
        // if (N == 3) X = {4, 0, 1};
        // if (N == 2) X = {0, 10};
        // lint tmp = 0;
        // REP(i, N) tmp += f(A.at(i), D.at(i), X.at(i));
        // dbg(tmp);
        // cout << tmp << '\n';
    }

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

    vector<lint> diffs;

    REP(_, M) {
        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);
    }
    // reverse(ALL(diffs));

    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());
    REP(i, N) {
        if (D.at(i) > 0) {
            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));
        }
    }

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