#806196 (C++17) No.409 ダイエット

提出ソース

結果

問題	No.409 ダイエット
ユーザー	heno239
提出日時	2022-10-12 10:05:09
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	51 ms / 2,000 ms
コード長	6,936 bytes
コンパイル時間	1,972 ms
コンパイル使用メモリ	155,788 KB
実行使用メモリ	29,544 KB
最終ジャッジ日時	2024-06-26 04:07:44
合計ジャッジ時間	7,432 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	13 ms 19,784 KB
testcase_01	AC	12 ms 19,784 KB
testcase_02	AC	13 ms 19,788 KB
testcase_03	AC	13 ms 19,912 KB
testcase_04	AC	14 ms 19,908 KB
testcase_05	AC	13 ms 19,912 KB
testcase_06	AC	13 ms 19,912 KB
testcase_07	AC	14 ms 20,040 KB
testcase_08	AC	13 ms 20,036 KB
testcase_09	AC	13 ms 19,912 KB
testcase_10	AC	14 ms 19,912 KB
testcase_11	AC	13 ms 19,784 KB
testcase_12	AC	14 ms 19,916 KB
testcase_13	AC	14 ms 19,908 KB
testcase_14	AC	13 ms 19,916 KB
testcase_15	AC	14 ms 19,916 KB
testcase_16	AC	13 ms 19,916 KB
testcase_17	AC	13 ms 19,780 KB
testcase_18	AC	12 ms 19,908 KB
testcase_19	AC	14 ms 19,780 KB
testcase_20	AC	13 ms 19,912 KB
testcase_21	AC	13 ms 19,912 KB
testcase_22	AC	13 ms 19,908 KB
testcase_23	AC	13 ms 19,912 KB
testcase_24	AC	13 ms 20,036 KB
testcase_25	AC	13 ms 19,784 KB
testcase_26	AC	13 ms 19,912 KB
testcase_27	AC	14 ms 19,912 KB
testcase_28	AC	13 ms 20,040 KB
testcase_29	AC	14 ms 19,784 KB
testcase_30	AC	14 ms 19,908 KB
testcase_31	AC	14 ms 19,916 KB
testcase_32	AC	14 ms 19,788 KB
testcase_33	AC	13 ms 19,784 KB
testcase_34	AC	13 ms 19,912 KB
testcase_35	AC	14 ms 20,044 KB
testcase_36	AC	13 ms 20,036 KB
testcase_37	AC	14 ms 20,040 KB
testcase_38	AC	13 ms 19,916 KB
testcase_39	AC	14 ms 20,172 KB
testcase_40	AC	14 ms 20,036 KB
testcase_41	AC	14 ms 20,036 KB
testcase_42	AC	14 ms 20,044 KB
testcase_43	AC	14 ms 20,040 KB
testcase_44	AC	13 ms 20,168 KB
testcase_45	AC	14 ms 20,044 KB
testcase_46	AC	14 ms 20,036 KB
testcase_47	AC	14 ms 20,040 KB
testcase_48	AC	14 ms 20,044 KB
testcase_49	AC	14 ms 19,912 KB
testcase_50	AC	14 ms 20,040 KB
testcase_51	AC	14 ms 20,040 KB
testcase_52	AC	13 ms 20,044 KB
testcase_53	AC	13 ms 20,040 KB
testcase_54	AC	13 ms 20,040 KB
testcase_55	AC	28 ms 23,964 KB
testcase_56	AC	35 ms 24,136 KB
testcase_57	AC	44 ms 29,364 KB
testcase_58	AC	27 ms 23,792 KB
testcase_59	AC	32 ms 24,724 KB
testcase_60	AC	25 ms 23,588 KB
testcase_61	AC	42 ms 27,912 KB
testcase_62	AC	42 ms 28,432 KB
testcase_63	AC	42 ms 28,748 KB
testcase_64	AC	28 ms 23,820 KB
testcase_65	AC	42 ms 25,984 KB
testcase_66	AC	44 ms 28,876 KB
testcase_67	AC	36 ms 27,672 KB
testcase_68	AC	32 ms 24,716 KB
testcase_69	AC	40 ms 29,440 KB
testcase_70	AC	44 ms 27,960 KB
testcase_71	AC	31 ms 23,896 KB
testcase_72	AC	51 ms 28,896 KB
testcase_73	AC	50 ms 29,544 KB
testcase_74	AC	36 ms 26,480 KB
testcase_75	AC	48 ms 28,920 KB
testcase_76	AC	40 ms 27,396 KB
testcase_77	AC	30 ms 22,816 KB
testcase_78	AC	34 ms 27,336 KB
testcase_79	AC	29 ms 23,624 KB
testcase_80	AC	50 ms 29,284 KB
testcase_81	AC	48 ms 28,108 KB
testcase_82	AC	40 ms 27,068 KB
testcase_83	AC	43 ms 27,688 KB
testcase_84	AC	37 ms 24,516 KB
testcase_85	AC	16 ms 20,424 KB
testcase_86	AC	36 ms 24,572 KB
testcase_87	AC	46 ms 28,992 KB
testcase_88	AC	26 ms 22,304 KB
testcase_89	AC	38 ms 23,364 KB
testcase_90	AC	25 ms 21,832 KB
testcase_91	AC	40 ms 23,472 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 21;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

