結果

問題 No.2546 Many Arithmetic Sequences
ユーザー fuppy_kyopro
提出日時 2023-11-24 22:49:45
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
RE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,249 bytes
コンパイル時間 12,262 ms
コンパイル使用メモリ 297,172 KB
最終ジャッジ日時 2025-02-18 00:26:21
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 35 RE * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

#include <bits/stdc++.h>

// #include <atcoder/all>
// #include <atcoder/lazysegtree>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
// #define endl '\n'

signed main() {
    int n, m;
    cin >> n >> m;

    vector<pll> ad;
    priority_queue<pll> pq;
    rep(i, n) {
        ll a, d;
        cin >> a >> d;
        if (d <= 0) {
            pq.emplace(a, d);
        } else {
            ad.emplace_back(a, d);
        }
    }

    vl neg;
    while (neg.size() < m) {
        auto [a, d] = pq.top();
        pq.pop();
        neg.emplace_back(a);
        pq.emplace(a + d, d);
    }

    vl sum(m + 1);
    rep(i, m) {
        sum[i + 1] = sum[i] + neg[i];
    }
    // DEBUG_VEC(sum);

    ll ans = sum[m];

    if (ad.size() == 0) {
        cout << ans << endl;
        return 0;
    }

    sort(all(ad));
    reverse(all(ad));
    vector<pll> nad;
    nad.push_back(ad[0]);
    for (int i = 1; i < ad.size(); i++) {
        if (nad.back().second < ad[i].second) {
            nad.push_back(ad[i]);
        }
    }
    swap(ad, nad);

    int done = 0;
    rep(i, ad.size() - 1) {
        ll a = ad[i].first, d = ad[i].second;
        ll na = ad[i + 1].first, nd = ad[i + 1].second;

        auto f1 = [&](ll x) {
            ll ret = a * x + x * (x - 1) / 2 * d;
            return ret;
        };
        auto f2 = [&](ll x) {
            ll ret = na * x + x * (x - 1) / 2 * nd;
            return ret;
        };
        // DEBUG(ad[i]);

        int ok = done, ng = m + 1;
        while (ng - ok > 1) {
            int mid = (ok + ng) / 2;
            if (f1(mid) >= f2(mid + 1)) {
                ok = mid;
            } else {
                ng = mid;
            }
        }

        for (ll j = done; j <= ok; j++) {
            chmax(ans, f1(j) + sum[m - j]);
        }
        done = ok;
    }
    for (ll j = done; j <= m; j++) {
        chmax(ans, ad.back().first * j + j * (j - 1) / 2 * ad.back().second + sum[m - j]);
    }

    cout << ans << endl;
}
0