// haha d & c go brr
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353
void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
if (sz(s))
{
freopen((s + ".in").c_str(), "r", stdin);
if (s != "test1")
freopen((s + ".out").c_str(), "w", stdout);
}
#endif
}
const int MAX = 3005;
int k, n, m, A, C, B, a[MAX], dp[MAX], c[MAX][MAX], ndp[MAX], idx;
ll T;
int get(int l, int r)
{
return c[idx][r - l];
}
void solve(int l, int r, int tl, int tr)
{
if (l > r)return;
int mid = (l + r) / 2;
pii best = { -inf,-1 };
FOR(k, tl, min(mid, tr) + 1)
{
best = max(best, { dp[k] + get(k,mid),k });
}
ndp[mid] = best.f;
int x = best.s;
solve(l, mid - 1, tl, x);
solve(mid + 1, r, x, tr);
}
int main()
{
setIO("test1");
cin >> k >> n >> m >> A >> C >> B >> T;
m -= n;
F0R(i, n)cin >> a[i], a[i]--;
F0R(i, n)fill(c[i], c[i] + m + 1, -inf);
F0R(i, n - 1)
{
ll t = T - (ll)C * a[i];
fill(c[i], c[i] + m + 1, -inf);
if (t < 0)continue;
int last = 0;
int l = 0;
F0R(j, m + 1)
{
l = last;
c[i][j] = last + t / A + 1;
last = c[i][j] - 1;
if (t < 0)
{
c[i][j] = -inf;
}
else
{
t -= (ll)B * (last + 1 - l);
if (t >= 0)last++;
c[i][j] = min(c[i][j], a[i + 1] - a[i]);
}
}
}
if (T >= C * a[n - 1])
fill(c[n - 1], c[n - 1] + m + 1, 1);
else
fill(c[n - 1], c[n - 1] + m + 1, -inf);
fill(dp, dp + m + 1, -inf);
F0R(j, m + 1)dp[j] = c[0][j];
fill(ndp, ndp + m + 1, -inf);
int ans = -inf;
F0R(i, n - 1)
{
idx = i + 1;
solve(0, m, 0, m);
F0R(j, m + 1)dp[j] = ndp[j], ndp[j] = -inf;
ans = max(ans, *max_element(dp, dp + m + 1));
}
cout << ans - 1 << endl;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
400 KB |
Output is correct |
| 2 |
Correct |
2 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
400 KB |
Output is correct |
| 2 |
Correct |
2 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
400 KB |
Output is correct |
| 2 |
Correct |
2 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
