oj.uz

Submission #530513

# Submission time Handle Problem Language Result Execution time Memory
530513 2022-02-25T15:48:37 Z fadi57 Semiexpress (JOI17_semiexpress) C++14
100 / 100
 39 ms 33304 KB 
#include<bits/stdc++.h>
using namespace std;
const int mx=100006;
const int mx2=2e5+9;
typedef long long ll;
const int mod=998244353 ;
const long long inf=1e8+10;

   ll n,m,k;ll s[mx];

  int main(){

    cin>>n>>m>>k;

    ll a,b,c;cin>>a>>b>>c;

    ll t;cin>>t;ll ans=0;
        for(int i=0;i<m;i++){
            cin>>s[i];
            }
  if((n-1)*b<=t) ans++;
       priority_queue<ll>q;

       for(int i=0;i<m-1;i++){
          ll tim=(s[i]-1)*b;
          ll steps=(t-tim)/a;
        ll range=min(s[i]+steps,s[i+1]-1);
         if(tim>t){break;}
          ans+=(range-s[i]+1);
      //  cout<<range<<endl;
      if(i==0){ans--;}

        for(int j=0;j<k&&range<s[i+1]-1;j++){

           ll tim2=tim+(1+range-s[i])*c;

           if(tim2>t){break;}

           ll steps2=(t-tim2)/(a);

           ll range2=min(range+steps2+1,s[i+1]-1);
            q.push(range2-range);

           // cout<<range2<<" ";
            range=range2;

        }
     //cout<<endl;

       }
 for(int i=m;i<k;i++){

    if(!q.empty()){
        ans+=q.top();
        q.pop();
    }
 }

cout<<ans;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 304 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 300 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 3 ms 2496 KB Output is correct
22 Correct 3 ms 1476 KB Output is correct
23 Correct 12 ms 8684 KB Output is correct
24 Correct 10 ms 4480 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 28 ms 16820 KB Output is correct
28 Correct 39 ms 33304 KB Output is correct
29 Correct 10 ms 4540 KB Output is correct
30 Correct 3 ms 2496 KB Output is correct