Submission #768717

#	Time	Username	Problem	Language	Result	Execution time	Memory
768717		bachhoangxuan	Semiexpress (JOI17_semiexpress)	C++17	18 / 100	1 ms	328 KiB

semiexpress

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,m,k,a,b,c,t;cin >> n >> m >> k >> a >> b >> c >> t;k-=m;
    vector<int> s(m);
    for(int i=0;i<m;i++) cin >> s[i];
    int ans=0;
    priority_queue<piii,vector<piii>,greater<piii>> pq;
    for(int i=0;i<m;i++){
        int d=b*(s[i]-1);
        if(t<d) break;
        else if(i==m-1){ans++;break;}
        int cnt=s[i+1]-s[i],cur=min((t-d)/a+1,cnt);
        int ss=t-(cur*c+d);ans+=cur;
        if(cur<cnt && ss>=0) pq.push({min(cnt-cur,ss/a+1),{i,s[i]+cur}});
    }
    while(k && !pq.empty()){
        piii x=pq.top();pq.pop();k--;
        int p=x.se.fi,cur=x.se.se+x.fi;ans+=x.fi;
        int ss=t-(b*(s[p]-1)+c*(cur-s[p]));
        if(cur<s[p+1] && ss>=0) pq.push({min(s[p+1]-cur,ss/a+1),{p,cur}});
    }
    cout << ans-1 << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

• Subtask 1: 18 / 18
• Subtask 2: 0 / 30
• Subtask 3: 0 / 52