oj.uz

답안 #669775

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
669775 2022-12-07T09:05:30 Z ghostwriter Semiexpress (JOI17_semiexpress) C++14
48 / 100
 7 ms 12372 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { WHILE(b) { a = a % b; swap(a, b); } return a; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
const int oo = 2e9 + 5;
const int M = 3005;
int n, m, k, a, b, c, s[M], d[M][M], d1[M], d2[M][M];
ll t;
void input() {
	cin >> n >> m >> k;
    cin >> a >> b >> c;
    cin >> t;
    FOR(i, 1, m) cin >> s[i];
}
void solve() {
	s[m + 1] = s[m] + 1;
	FOR(i, 1, m) {
		int cur = s[i];
		ll minn = 1LL * (s[i] - 1) * b;
		FOR(j, 1, k - m + 2) {
			if (minn > t || cur >= s[i + 1]) break;
			ll pos = min((t - minn) / a + cur + 1, 1LL * s[i + 1]);
			d[i][j] = pos - s[i];
			minn += 1LL * (pos - cur) * c;
			cur = pos;
		}
		FOR(j, 1, k - m + 2) {
			if (!d[i][j]) break;
			d1[i] = j;
			if (d[i][j] == s[i + 1] - s[i]) break;
		}
	}
	FOS(i, m, 1)
	FOS(j, k - m, 0) {
		d2[i][j] = -oo;
		if (j > s[m] - s[i] - m + i) continue;
		d2[i][j] = 0;
		if (1LL * (s[i] - 1) * b > t) continue;
		if (j < d1[i] - 1) d2[i][j] = max(d2[i][j], d[i][j + 1] + d2[i + 1][0]);
		else {
			int ns = min(j - d1[i] + 1, s[m] - s[i + 1] + 1 - m + i);
			if (d[i][d1[i]] < s[i + 1] - s[i]) d2[i][j] = max(d2[i][j], d[i][d1[i]] + d2[i + 1][ns]);
			else {
				d2[i][j] = max(d2[i][j], d2[i + 1][ns] + s[i + 1] - s[i]);
				if (d1[i] > 1) d2[i][j] = max(d2[i][j], d2[i + 1][j - d1[i] + 2] + d[i][d1[i] - 1]);
			}
		}
	}
	cout << d2[1][k - m] - 1;
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    input();
    solve();
    return 0;
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 5 ms 9940 KB Output is correct
20 Correct 7 ms 12372 KB Output is correct
21 Correct 3 ms 6100 KB Output is correct
22 Incorrect 4 ms 8284 KB Output isn't correct
23 Halted 0 ms 0 KB -