oj.uz

Submission #397067

# Submission time Handle Problem Language Result Execution time Memory
397067 2021-05-01T09:15:44 Z wildturtle Semiexpress (JOI17_semiexpress) C++14
100 / 100
 69 ms 19908 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll a,b,c,d,i,e,f,g,n,m,k,l,t,A[500005],l1,l2,ans,t1,t2;
multiset<ll> ms;
int main() {
    cin>>n>>m>>k;
    cin>>a>>b>>c;
    cin>>t;
    for(ll i=1;i<=m;i++) {
        cin>>A[i];
    }
    for(ll i=1;i<m;i++) {
        t1=t-b*(A[i]-1);
        if(t1<0) break;
        //cout<<i<<" "<<t-b*(A[i]-1)<<" ";
        l=min(A[i]+(t1/a),A[i+1]-1);
        ans+=(l-A[i]+1);
        if(i==1) ans--;
        //cout<<ans<<endl;
        f=1; l1=A[i]; l++; t2=t1;
        while(l<=A[i+1]-1 && f<=(k-m)) {
            t2-=c*(l-l1);
            if(t2<0) break;
            //cout<<l<<" "<<l1<<endl;
            l2=min(A[i+1]-1,l+(t2/a));
            ms.insert(-(l2-l+1));
            l1=l; l=l2+1;
            f++;
        }
    }
    if((A[m]-1)*b<=t) ans++;
    f=1;
    while(ms.size() && f<=(k-m)) {
        f++;
        ans-=*ms.begin();
        ms.erase(ms.find(*ms.begin()));
    }
    cout<<ans;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 4 ms 972 KB Output is correct
23 Correct 69 ms 19908 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 51 ms 13800 KB Output is correct
30 Correct 33 ms 8800 KB Output is correct