oj.uz

Submission #253050

# Submission time Handle Problem Language Result Execution time Memory
253050 2020-07-26T18:48:41 Z Tuk1352 Semiexpress (JOI17_semiexpress) C++11
100 / 100
 39 ms 16864 KB 
#include <bits/stdc++.h>
using namespace std;

vector <long long> Ve;
int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    long long N, M, A, B, C, T, Su, k, Re=0;
    int K;
    cin >> N >> M >> K;
    K -= M;
    cin >> A >> B >> C >> T;
    long long S[M];
    cin >> S[0];
    for (int i = 1; i < M; i++)
    {
        cin >> S[i];
        Su = (S[i-1]-1)*B;
        if (Su <= T)
        {
            k = (T-Su) / A;
            long long ks = k+1, Mks=S[i]-S[i-1];
            Re += min(k+1, Mks);
            for (int y = 1; y <= K; y++)
            {
                if (Su + ks*C > T)
                {
                    break;
                }
                k = (T-Su-ks*C) / A;
                Ve.push_back(max(0ll, min(k+1, Mks-ks)));
                ks += k+1;
            }
        }
    }
    if ((S[M-1]-1)*B <= T)
    {
        Re++;
    }
    sort(Ve.rbegin(),Ve.rend());
    int VeS = Ve.size();
    for (int i = 0; i < min(K, VeS); i++)
    {
        Re += Ve[i];
    }
    cout << Re - 1;
    return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 640 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 3 ms 800 KB Output is correct
23 Correct 39 ms 16864 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 11 ms 4596 KB Output is correct
30 Correct 7 ms 2552 KB Output is correct