oj.uz

답안 #702721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
702721 2023-02-24T22:57:58 Z stevancv Semiexpress (JOI17_semiexpress) C++14
100 / 100
 13 ms 4552 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e6 + 2;
const int inf = 2e9;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int m, k;
    ll n, a, b, c, t;
    cin >> n >> m >> k >> a >> b >> c >> t;
    vector<ll> v(m);
    for (int i = 0; i < m; i++) {
        cin >> v[i];
        v[i] -= 1;
    }
    ll ans = 0;
    vector<ll> o;
    for (int i = 0; i < m - 1; i++) {
        if (b * v[i] <= t) ans += 1;
        else break;
        ll nxt = (t + v[i] * (a - b)) / a + 1;
        ans += min(nxt, v[i + 1]) - v[i] - 1;
        for (int j = 0; j < k - m; j++) {
            if (nxt >= v[i + 1]) break;
            if (b * v[i] + c * (nxt - v[i]) > t) break;
            ll gde = (t - b * v[i] - c * (nxt - v[i]) + a * nxt) / a;
            smin(gde, v[i + 1] - 1);
            o.push_back(gde - nxt + 1);
            nxt = gde + 1;
        }
    }
    if (b * v.back() <= t) ans += 1;
    sort(o.rbegin(), o.rend());
    for (int i = 0; i < min((int) o.size(), k - m); i++)
        ans += o[i];
    cout << ans - 1 << en;
    return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 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 212 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 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 212 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 596 KB Output is correct
23 Correct 13 ms 4552 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 9 ms 4544 KB Output is correct
30 Correct 6 ms 2512 KB Output is correct