#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
using namespace std;
///~~~~~~~~~~~~~~~~~~~~~~~~~~
template <typename H, typename T>
ostream& operator<<(ostream& os, pair<H, T> m){
return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H>
ostream& operator<<(ostream& os, vector<H> V){
os<<"{";
for(int i=0; i<V.size(); i++){
if(i)os<<" ";
os<<V[i];
}
os<<"}";
return os;
}
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
//#define deb(x...) ;
///~~~~~~~~~~~~~~~~~~~~~~~~~
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int N=1<<19, INF=1e9+5, mod=1e9+7, mod2=998244353;
struct modint{
int n=0;
modint(){}
modint(ll x){
n=x%mod;
if(n<0)n+=mod;
}
operator int(){
return n;
}
modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
modint operator+=(modint a){return (*this)=(*this)+a;}
modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
modint operator-=(modint a){return (*this)=(*this)-a;}
modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
modint operator*=(modint a){return (*this)=(*this)*a;}
modint operator^(const ll &m)const{
modint a(1);
if(m==0)return a;
if(m==1)return (*this);
a=(*this)^(m/2);
a*=a;
return a*((*this)^(m&1));
}
modint odw(){
return (*this)^((ll)mod-2);
}
modint operator/(modint a){return (*this)*a.odw();}
modint operator/=(modint a){return (*this)=(*this)/a;}
bool operator==(modint a){return a.n==n;}
friend ostream& operator<<(ostream& os, modint m) {
return os << m.n;
}
};
modint fact[N], fact2[N];
typedef vector<modint> vm;
void factinit(){
fact[0]=1;
for(int i=1; i<N; i++){
fact[i]=(fact[i-1]*modint(i))%mod;
}
fact2[N-1]=fact[N-1].odw();
for(int i=N-2; i>=0; i--){
fact2[i]=(fact2[i+1]*modint(i+1))%mod;
}
}
modint npok(int _n, int _k){
return fact[_n]*fact2[_k]*fact2[_n-_k];
}
ll dp[N];
int fir[N], res[N], C[N];
ll pref[N];
int main(){
//factinit();
//BOOST;
ll x;
int n, m, w, t;
cin>>x>>n>>m>>w>>t;
vl V(n);
vii V2(m);
for(ll &i:V)cin>>i;
for(auto &i:V2)cin>>i.st>>i.nd;
sor(V);
sor(V2);
fir[0]=-1;
for(int i=0; i<m; i++){
res[i+1]=V2[i].st;
C[i+1]=V2[i].nd;
fir[i+1]=-1;
pref[i+1]=pref[i]+C[i+1];
}
V.pb(x);
for(int i=n; i>=0; i--){
fir[upper_bound(res, res+m+1, V[i]%t)-res-1]=i;
}
dp[0]=w*(x/t+1);
deb(dp[0]);
vector<pair<ll, ll> > V3;
vector<ld> opt;
opt.pb(0);
V3.eb(0, dp[0]);
for(int i=1; i<=m; i++){
dp[i]=dp[i-1]+w*ll((x-res[i])/t+1)-C[i];
//deb(i, dp[i]);
if(fir[i]+1){
dp[i]-=w*ll(V[fir[i]]/t)*i;
//for(int j=0; j<i; j++){dp[i]=min(dp[i], dp[j]-w*ll(V[fir[i]]/t)*j);}
int k=upper_bound(all(opt), V[fir[i]]/t)-opt.begin()-1;
dp[i]=min(dp[i], V3[k].st*(V[fir[i]]/t)+V3[k].nd);
dp[i]+=w*ll(V[fir[i]]/t)*i;
}
//deb(dp[i])
ll A=-i*ll(w), B=dp[i];
//deb(A, B);
while(V3.size()){
ll A2=V3.back().st, B2=V3.back().nd;
//deb(A2, B2);
if(A*opt.back()+B<A2*opt.back()+B2){
V3.pp();
opt.pp();
}
else{
ld y=(B2-B)/(A-A2);
opt.pb(y);
V3.eb(A, B);
break;
}
}
if(!V3.size()){
V3.eb(A, B);
opt.pb(0);
}
}
cout<<dp[m]+pref[m];
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
4436 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 4 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
4436 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
4436 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 4 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
4436 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
4436 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 4 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
4436 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
4436 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 4 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4436 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
4436 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
