제출 #46812

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
46812		golub	Semiexpress (JOI17_semiexpress)	C++14	48 / 100	6 ms	2384 KiB

semiexpress

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("unroll-all-loops")

#include <bits/stdc++.h>

//#define TASK "lca"

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define pb push_back
#define int long long
#define pii pair<int, int>
#define len(x) (long long)x.size()

typedef long long ll;
//typedef long double ld;

using namespace std;

const int INF = 1e18;
const int MAXN = 1e8;
const int MOD = 1e9 + 7;
const double EPS = 1e-12;

const vector<int> dx = {1, 0, -1, 0, 0, 1, 0, -1};

//char buf[(int)1e9];
//size_t p_ = 0;
//
//inline void *operator new(size_t n_) {
//    p_ += n_;
//    return buf + p_ - n_;
//}
//inline void operator delete(void*) {};

ll power(ll x, ll n, ll mod = 1e9 + 7) {
    if (n == 0) return 1ll;
    if (n & 1ll) return power(x, n - 1ll, mod) * x % mod;
    ll tmp = power(x, n >> 1ll, mod);
    return (tmp * tmp) % mod;
}

ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd (b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

set<int> semiexpress;
set<pii, greater<pii>> active;

int A, B, C, T;
int n, m, k;

void try_add(int base_time, int l, int r) {
    if (l >= r || base_time > T || len(active) > 5 * k) return;
    int cnt = (T - base_time) / A;
    if (l + cnt >= r) {
        cnt = r - l - 1;
    }
    active.insert({cnt, l});
    base_time += (cnt + 1) * C;
    try_add(base_time, l + cnt + 1, r);
}

int solve(vector<int> s) {
    assert(len(s) <= k && len(s) >= m);
    int ans = 0;
    s.pb(n + 1);
    int cur_time = 0;
    int last_express_station = 0;
    for (int i = 0; i < len(s) - 1; i++) {
        if (semiexpress.count(s[i])) {
            cur_time = (last_express_station - 1) * B + (s[i] - last_express_station) * C;
        } else {
            last_express_station = s[i];
            cur_time = (last_express_station - 1) * B;
        }
        if (cur_time > T) continue;
        int cnt = (T - cur_time) / A;
        assert(cnt >= 0);
        if (s[i] + cnt >= s[i + 1]) {
            cnt = s[i + 1] - s[i] - 1;
        }
        assert(cnt >= 0);
        ans += cnt + 1;
    }
    return ans - 1;
}

signed main() {
#ifndef LOCAL
#ifdef TASK
    freopen(TASK".in", "r", stdin);
    freopen(TASK".out", "w", stdout);
#endif
#endif
#ifdef LOCAL
    //freopen("/Users/alekseygolub/Desktop/с++/ABS/ABS/input.txt", "r", stdin);
#endif
    iostream::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(924653523);
    // == SOLUTION == //
    cin >> n >> m >> k;
    cin >> A >> B >> C >> T;
    vector<int> s(m);
    for (auto &in: s) cin >> in;
    for (int i = 0; i < m; i++) {
        int base_time = (s[i] - 1) * B;
        if (i < m - 1)
            try_add(base_time, s[i], s[i + 1]);
        else
            try_add(base_time, s[i], n + 1);
        if (len(active) > 5 * k) break;
    }
    set<int> cur_station;
    for (auto x: s) cur_station.insert(x);
    for (auto x: active) {
        if (!cur_station.count(x.S)) {
            semiexpress.insert(x.S);
        }
        cur_station.insert(x.S);
        if (len(cur_station) == k) break;
    }
    int ans = solve(vector<int>(all(cur_station)));
    assert(ans >= 0);
    cout << ans << '\n';
    }

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