Submission #854667

#	Time	Username	Problem	Language	Result	Execution time	Memory
854667		BrineTw	Semiexpress (JOI17_semiexpress)	C++14	0 / 100	1 ms	348 KiB

semiexpress

#pragma GCC optimize("O3")
#include <bits/stdc++.h>

#define debug(x) cerr << #x << ' ' << x << '\n'
#define endl '\n'

using namespace std;

const int M = 1e9 + 7;
typedef long long ll;

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    ll N, M, K;
    cin >> N >> M >> K;

    K -= M;

    ll A, B, C;
    cin >> A >> B >> C;

    ll limit;
    cin >> limit;

    vector<ll> exprs(M);
    for (auto& n: exprs) cin >> n, --n;
    
    vector<ll> v;
    ll ans = -1;
    for (int i = 0; i < M - 1; i++) {
        ll T = limit - B * exprs[i];
        if (T < 0) break;
        
        ll r = min(exprs[i] + T / A, exprs[i + 1] - 1);
        ans += r - exprs[i] + 1;
        
        for (int j = 0; j < K && r < exprs[i + 1] - 1; j++) {
            ll x = (T - (r + 1 - exprs[i]) * C < 0 ? r : r + 1);
            ll t = T - (x - exprs[i]) * C;
            
            ll nxtr = min(x + t / A, exprs[i + 1] - 1);
            v.push_back(nxtr - r);
            r = nxtr;
        }
    }
    
    sort(v.rbegin(), v.rend());

    for (int i = 0; i < K; i++) ans += v[i];

    if (B * exprs.back() <= limit) ans++;
    cout << ans << '\n';

    return 0;   
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 30
• Subtask 3: 0 / 52