#include<bits/stdc++.h>
using namespace std;
#define int long long
struct Node{
int val, lazy;
Node (int _val=0){
val=_val, lazy=LLONG_MAX;
}
Node operator+(const Node &b){
return Node(val+b.val);
}
};
struct SegmentTree{
int n;
vector<Node> t;
void init(int _n){
n=_n;
t.assign(4*n+1, Node());
}
void apply(int k, int l, int r, int val){
t[k].val=val*(r-l+1);
t[k].lazy=val;
}
void push(int k, int l, int r){
if (t[k].lazy!=LLONG_MAX){
int mid=(l+r)>>1;
apply(k<<1, l, mid, t[k].lazy);
apply(k<<1|1, mid+1, r, t[k].lazy);
t[k].lazy=LLONG_MAX;
}
}
void update(int k, int l, int r, int L, int R, int val){
if (r<L || R<l) return;
if (L<=l && r<=R){
apply(k, l, r, val);
return;
}
push(k, l, r);
int mid=(l+r)>>1;
update(k<<1, l, mid, L, R, val);
update(k<<1|1, mid+1, r, L, R, val);
t[k]=t[k<<1]+t[k<<1|1];
}
Node get(int k, int l, int r, int L, int R){
if (r<L || R<l) return t[0];
if (L<=l && r<=R) return t[k];
push(k, l, r);
int mid=(l+r)>>1;
return get(k<<1, l, mid, L, R)+get(k<<1|1, mid+1, r, L, R);
}
} seg;
const int N=3e5+10, LG=19;
int n, d, a[N], b[N], cnt[N], pf[N], ans[N], sp[LG][N], pfc[N];
vector<pair<int, int>> v[N];
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> d;
for (int i=1; i<=n; ++i) cin >> a[i], b[i]=a[i];
for (int i=1, sum=0; i<=n; ++i){
b[i]-=sum;
int mod=(b[i]%d+d)%d;
b[i]-=mod;
sum+=mod;
cnt[i]=mod;
sp[0][i]=b[i];
b[i]/=d;
}
for (int k=1; k<LG; ++k) for (int i=1; i+(1<<k)-1<=n; ++i) sp[k][i]=min(sp[k-1][i], sp[k-1][i+(1<<(k-1))]);
partial_sum(b, b+n+1, pf);
partial_sum(cnt, cnt+n+1, pfc);
seg.init(n);
int q; cin >> q;
for (int i=1; i<=q; ++i){
int l, r; cin >> l >> r;
v[r].emplace_back(l, i);
}
stack<int> st;
for (int i=1; i<=n; ++i){
while (st.size() && b[i]<=b[st.top()]) st.pop();
seg.update(1, 1, n, st.empty()?1:st.top()+1, i, b[i]);
st.push(i);
for (auto &j:v[i]){
int l=j.first, id=j.second, r=i;
if (l==r){
ans[id]=0;
continue;
}
int lg=__lg(r-l);
int cnt_l=a[l]%d;
int min_val=min(sp[lg][l+1], sp[lg][r-(1<<lg)+1]);
if (min_val+pfc[l]<cnt_l) ans[id]=-1;
else{
int b_l=(a[l]-cnt_l)/d;
ans[id]=pf[r]-pf[l]-seg.get(1, 1, n, l+1, r).val+b_l-min(b_l, (min_val+pfc[l]-cnt_l)/d);
}
}
}
for (int i=1; i<=q; ++i) cout << ans[i] << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
21084 KB |
Output is correct |
2 |
Correct |
2 ms |
21084 KB |
Output is correct |
3 |
Correct |
3 ms |
27304 KB |
Output is correct |
4 |
Correct |
6 ms |
43868 KB |
Output is correct |
5 |
Correct |
6 ms |
43868 KB |
Output is correct |
6 |
Correct |
6 ms |
41820 KB |
Output is correct |
7 |
Correct |
7 ms |
41816 KB |
Output is correct |
8 |
Correct |
6 ms |
43868 KB |
Output is correct |
9 |
Correct |
6 ms |
43864 KB |
Output is correct |
10 |
Correct |
6 ms |
43868 KB |
Output is correct |
11 |
Correct |
6 ms |
43868 KB |
Output is correct |
12 |
Correct |
7 ms |
43868 KB |
Output is correct |
13 |
Correct |
7 ms |
43868 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
251 ms |
98412 KB |
Output is correct |
2 |
Correct |
231 ms |
98388 KB |
Output is correct |
3 |
Correct |
62 ms |
53076 KB |
Output is correct |
4 |
Correct |
160 ms |
98176 KB |
Output is correct |
5 |
Correct |
167 ms |
97572 KB |
Output is correct |
6 |
Correct |
206 ms |
97364 KB |
Output is correct |
7 |
Correct |
207 ms |
97940 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
103 ms |
56912 KB |
Output is correct |
2 |
Correct |
289 ms |
105700 KB |
Output is correct |
3 |
Correct |
278 ms |
105808 KB |
Output is correct |
4 |
Correct |
288 ms |
105172 KB |
Output is correct |
5 |
Correct |
277 ms |
105988 KB |
Output is correct |
6 |
Correct |
262 ms |
99404 KB |
Output is correct |
7 |
Correct |
280 ms |
98920 KB |
Output is correct |
8 |
Correct |
286 ms |
101932 KB |
Output is correct |
9 |
Correct |
266 ms |
102164 KB |
Output is correct |
10 |
Correct |
275 ms |
102996 KB |
Output is correct |
11 |
Correct |
260 ms |
102992 KB |
Output is correct |
12 |
Correct |
273 ms |
105040 KB |
Output is correct |
13 |
Correct |
281 ms |
104608 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
236 ms |
93264 KB |
Output is correct |
2 |
Correct |
262 ms |
98552 KB |
Output is correct |
3 |
Correct |
147 ms |
76024 KB |
Output is correct |
4 |
Correct |
247 ms |
102224 KB |
Output is correct |
5 |
Correct |
244 ms |
102480 KB |
Output is correct |
6 |
Correct |
247 ms |
105956 KB |
Output is correct |
7 |
Correct |
254 ms |
98128 KB |
Output is correct |
8 |
Correct |
285 ms |
105464 KB |
Output is correct |
9 |
Correct |
205 ms |
97876 KB |
Output is correct |
10 |
Correct |
169 ms |
97876 KB |
Output is correct |
11 |
Correct |
275 ms |
102224 KB |
Output is correct |
12 |
Correct |
217 ms |
101200 KB |
Output is correct |
13 |
Correct |
253 ms |
105040 KB |
Output is correct |
14 |
Correct |
156 ms |
100784 KB |
Output is correct |
15 |
Correct |
256 ms |
104928 KB |
Output is correct |
16 |
Correct |
177 ms |
101352 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
21084 KB |
Output is correct |
2 |
Correct |
2 ms |
21084 KB |
Output is correct |
3 |
Correct |
3 ms |
27304 KB |
Output is correct |
4 |
Correct |
6 ms |
43868 KB |
Output is correct |
5 |
Correct |
6 ms |
43868 KB |
Output is correct |
6 |
Correct |
6 ms |
41820 KB |
Output is correct |
7 |
Correct |
7 ms |
41816 KB |
Output is correct |
8 |
Correct |
6 ms |
43868 KB |
Output is correct |
9 |
Correct |
6 ms |
43864 KB |
Output is correct |
10 |
Correct |
6 ms |
43868 KB |
Output is correct |
11 |
Correct |
6 ms |
43868 KB |
Output is correct |
12 |
Correct |
7 ms |
43868 KB |
Output is correct |
13 |
Correct |
7 ms |
43868 KB |
Output is correct |
14 |
Correct |
251 ms |
98412 KB |
Output is correct |
15 |
Correct |
231 ms |
98388 KB |
Output is correct |
16 |
Correct |
62 ms |
53076 KB |
Output is correct |
17 |
Correct |
160 ms |
98176 KB |
Output is correct |
18 |
Correct |
167 ms |
97572 KB |
Output is correct |
19 |
Correct |
206 ms |
97364 KB |
Output is correct |
20 |
Correct |
207 ms |
97940 KB |
Output is correct |
21 |
Correct |
103 ms |
56912 KB |
Output is correct |
22 |
Correct |
289 ms |
105700 KB |
Output is correct |
23 |
Correct |
278 ms |
105808 KB |
Output is correct |
24 |
Correct |
288 ms |
105172 KB |
Output is correct |
25 |
Correct |
277 ms |
105988 KB |
Output is correct |
26 |
Correct |
262 ms |
99404 KB |
Output is correct |
27 |
Correct |
280 ms |
98920 KB |
Output is correct |
28 |
Correct |
286 ms |
101932 KB |
Output is correct |
29 |
Correct |
266 ms |
102164 KB |
Output is correct |
30 |
Correct |
275 ms |
102996 KB |
Output is correct |
31 |
Correct |
260 ms |
102992 KB |
Output is correct |
32 |
Correct |
273 ms |
105040 KB |
Output is correct |
33 |
Correct |
281 ms |
104608 KB |
Output is correct |
34 |
Correct |
236 ms |
93264 KB |
Output is correct |
35 |
Correct |
262 ms |
98552 KB |
Output is correct |
36 |
Correct |
147 ms |
76024 KB |
Output is correct |
37 |
Correct |
247 ms |
102224 KB |
Output is correct |
38 |
Correct |
244 ms |
102480 KB |
Output is correct |
39 |
Correct |
247 ms |
105956 KB |
Output is correct |
40 |
Correct |
254 ms |
98128 KB |
Output is correct |
41 |
Correct |
285 ms |
105464 KB |
Output is correct |
42 |
Correct |
205 ms |
97876 KB |
Output is correct |
43 |
Correct |
169 ms |
97876 KB |
Output is correct |
44 |
Correct |
275 ms |
102224 KB |
Output is correct |
45 |
Correct |
217 ms |
101200 KB |
Output is correct |
46 |
Correct |
253 ms |
105040 KB |
Output is correct |
47 |
Correct |
156 ms |
100784 KB |
Output is correct |
48 |
Correct |
256 ms |
104928 KB |
Output is correct |
49 |
Correct |
177 ms |
101352 KB |
Output is correct |
50 |
Correct |
272 ms |
105172 KB |
Output is correct |
51 |
Correct |
251 ms |
98900 KB |
Output is correct |
52 |
Correct |
277 ms |
102632 KB |
Output is correct |
53 |
Correct |
258 ms |
103504 KB |
Output is correct |
54 |
Correct |
271 ms |
105128 KB |
Output is correct |
55 |
Correct |
262 ms |
105552 KB |
Output is correct |
56 |
Correct |
167 ms |
101200 KB |
Output is correct |
57 |
Correct |
160 ms |
98104 KB |
Output is correct |
58 |
Correct |
180 ms |
98128 KB |
Output is correct |
59 |
Correct |
265 ms |
103664 KB |
Output is correct |
60 |
Correct |
187 ms |
101456 KB |
Output is correct |
61 |
Correct |
265 ms |
103408 KB |
Output is correct |
62 |
Correct |
282 ms |
100944 KB |
Output is correct |
63 |
Correct |
271 ms |
104884 KB |
Output is correct |
64 |
Correct |
187 ms |
101244 KB |
Output is correct |