// 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<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int Bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
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;
int N,Q,D,A,B;
int L[maxn],R[maxn],dp[maxn];
int num[maxn],res[maxn];
vector<pii> qq[maxn];
void solve(){
cin >> N >> Q >> D >> A >> B;
for(int i=1;i<=N;i++) cin >> L[i] >> R[i];
L[N+1]=inf;
vector<pii> p;
deque<pii> dq;
dq.push_back({0,L[1]-1});
p.push_back({0,L[1]-1});
for(int i=1;i<=N;i++){
int l=R[i]+1-D,r=L[i+1]-1-D;
while(!dq.empty()){
if(dq.front().se<l) dq.pop_front();
else break;
}
if(!dq.empty()){
dp[i]=max(dq.front().fi,l)+D;
if(dp[i]<=r+D){
dq.push_back({dp[i],r+D});
p.push_back({dp[i],r+D});
}
}
else dp[i]=inf;
}
N=(int)p.size();
for(int i=0;i<N;i++){
L[i]=p[i].fi;
R[i]=p[i].se;
}
auto get_pos = [&](int x){
int l=0,r=N-1,pos=-1;
while(l<=r){
int mid=(l+r)>>1;
if(L[mid]<=x) pos=mid,l=mid+1;
else r=mid-1;
}
return pos;
};
if(A*D<=B){
for(int i=1;i<N;i++){
int pos=get_pos(L[i]-D);
num[i]=num[pos]+1;
}
for(int i=1;i<=Q;i++){
int X;cin >> X;
int pos=get_pos(X);
if(X>R[pos]) cout << -1 << '\n';
else cout << A*X+num[pos]*(B-A*D) << '\n';
}
}
else{
set<pii> ss;
ss.insert({0,0});
auto add = [&](int l,int r,int x){
//cout << "add " << l << ' ' << r << ' ' << x << '\n';
if(l>r) return;
auto it=ss.upper_bound({l,inf});it--;
while(it!=ss.end() && it->fi<=r){
int sl=it->fi,val=it->se;
it=ss.erase(it);
int sr=(it==ss.end()?D-1:it->fi-1);
if(sl<l) ss.insert({sl,val});
if(r<sr) ss.insert({r+1,val});
}
ss.insert({l,x});
};
for(int i=1;i<=Q;i++){
int X;cin >> X;
int pos=get_pos(X);
if(X>R[pos]) res[i]=-1;
else res[i]=A*X,qq[pos].push_back({X,i});
}
/*
for(int i=0;i<N;i++){
cout << L[i] << ' ' << R[i] << ' ';
cout << '\n';
}
*/
for(int i=0;i<N-1;i++) qq[i].push_back({R[i],-1});
for(int i=0;i<N;i++){
for(auto [x,id]:qq[i]){
//cout << x << ' ';
auto it=ss.upper_bound({x%D,inf});it--;
int val=it->se,cnt=(x/D)-val;x-=cnt*D;
int pos=get_pos(x-D);
if(pos>=0) cnt+=num[pos]+1;
//cout << x << ' ' << val << ' ' << id << ' ' << cnt << '\n';
if(id==-1) num[i]=cnt;
else res[id]+=cnt*(B-A*D);
}
if(i+1<N){
int l=R[i]+1,r=L[i+1]-1;
if(r-l+1>=D){
add(0,r%D,r/D+1);
add(r%D+1,D-1,r/D);
}
else{
if(l%D<=r%D) add(l%D,r%D,r/D+1);
else{
add(l%D,D-1,r/D);
add(0,r%D,r/D+1);
}
}
}
}
for(int i=1;i<=Q;i++) cout << res[i] << '\n';
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int test=1;//cin >> test;
while(test--) solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12892 KB |
Output is correct |
2 |
Correct |
2 ms |
12892 KB |
Output is correct |
3 |
Correct |
42 ms |
19028 KB |
Output is correct |
4 |
Correct |
69 ms |
18772 KB |
Output is correct |
5 |
Correct |
35 ms |
15700 KB |
Output is correct |
6 |
Correct |
36 ms |
15704 KB |
Output is correct |
7 |
Correct |
36 ms |
15696 KB |
Output is correct |
8 |
Correct |
133 ms |
30656 KB |
Output is correct |
9 |
Correct |
128 ms |
30712 KB |
Output is correct |
10 |
Correct |
86 ms |
22996 KB |
Output is correct |
11 |
Correct |
80 ms |
22500 KB |
Output is correct |
12 |
Correct |
101 ms |
22444 KB |
Output is correct |
13 |
Correct |
48 ms |
19696 KB |
Output is correct |
14 |
Correct |
62 ms |
18312 KB |
Output is correct |
15 |
Correct |
45 ms |
17268 KB |
Output is correct |
16 |
Correct |
59 ms |
22344 KB |
Output is correct |
17 |
Correct |
46 ms |
19660 KB |
Output is correct |
18 |
Correct |
45 ms |
19660 KB |
Output is correct |
19 |
Correct |
23 ms |
15024 KB |
Output is correct |
20 |
Correct |
26 ms |
19408 KB |
Output is correct |
21 |
Correct |
40 ms |
14932 KB |
Output is correct |
22 |
Correct |
34 ms |
16212 KB |
Output is correct |
23 |
Correct |
31 ms |
18388 KB |
Output is correct |
24 |
Correct |
28 ms |
19400 KB |
Output is correct |
25 |
Correct |
22 ms |
15192 KB |
Output is correct |
26 |
Correct |
48 ms |
19396 KB |
Output is correct |
27 |
Correct |
26 ms |
19668 KB |
Output is correct |
28 |
Correct |
29 ms |
19652 KB |
Output is correct |
29 |
Correct |
28 ms |
19680 KB |
Output is correct |
30 |
Correct |
30 ms |
19400 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
12892 KB |
Output is correct |
2 |
Correct |
2 ms |
12892 KB |
Output is correct |
3 |
Correct |
3 ms |
13148 KB |
Output is correct |
4 |
Correct |
5 ms |
13148 KB |
Output is correct |
5 |
Correct |
2 ms |
13016 KB |
Output is correct |
6 |
Correct |
2 ms |
12892 KB |
Output is correct |
7 |
Correct |
3 ms |
12892 KB |
Output is correct |
8 |
Correct |
3 ms |
12892 KB |
Output is correct |
9 |
Correct |
3 ms |
12892 KB |
Output is correct |
10 |
Correct |
3 ms |
12892 KB |
Output is correct |
11 |
Correct |
3 ms |
12956 KB |
Output is correct |
12 |
Correct |
5 ms |
13148 KB |
Output is correct |
13 |
Correct |
2 ms |
12892 KB |
Output is correct |
14 |
Correct |
2 ms |
12892 KB |
Output is correct |
15 |
Correct |
4 ms |
12892 KB |
Output is correct |
16 |
Correct |
2 ms |
12952 KB |
Output is correct |
17 |
Correct |
2 ms |
12892 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
15004 KB |
Output is correct |
2 |
Correct |
35 ms |
15184 KB |
Output is correct |
3 |
Correct |
5 ms |
12892 KB |
Output is correct |
4 |
Correct |
96 ms |
25832 KB |
Output is correct |
5 |
Correct |
97 ms |
24940 KB |
Output is correct |
6 |
Correct |
96 ms |
25448 KB |
Output is correct |
7 |
Correct |
126 ms |
25564 KB |
Output is correct |
8 |
Correct |
125 ms |
25280 KB |
Output is correct |
9 |
Correct |
101 ms |
25536 KB |
Output is correct |
10 |
Correct |
131 ms |
25540 KB |
Output is correct |
11 |
Correct |
99 ms |
26300 KB |
Output is correct |
12 |
Correct |
101 ms |
26304 KB |
Output is correct |
13 |
Correct |
107 ms |
25448 KB |
Output is correct |
14 |
Correct |
67 ms |
21868 KB |
Output is correct |
15 |
Correct |
65 ms |
21328 KB |
Output is correct |
16 |
Correct |
60 ms |
21372 KB |
Output is correct |
17 |
Correct |
114 ms |
25680 KB |
Output is correct |
18 |
Correct |
94 ms |
24768 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12892 KB |
Output is correct |
2 |
Correct |
2 ms |
12892 KB |
Output is correct |
3 |
Correct |
42 ms |
19028 KB |
Output is correct |
4 |
Correct |
69 ms |
18772 KB |
Output is correct |
5 |
Correct |
35 ms |
15700 KB |
Output is correct |
6 |
Correct |
36 ms |
15704 KB |
Output is correct |
7 |
Correct |
36 ms |
15696 KB |
Output is correct |
8 |
Correct |
133 ms |
30656 KB |
Output is correct |
9 |
Correct |
128 ms |
30712 KB |
Output is correct |
10 |
Correct |
86 ms |
22996 KB |
Output is correct |
11 |
Correct |
80 ms |
22500 KB |
Output is correct |
12 |
Correct |
101 ms |
22444 KB |
Output is correct |
13 |
Correct |
48 ms |
19696 KB |
Output is correct |
14 |
Correct |
62 ms |
18312 KB |
Output is correct |
15 |
Correct |
45 ms |
17268 KB |
Output is correct |
16 |
Correct |
59 ms |
22344 KB |
Output is correct |
17 |
Correct |
46 ms |
19660 KB |
Output is correct |
18 |
Correct |
45 ms |
19660 KB |
Output is correct |
19 |
Correct |
23 ms |
15024 KB |
Output is correct |
20 |
Correct |
26 ms |
19408 KB |
Output is correct |
21 |
Correct |
40 ms |
14932 KB |
Output is correct |
22 |
Correct |
34 ms |
16212 KB |
Output is correct |
23 |
Correct |
31 ms |
18388 KB |
Output is correct |
24 |
Correct |
28 ms |
19400 KB |
Output is correct |
25 |
Correct |
22 ms |
15192 KB |
Output is correct |
26 |
Correct |
48 ms |
19396 KB |
Output is correct |
27 |
Correct |
26 ms |
19668 KB |
Output is correct |
28 |
Correct |
29 ms |
19652 KB |
Output is correct |
29 |
Correct |
28 ms |
19680 KB |
Output is correct |
30 |
Correct |
30 ms |
19400 KB |
Output is correct |
31 |
Correct |
3 ms |
12892 KB |
Output is correct |
32 |
Correct |
2 ms |
12892 KB |
Output is correct |
33 |
Correct |
3 ms |
13148 KB |
Output is correct |
34 |
Correct |
5 ms |
13148 KB |
Output is correct |
35 |
Correct |
2 ms |
13016 KB |
Output is correct |
36 |
Correct |
2 ms |
12892 KB |
Output is correct |
37 |
Correct |
3 ms |
12892 KB |
Output is correct |
38 |
Correct |
3 ms |
12892 KB |
Output is correct |
39 |
Correct |
3 ms |
12892 KB |
Output is correct |
40 |
Correct |
3 ms |
12892 KB |
Output is correct |
41 |
Correct |
3 ms |
12956 KB |
Output is correct |
42 |
Correct |
5 ms |
13148 KB |
Output is correct |
43 |
Correct |
2 ms |
12892 KB |
Output is correct |
44 |
Correct |
2 ms |
12892 KB |
Output is correct |
45 |
Correct |
4 ms |
12892 KB |
Output is correct |
46 |
Correct |
2 ms |
12952 KB |
Output is correct |
47 |
Correct |
2 ms |
12892 KB |
Output is correct |
48 |
Correct |
22 ms |
15004 KB |
Output is correct |
49 |
Correct |
35 ms |
15184 KB |
Output is correct |
50 |
Correct |
5 ms |
12892 KB |
Output is correct |
51 |
Correct |
96 ms |
25832 KB |
Output is correct |
52 |
Correct |
97 ms |
24940 KB |
Output is correct |
53 |
Correct |
96 ms |
25448 KB |
Output is correct |
54 |
Correct |
126 ms |
25564 KB |
Output is correct |
55 |
Correct |
125 ms |
25280 KB |
Output is correct |
56 |
Correct |
101 ms |
25536 KB |
Output is correct |
57 |
Correct |
131 ms |
25540 KB |
Output is correct |
58 |
Correct |
99 ms |
26300 KB |
Output is correct |
59 |
Correct |
101 ms |
26304 KB |
Output is correct |
60 |
Correct |
107 ms |
25448 KB |
Output is correct |
61 |
Correct |
67 ms |
21868 KB |
Output is correct |
62 |
Correct |
65 ms |
21328 KB |
Output is correct |
63 |
Correct |
60 ms |
21372 KB |
Output is correct |
64 |
Correct |
114 ms |
25680 KB |
Output is correct |
65 |
Correct |
94 ms |
24768 KB |
Output is correct |
66 |
Correct |
160 ms |
33728 KB |
Output is correct |
67 |
Correct |
169 ms |
35160 KB |
Output is correct |
68 |
Correct |
204 ms |
33236 KB |
Output is correct |
69 |
Correct |
201 ms |
34236 KB |
Output is correct |
70 |
Correct |
107 ms |
26408 KB |
Output is correct |
71 |
Correct |
114 ms |
25532 KB |
Output is correct |
72 |
Correct |
95 ms |
24764 KB |
Output is correct |
73 |
Correct |
97 ms |
25120 KB |
Output is correct |
74 |
Correct |
171 ms |
34316 KB |
Output is correct |
75 |
Correct |
176 ms |
33956 KB |
Output is correct |
76 |
Correct |
88 ms |
24068 KB |
Output is correct |
77 |
Correct |
98 ms |
25960 KB |
Output is correct |
78 |
Correct |
67 ms |
21960 KB |
Output is correct |
79 |
Correct |
200 ms |
35172 KB |
Output is correct |
80 |
Correct |
208 ms |
35172 KB |
Output is correct |
81 |
Correct |
171 ms |
34748 KB |
Output is correct |
82 |
Correct |
197 ms |
34416 KB |
Output is correct |
83 |
Correct |
68 ms |
21588 KB |
Output is correct |
84 |
Correct |
64 ms |
21332 KB |
Output is correct |
85 |
Correct |
87 ms |
21072 KB |
Output is correct |
86 |
Correct |
63 ms |
21712 KB |
Output is correct |
87 |
Correct |
59 ms |
21108 KB |
Output is correct |