struct CHT {
	vector<LP> v;
	vector<LP> memo;
	int l = 0;
	bool check(LP a, LP b, LP c) {
		//return __int128(b.first - a.first) * __int128(c.second - b.second) >= __int128(b.second - a.second) * __int128(c.first - b.first);
		return (b.first - a.first) * (c.second - b.second) >= (b.second - a.second) * (c.first - b.first);
	}
	//一気に作る
	void build(vector<LP> a) {
		l = 0;
		sort(a.begin(), a.end());
		per(i, (int)a.size()) {
			while (v.size() >= 2 && check(v[v.size() - 2], v[v.size() - 1], a[i]))v.pop_back();
			v.push_back(a[i]);
		}
	}
	//傾きが小さい順に追加して作る
	void build() {
		sort(all(memo));
		per(i, (int)memo.size()) {
			while (v.size() >= 2 && check(v[v.size() - 2], v[v.size() - 1], memo[i]))v.pop_back();
			v.push_back(memo[i]);
		}
		memo.clear();
	}
	void subadd(LP a) {
		memo.push_back(a);
	}
	void add(LP a) {
		if (v.size() && v.back().first == a.first && v.back().second < a.second)return;
		while (v.size() >= 2 && check(v[v.size() - 2], v[v.size() - 1], a))v.pop_back();
		v.push_back(a);
		l = min(l, (int)v.size() - 1);
	}
	//xは単調増加
	ll f(LP a, ll x) {
		return a.first * x + a.second;
	}
	ll query(ll x) {
		while (l + 1 < v.size() && f(v[l], x) > f(v[l + 1], x))l++;
		return f(v[l], x);
	}
};

void solve() {
	CHT cht;
	int n; ll a, b, w; cin >> n >> a >> b >> w;
	vector<ll> d(n);
	rep(i, n) {
		cin >> d[i];
	}
	a *= 2; b *= 2; w *= 2; rep(i, n)d[i] *= 2;
	vector<ll> dp(n+1, INF);
	dp[0] = w;
	rep(i, n+1) {
		LP adp;
		adp.first = -b * i;
		adp.second = dp[i] + b / 2 * i * i - b / 2 * i + i * a;
		cht.add(adp);
		ll val = cht.query(i);
		val += b / 2 * i * i + b / 2 * i - a * i;
		chmin(dp[i], val);
		if (i + 1 <= n) {
			chmin(dp[i + 1], dp[i] + d[i]);
		}
	}
	cout << dp[n]/2 << "\n";
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//while(true)
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード