#931091 (C++17) No.2546 Many Arithmetic Sequences

• 問題: No.2546 Many Arithmetic Sequences
• ユーザー: 沙耶花
• 提出日時: 2023-11-24 22:19:39
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 259 ms / 2,000 ms
• コード長: 2,092 bytes
• コンパイル時間: 6,245 ms
• コンパイル使用メモリ: 269,876 KB
• 実行使用メモリ: 8,144 KB
• 最終ジャッジ日時: 2023-11-25 20:45:14
• 合計ジャッジ時間: 11,959 ms
• ジャッジサーバーID （参考情報）: judge13 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	1 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	70 ms; 6,676 KB
testcase_04	AC	227 ms; 6,676 KB
testcase_05	AC	159 ms; 6,676 KB
testcase_06	AC	33 ms; 6,676 KB
testcase_07	AC	76 ms; 6,676 KB
testcase_08	AC	19 ms; 6,676 KB
testcase_09	AC	93 ms; 6,676 KB
testcase_10	AC	164 ms; 6,676 KB
testcase_11	AC	187 ms; 8,144 KB
testcase_12	AC	67 ms; 6,676 KB
testcase_13	AC	132 ms; 6,676 KB
testcase_14	AC	176 ms; 8,144 KB
testcase_15	AC	51 ms; 6,676 KB
testcase_16	AC	153 ms; 8,144 KB
testcase_17	AC	167 ms; 6,676 KB
testcase_18	AC	113 ms; 6,676 KB
testcase_19	AC	112 ms; 6,676 KB
testcase_20	AC	88 ms; 6,676 KB
testcase_21	AC	63 ms; 6,676 KB
testcase_22	AC	141 ms; 6,676 KB
testcase_23	AC	254 ms; 8,144 KB
testcase_24	AC	259 ms; 8,144 KB
testcase_25	AC	257 ms; 8,144 KB
testcase_26	AC	259 ms; 8,144 KB
testcase_27	AC	258 ms; 8,144 KB
testcase_28	AC	244 ms; 8,144 KB
testcase_29	AC	246 ms; 8,144 KB
testcase_30	AC	245 ms; 8,144 KB
testcase_31	AC	247 ms; 8,144 KB
testcase_32	AC	250 ms; 8,144 KB
testcase_33	AC	2 ms; 6,676 KB
testcase_34	AC	238 ms; 8,140 KB
testcase_35	AC	2 ms; 6,676 KB
testcase_36	AC	182 ms; 8,144 KB
testcase_37	AC	2 ms; 6,676 KB
testcase_38	AC	2 ms; 6,676 KB

コンパイルメッセージ

main.cpp:20:9: warning: #pragma once in main file
   20 | #pragma once
      |         ^~~~

ソースコード

#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001
/**
 * Author: Simon Lindholm
 * Date: 2017-04-20
 * License: CC0
 * Source: own work
 * Description: Container where you can add lines of the form kx+m, and query maximum values at points x.
 *  Useful for dynamic programming (``convex hull trick'').
 * Time: O(\log N)
 * Status: stress-tested
 */
#pragma once
using ll = long long;
struct Line {
	mutable ll k, m, p;
	bool operator<(const Line& o) const { return k < o.k; }
	bool operator<(ll x) const { return p < x; }
};

struct LineContainer : multiset<Line, less<>> {
	// (for doubles, use inf = 1/.0, div(a,b) = a/b)
	static const ll inf = LLONG_MAX;
	ll div(ll a, ll b) { // floored division
		return a / b - ((a ^ b) < 0 && a % b); }
	bool isect(iterator x, iterator y) {
		if (y == end()) return x->p = inf, 0;
		if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
		else x->p = div(y->m - x->m, x->k - y->k);
		return x->p >= y->p;
	}
	void add(ll k, ll m) {
		auto z = insert({k, m, 0}), y = z++, x = y;
		while (isect(y, z)) z = erase(z);
		if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
		while ((y = x) != begin() && (--x)->p >= y->p)
			isect(x, erase(y));
	}
	ll query(ll x) {
		assert(!empty());
		auto l = *lower_bound(x);
		return l.k * x + l.m;
	}
};
int main(){
	
	int N,M;
	cin>>N>>M;
	
	LineContainer L;bool f = false;
	priority_queue<pair<long long,long long>> Q;
	rep(i,N){
		long long a,d;
		cin>>a>>d;
		if(d<0){
			Q.emplace(a,d);
		}
		else{
			L.add(d,a*2-d);
			f = true;
		}
		
	}
	long long ans = -Inf64;
	long long sum = 0;
	rep(i,M+1){
		if(i==M){
			ans = max(ans,sum);
		}
		else if(f){
			long long tt = L.query(M-i);
			tt *= M-i;
			tt /= 2;
			ans = max(ans,sum + tt);
		}
		if(Q.size()==0)break;
		if(i!=M){
			auto p = Q.top();
			Q.pop();
			sum += p.first;
			p.first += p.second;
			Q.push(p);
		}
	}
	cout<<ans<<endl;
	
	return 0;
}