oj.uz

답안 #655163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
655163 2022-11-03T13:00:32 Z ParsaS Semiexpress (JOI17_semiexpress) C++14
100 / 100
 1 ms 464 KB 
// In the name of God
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
const int N = 2e5 + 5;
int n, m, k;
int A, B, C, S[N];
ll T;

void solve() {
    cin >> n >> m >> k;
    cin >> A >> B >> C;
    //assert(A > C && C > B);
    cin >> T;
    for (int i = 0; i < m; i++)
        cin >> S[i];
//    sort(S, S + m);
    k -= m;
    ll ans = -1;
    multiset<pair<pair<int, ll>, int> > st;
    for (int i = 0; i < m - 1; i++) {
        ll L = S[i], R = S[i + 1];
        ll need = 1LL * B * (S[i] - 1);
        if (need > T)
            break;
        ll cnt = min(R - L, (T - need) / A + 1);
        ans += cnt;
        need += 1LL * C * cnt;
        if (need > T)
            continue;
        //cout << i << ' ' << cnt << ' ' << min(R - (L + cnt), (T - need) / A + 1) << endl;
        st.insert(mp(mp(-min(R - (L + cnt), (T - need) / A + 1), T - need), R - (L + cnt)));
    }
    ans += 1LL * B * (n - 1) <= T;
    while (!st.empty() && k--) {
        pair<pair<int, ll>, int> p = *st.begin();
        st.erase(st.begin());
        ll L = -p.fi.fi, Tp = p.fi.se, len = p.se;
        ans += L;
        Tp -= 1LL * C * L;
        if (Tp < 0)
            continue;
        len -= L;
        L = min((ll)len, 1 + (Tp / A));
        if (L > 0) {
            st.insert(mp(mp(-L, Tp), len));
        }
    }
    cout << ans << '\n';
}
int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    solve();
    return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 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 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 464 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 332 KB Output is correct