제출 #365213

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
365213		farhan132	Semiexpress (JOI17_semiexpress)	C++17	100 / 100	8 ms	4580 KiB

semiexpress

/***Farhan132***/

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vi;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll)1e9 + 7;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};


ll s[maxn] , n , m , k , a , b , c , t;
ll ans = 0;

void solve(){

    cin >> n >> m >> k >> a >> b >> c >> t;
    f1(m) cin >> s[i];
    priority_queue < ll > p;
    k = k - m;
    for(ll i = 2; i <= m; i++){
        ll cost = (s[i-1] - 1) * b;
        if(cost > t) break;
        ll rem = t - (s[i-1] - 1) * b;
        ll x = rem/a;
        ll cur = s[i-1];
        ll r = min(s[i] - 1, cur + x);
        ans += r - cur + 1;
        ll cnt = 0;
        cur = r+1;
        while(cnt <= k && cur < s[i]){
            cost = (s[i-1] - 1)*b + (cur - s[i-1])*c;
            if(cost > t) break;
            rem = t - cost;
            ll x = rem/a;
            ll r = min(s[i] - 1, cur + x);
            p.push(r - cur + 1);
            cur = r + 1;
            cnt++;
        }
    }
    if((n-1)*b <= t) ans++;
    f1(k){
        if(!p.size()) break;
        ans += p.top();
        p.pop();
    }
    cout << ans - 1;

    return;
    
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #else 
     //   freopen("cbarn2.in", "r", stdin);
     //   freopen("cbarn2.out", "w", stdout);
     ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
    //cout << fixed << setprecision(10);
   // work(maxn);
    //  mem(b,0);
    ll T;
    T=1;
    //cin >> T; 
    //scanf("%lld",&T);
   // ll CT = 0;
    //work();
    while(T--){
        //cout << "Case " << ++CT <<": " ;
        //printf("Case %lld: ",++CT);
        solve();
    }
 
    return 0;
}

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