oj.uz

Submission #371216

# Submission time Handle Problem Language Result Execution time Memory
371216 2021-02-26T06:24:01 Z Plasmatic Semiexpress (JOI17_semiexpress) C++14
18 / 100
 1 ms 620 KB 
// ./joi-2017-final-p2----semiexpress.yml
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll INF = 0x3f3f3f3f, LLINF = 0x3f3f3f3f3f3f3f3f;

const int MM = 3011;
int N, M, K,
    ptr[MM];
ll A, B, C, T,
   gain[MM][MM], S[MM];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> N >> M >> K >> A >> B >> C >> T;
    for (int i = 0; i < M; i++) cin >> S[i];
    S[M] = N+1;
    K -= M;

    // calculate "gain" amount
    for (int i = 0; i < M; i++) {
        ll cur = S[i]-1;
        for (int j = 0; j <= K; j++) {
            ll init = (S[i]-1)*B + (cur+1-S[i])*C;
            if (init > T) break;
            ll nxt = min(cur+1 + (T-init) / A, S[i+1]-1);
            gain[i][j] = nxt - cur;
            cur = nxt;
        }
    }

    // init
    priority_queue<pair<ll, int>> pq;
    ll ans = -1; // subtract station 1
    for (int i = 0; i < M; i++)
        pq.emplace(gain[i][0], i);
    // greedy
    for (int i = 0; i < K+M; i++) {
        auto t = pq.top(); pq.pop();
        ans += t.first;
        if (ptr[t.second] <= K)
            pq.emplace(gain[t.second][++ptr[t.second]], t.second);
    }
    cout << ans << '\n';

    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Incorrect 1 ms 364 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Incorrect 1 ms 364 KB Output isn't correct
15 Halted 0 ms 0 KB -