#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
/*
refs:
edi
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
// https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/LineContainer.h
struct Line {
mutable ll k, m, p;
bool operator<(const Line& o) const { return k < o.k; }
bool operator<(ll x) const { return p < x; }
};
struct LineContainer : multiset<Line, less<>> {
// (for doubles, use inf = 1/.0, div(a,b) = a/b)
static const ll inf = LLONG_MAX;
ll div(ll a, ll b) { // floored division
return a / b - ((a ^ b) < 0 && a % b);
}
bool isect(iterator x, iterator y) {
if (y == end()) return x->p = inf, 0;
if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
else x->p = div(y->m - x->m, x->k - y->k);
return x->p >= y->p;
}
void add(ll k, ll m) {
k = -k, m = -m;
auto z = insert({k, m, 0}), y = z++, x = y;
while (isect(y, z)) z = erase(z);
if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
while ((y = x) != begin() && (--x)->p >= y->p)
isect(x, erase(y));
}
ll query(ll x) {
assert(!empty());
auto l = *lower_bound(x);
return -(l.k * x + l.m);
}
};
void solve(int test_case)
{
ll X,n,m,W,T; cin >> X >> n >> m >> W >> T;
vector<ll> a(n+1); // refilling points
rep(i,n) cin >> a[i];
a[n] = X;
n++;
auto cmp = [&](ll x, ll y){
return x%T < y%T;
};
sort(all(a),cmp);
vector<pll> b(m+1); // passengers
rep1(i,m) cin >> b[i].ff >> b[i].ss;
b[0] = {0,inf2};
sort(all(b));
m++;
vector<ll> dp(m,inf2); // dp[i] = min cost for [0..i] if i is the last alive guy
dp[0] = ((X-1)/T+1)*W;
vector<ll> dp2(m,inf2);
dp2[0] = dp[0];
vector<ll> mnv(m,inf2);
rep(i,m){
ll l = b[i].ff, r = inf2;
if(i+1 < m) r = b[i+1].ff;
rep(j,n){
if(l < a[j]%T and a[j]%T < r){
amin(mnv[i],(a[j]/T)*W);
}
}
}
vector<ll> p(m);
rep(i,m){
p[i] = b[i].ss;
if(i) p[i] += p[i-1];
}
LineContainer cht1,cht2;
cht1.add(0,dp2[0]+p[0]);
rep1(i,m-1){
auto [d,c] = b[i];
ll mul = mnv[i-1];
if(mul < inf2){
rev(j,i-1,0){
amin(dp[i],mul*(i-1)+p[i-1]+cht1.query(mul));
}
}
else{
ll j = i-1;
amin(dp[i],mul*(i-j-1)+dp2[j]+p[i-1]-p[j]);
}
if(mnv[i] < inf2){
rev(j,i-1,0){
amin(dp2[i],mnv[i]*(i-j)+dp2[j]+p[i]-p[j]);
}
}
ll times = (X-d-1)/T+1;
dp[i] += times*W;
amin(dp2[i],dp[i]);
cht1.add(-i,dp2[i]+p[i]);
}
ll ans = inf2;
rep(i,m){
ll smn = inf2;
ll cost = dp[i];
ll ptr = n-1;
rev(j,m-1,i+1){
while(ptr >= 0 and a[ptr]%T > b[j].ff){
amin(smn,a[ptr--]/T);
}
if(smn == inf2){
cost = inf2;
break;
}
cost += smn*W+b[j].ss;
}
amin(ans,cost);
}
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
