oj.uz

답안 #722671

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722671 2023-04-12T14:39:14 Z Zanite Feast (NOI19_feast) C++17
100 / 100
 143 ms 12760 KB 
// 赤コーダーになりたい
// お願い いいですか？

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

// Pragmas
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Namespaces
using namespace std;
using namespace __gnu_pbds;

// Data types
using si	= short int;
using ll	= long long;
using lll	= __int128;
using ld	= long double;

// Pairs
using pii	= pair<int, int>;
using psi	= pair<si, si>;
using pll	= pair<ll, ll>;
using plll	= pair<lll, lll>;
using pld	= pair<ld, ld>;
#define fi	first
#define se	second

// For
#define Frue(i, n, N)		for (int i = (n); i <= (N); i++)
#define  Fru(i, n, N)		for (int i = (n); i <  (N); i++)
#define Frde(i, n, N)		for (int i = (n); i >= (N); i--)
#define  Frd(i, n, N)		for (int i = (n); i >  (N); i--)

// PBDS
template<typename Z>
using ordered_set	= tree<Z, null_type, less<Z>, rb_tree_tag, tree_order_statistics_node_update>;

// Various outputs
template<typename Y, typename Z> ostream& operator<<(ostream &os, const pair<Y, Z> &p) {
	return os << '(' << p.fi << ',' << p.se << ')';
}
template<typename Z> ostream& operator<<(ostream &os, const vector<Z> &v) {
	os << '{'; bool _first = 1;
	for (auto &i : v) {if (!_first) os << ", "; os << i; _first = 0;}
	return os << '}';
}
template<typename Z, unsigned long long sz> ostream& operator<<(ostream &os, const array<Z, sz> &arr) {
	os << '{'; bool _first = 1;
	for (auto &i : arr) {if (!_first) os << ", "; os << i; _first = 0;}
	return os << '}';
}

// Quick macro functions
#define sqr(x)			((x)*(x))
#define debug(x)		cout << #x << " = " << (x) << '\n'
#define debugV(v, x)	cout << #v << "[" << (x) << "] = " << (v[x]) << '\n'
#define rrebug(x)		cerr << #x << " = " << (x) << '\n'
#define rrebugV(v, x)	cerr << #v << "[" << (x) << "] = " << (v[x]) << '\n'

#define All(x)			x.begin(), x.end()
#define Sort(x)			sort(All(x))
#define Reverse(x)		reverse(All(x))
#define Uniqueify(x)	Sort(x); x.erase(unique(All(x)), x.end())

#define RandomSeed			chrono::steady_clock::now().time_since_epoch().count()
#define MultipleTestcases	int _tc; cin >> _tc; for (int _cur_tc = 1; _cur_tc <= _tc; _cur_tc++)

// Check min and max
template<typename Z> void chmin(Z &a, Z b) {a = min(a, b);}
template<typename Z> void chmax(Z &a, Z b) {a = max(a, b);}
 
// Modular arithmetic
template<int MOD>
class ModInt {
  public:
	int v;
	ModInt() : v(0) {}
	ModInt(long long _v) {
		v = int((-MOD < _v && _v < MOD) ? (_v) : (_v % MOD));
		if (v < 0) v += MOD;
	}
 
	friend bool operator==(const ModInt &a, const ModInt &b) {return a.v == b.v;}
	friend bool operator!=(const ModInt &a, const ModInt &b) {return a.v != b.v;}
	friend bool operator< (const ModInt &a, const ModInt &b) {return a.v <  b.v;}
	friend bool operator<=(const ModInt &a, const ModInt &b) {return a.v <= b.v;}
	friend bool operator> (const ModInt &a, const ModInt &b) {return a.v >  b.v;}
	friend bool operator>=(const ModInt &a, const ModInt &b) {return a.v >= b.v;}
 
	ModInt &operator+=(const ModInt &a) {if ((v += a.v) >= MOD) v -= MOD; return *this;}
	ModInt &operator-=(const ModInt &a) {if ((v -= a.v) < 0) v += MOD; return *this;}
	ModInt &operator*=(const ModInt &a) {v = 1ll * v * a.v % MOD; return *this;}
	ModInt &operator/=(const ModInt &a) {return (*this) *= inverse(a);}
 
	friend ModInt pow(ModInt a, long long x) {
		ModInt res = 1;
		for (; x; x /= 2, a *= a) if (x & 1) res *= a;
		return res;
	}
	friend ModInt inverse(ModInt a) {return pow(a, MOD - 2);}
 
	ModInt operator+ () const {return ModInt( v);}
	ModInt operator- () const {return ModInt(-v);}
	ModInt operator++() const {return *this += 1;}
	ModInt operator--() const {return *this -= 1;}
 
	friend ModInt operator+(ModInt a, const ModInt &b) {return a += b;}
	friend ModInt operator-(ModInt a, const ModInt &b) {return a -= b;}
	friend ModInt operator*(ModInt a, const ModInt &b) {return a *= b;}
	friend ModInt operator/(ModInt a, const ModInt &b) {return a /= b;}
 
	friend istream &operator>>(istream &is, ModInt &v) {return is >> v.v;}
	friend ostream &operator<<(ostream &os, const ModInt &v) {return os << v.v;}
};
const int ModA	= 998244353;
const int ModC	= 1e9 + 7;
using MintA	= ModInt<ModA>;
using MintC	= ModInt<ModC>;

// Other constants
const ll INF	= 1e18;
const ll iINF	= 1e9;
const ld EPS	= 1e-9;
const ld iEPS	= 1e-6;

