oj.uz

Submission #805703

# Submission time Handle Problem Language Result Execution time Memory
805703 2023-08-03T20:56:46 Z kirakaminski968 Semiexpress (JOI17_semiexpress) C++17
100 / 100
 7 ms 344 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
    ll N,M,K; cin >> N >> M >> K;
    ll A,B,C; cin >> A >> B >> C;
    ll T; cin >> T;
    vector<ll> nxt(M,-1), stations(M);
    for(int i = 0;i<M;++i){
        cin >> stations[i];
        stations[i]--;
    }
    for(int i = 0;i<M;++i){
        if((T-stations[i]*B) >= 0) nxt[i] = (T-stations[i]*B)/A;
        else nxt[i] = -1;
        if(i != M-1) nxt[i] = min(nxt[i],stations[i+1]-stations[i]-1);
        else nxt[i] = min(0ll,nxt[i]);
        //cout << nxt[i] << "\n";
    }
    for(int i = 0;i<K-M;++i){
        ll maxn = 0, pos = -1;
        for(int j = 0;j<M-1;++j){
            if((T-stations[j]*B-(nxt[j]+1)*C) < 0) continue;
            ll cur = nxt[j]+1;
            ll cnt = (T-stations[j]*B-cur*C)/A+cur;
            cnt = min(cnt,stations[j+1]-stations[j]-1);
            if(cnt-cur+1 > maxn){
                maxn = cnt-cur+1;
                pos = j;
            }
        }
        if(maxn > 0){
            nxt[pos] += maxn;
            //cout << stations[pos] << " " << nxt[pos] << " " << maxn << "\n";
        }
    }
    ll ans = 0;
    for(int i = 0;i<M;++i){
        ans += nxt[i]+1;
    }
    cout << ans-1 << "\n";
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 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 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 296 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 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 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 296 KB Output is correct
19 Correct 2 ms 316 KB Output is correct
20 Correct 4 ms 308 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 2 ms 212 KB Output is correct
30 Correct 2 ms 212 KB Output is correct