const int maxN	= 3e5 + 5;
const ll maxA	= 1e9;

ll N, K, A[maxN], pf[maxN];
pll dp[maxN];

pll sub(pll x, pll y) {return {x.fi - y.fi, x.se - y.se};}

pll calc(ll C) {
	// debug(C);
	dp[0] = {0, 0};
	pll mx = {pf[N], 0};
	for (int i = 1; i <= N; i++) {
		dp[i] = max(
			dp[i-1],
			sub(mx, {pf[N] - pf[i] + C, -1})
		);
		chmax(mx, {dp[i].fi + pf[N] - pf[i], dp[i].se});
		// debugV(dp, i);
	}
	// debug(dp[N]);
	return dp[N];
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);

	cin >> N >> K;
	Frue(i, 1, N) {
		cin >> A[i];
		pf[i] = pf[i-1] + A[i];
	}

	// Find max(F) -> because F is convex, max(F) is G_0
	pll hmx = calc(0);
	// debug(hmx);
	if (hmx.se <= K) {
		cout << hmx.fi << '\n';
		return 0;
	}

	// Find max X s.t. dF(K) <= X
	// Binser on X
	ll l = -1ll * maxN * maxA, r = 1ll * maxN * maxA, ans, bt;
	while (l <= r) {
		ll m = (l + r) / 2;

		// Find max Y s.t. dF(Y) >= m
		pll Y = calc(m);
		if (Y.se < K) {
			r = m-1;
		} else {
			ans = m;
			bt = Y.fi + K * ans;
			l = m+1;
		}
	}
	cout << bt << '\n';
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 9532 KB Output is correct
2 Correct 88 ms 9604 KB Output is correct
3 Correct 85 ms 9816 KB Output is correct
4 Correct 83 ms 9764 KB Output is correct
5 Correct 82 ms 9592 KB Output is correct
6 Correct 82 ms 9544 KB Output is correct
7 Correct 86 ms 9548 KB Output is correct
8 Correct 82 ms 9728 KB Output is correct
9 Correct 78 ms 9436 KB Output is correct
10 Correct 80 ms 9660 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 9600 KB Output is correct
2 Correct 85 ms 9812 KB Output is correct
3 Correct 62 ms 9648 KB Output is correct
4 Correct 65 ms 9660 KB Output is correct
5 Correct 70 ms 9436 KB Output is correct
6 Correct 65 ms 9548 KB Output is correct
7 Correct 88 ms 9824 KB Output is correct
8 Correct 80 ms 9768 KB Output is correct
9 Correct 72 ms 9592 KB Output is correct
10 Correct 70 ms 9700 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 9600 KB Output is correct
2 Correct 124 ms 12464 KB Output is correct
3 Correct 114 ms 12584 KB Output is correct
4 Correct 91 ms 12356 KB Output is correct
5 Correct 98 ms 12580 KB Output is correct
6 Correct 98 ms 12668 KB Output is correct
7 Correct 129 ms 12752 KB Output is correct
8 Correct 110 ms 12576 KB Output is correct
9 Correct 103 ms 12644 KB Output is correct
10 Correct 96 ms 12588 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 372 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 9532 KB Output is correct
2 Correct 88 ms 9604 KB Output is correct
3 Correct 85 ms 9816 KB Output is correct
4 Correct 83 ms 9764 KB Output is correct
5 Correct 82 ms 9592 KB Output is correct
6 Correct 82 ms 9544 KB Output is correct
7 Correct 86 ms 9548 KB Output is correct
8 Correct 82 ms 9728 KB Output is correct
9 Correct 78 ms 9436 KB Output is correct
10 Correct 80 ms 9660 KB Output is correct
11 Correct 88 ms 9600 KB Output is correct
12 Correct 85 ms 9812 KB Output is correct
13 Correct 62 ms 9648 KB Output is correct
14 Correct 65 ms 9660 KB Output is correct
15 Correct 70 ms 9436 KB Output is correct
16 Correct 65 ms 9548 KB Output is correct
17 Correct 88 ms 9824 KB Output is correct
18 Correct 80 ms 9768 KB Output is correct
19 Correct 72 ms 9592 KB Output is correct
20 Correct 70 ms 9700 KB Output is correct
21 Correct 98 ms 9600 KB Output is correct
22 Correct 124 ms 12464 KB Output is correct
23 Correct 114 ms 12584 KB Output is correct
24 Correct 91 ms 12356 KB Output is correct
25 Correct 98 ms 12580 KB Output is correct
26 Correct 98 ms 12668 KB Output is correct
27 Correct 129 ms 12752 KB Output is correct
28 Correct 110 ms 12576 KB Output is correct
29 Correct 103 ms 12644 KB Output is correct
30 Correct 96 ms 12588 KB Output is correct
31 Correct 1 ms 320 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 324 KB Output is correct
49 Correct 1 ms 328 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 372 KB Output is correct
55 Correct 2 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 142 ms 12488 KB Output is correct
62 Correct 121 ms 12748 KB Output is correct
63 Correct 107 ms 12388 KB Output is correct
64 Correct 134 ms 12760 KB Output is correct
65 Correct 143 ms 12648 KB Output is correct
66 Correct 133 ms 12636 KB Output is correct
67 Correct 137 ms 12428 KB Output is correct
68 Correct 100 ms 12656 KB Output is correct
69 Correct 93 ms 12356 KB Output is correct
70 Correct 102 ms 12364 KB Output is correct