#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define ldb long double
#define db double
#define fin(x) freopen(x,"r",stdin)
#define fout(x) freopen(x,"w",stdout)
#define fo(i,l,r) for(int i=(l);i<=(r);i++)
#define foi(i,l,r) for(int i=(l);i>=(r);i--)
#define el cout<<'\n';
#define cel cerr<<'\n';
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define gb(x,i) (((x)>>(i))&1)
#define mask(i) (1LL<<(i))
#define TIME (1.0 * clock()/CLOCKS_PER_SEC)
using namespace std;
const int N=3e5+5;
const int bl=60;
const ll base=1e9+7;
const ll inf=1e9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll Rand(ll l,ll r)
{
return l+(1ll*rng()*rng()%(r-l+1)+(r-l+1))%(r-l+1);
}
template<class X,class Y>bool maximize(X &a,Y b)
{
if(a<b) return a=b,true;
return false;
}
template<class X,class Y>bool minimize(X &a, Y b)
{
if(a>b) return a=b,true;
return false;
}
void add(auto &a,auto b)
{
a+=b;
if(a>=base) a-=base;
if(a<0) a+=base;
}
int n,q;
ll d,c[N],a[N],sum[N],ans[N];
stack<int>cc;
vector<ii>g[N];
ll st[4*N],lazy[4*N];
void push(int id,int l,int r,int mid)
{
ll &x=lazy[id];
if(!~x) return;
st[id<<1]=1LL*x*(mid-l+1);
st[id<<1|1]=1LL*x*(r-mid);
lazy[id<<1]=lazy[id<<1|1]=x;
x=-1;
}
void update(int id,int l,int r,int u,int v,ll val)
{
if(r<u or l>v) return;
if(u<=l and r<=v)
{
st[id]=1LL*(r-l+1)*val;
lazy[id]=val;
return;
}
int mid=(l+r)>>1;
push(id,l,r,mid);
update(id<<1,l,mid,u,v,val),update(id<<1|1,mid+1,r,u,v,val);
st[id]=st[id<<1]+st[id<<1|1];
}
ll get(int id,int l,int r,int u,int v)
{
if(r<u or l>v) return 0;
if(u<=l and r<=v) return st[id];
int mid=(l+r)>>1;
push(id,l,r,mid);
return get(id<<1,l,mid,u,v)+get(id<<1|1,mid+1,r,u,v);
}
int main()
{
#define task "o"
if(fopen(task".inp","r"))
{
fin(task".inp");
//fout(task".out");
}
srand(time(NULL));
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>d;
fo(i,1,n)
{
cin>>c[i];
a[i]=a[i-1]+((c[i]-c[i-1]%d)%d+d)%d;
sum[i]=sum[i-1]+c[i]-a[i];
}
cin>>q;
fo(i,1,q)
{
int l,r;
cin>>l>>r,g[r].pb({l,i});
}
memset(lazy,-1,sizeof(lazy));
fo(i,1,n)
{
while(cc.size() and c[cc.top()]-a[cc.top()]>=c[i]-a[i]) cc.pop();
int x=(cc.size()?cc.top()+1:1);
update(1,1,n,x,i,c[i]-a[i]),cc.push(i);
for(auto [l,id]:g[i])
{
if(get(1,1,n,l,l)+a[l]-c[l]%d<0) ans[id]=-1;
else ans[id]=(sum[i]-sum[l-1]-get(1,1,n,l,i))/d;
}
}
fo(i,1,q) cout<<ans[i],el
cerr<<"Time elapsed: "<<TIME<<" s.\n";
}
Compilation message
Main.cpp:41:10: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
41 | void add(auto &a,auto b)
| ^~~~
Main.cpp:41:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
41 | void add(auto &a,auto b)
| ^~~~
Main.cpp: In function 'int main()':
Main.cpp:112:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
112 | for(auto [l,id]:g[i])
| ^
Main.cpp:9:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
9 | #define fin(x) freopen(x,"r",stdin)
| ~~~~~~~^~~~~~~~~~~~~
Main.cpp:88:9: note: in expansion of macro 'fin'
88 | fin(task".inp");
| ^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
20960 KB |
Output is correct |
2 |
Correct |
3 ms |
21084 KB |
Output is correct |
3 |
Correct |
3 ms |
21084 KB |
Output is correct |
4 |
Correct |
5 ms |
21340 KB |
Output is correct |
5 |
Correct |
4 ms |
21340 KB |
Output is correct |
6 |
Correct |
5 ms |
21340 KB |
Output is correct |
7 |
Correct |
4 ms |
21084 KB |
Output is correct |
8 |
Correct |
4 ms |
21084 KB |
Output is correct |
9 |
Correct |
4 ms |
21220 KB |
Output is correct |
10 |
Correct |
5 ms |
21340 KB |
Output is correct |
11 |
Correct |
4 ms |
21340 KB |
Output is correct |
12 |
Correct |
5 ms |
21340 KB |
Output is correct |
13 |
Correct |
6 ms |
21308 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
304 ms |
47868 KB |
Output is correct |
2 |
Correct |
321 ms |
47168 KB |
Output is correct |
3 |
Correct |
79 ms |
30028 KB |
Output is correct |
4 |
Correct |
213 ms |
46776 KB |
Output is correct |
5 |
Correct |
215 ms |
46976 KB |
Output is correct |
6 |
Correct |
246 ms |
46672 KB |
Output is correct |
7 |
Correct |
251 ms |
46672 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
127 ms |
33920 KB |
Output is correct |
2 |
Correct |
301 ms |
54552 KB |
Output is correct |
3 |
Correct |
324 ms |
54612 KB |
Output is correct |
4 |
Correct |
306 ms |
54608 KB |
Output is correct |
5 |
Correct |
318 ms |
54612 KB |
Output is correct |
6 |
Correct |
287 ms |
48212 KB |
Output is correct |
7 |
Correct |
282 ms |
48148 KB |
Output is correct |
8 |
Correct |
300 ms |
51384 KB |
Output is correct |
9 |
Correct |
308 ms |
51280 KB |
Output is correct |
10 |
Correct |
288 ms |
51064 KB |
Output is correct |
11 |
Correct |
297 ms |
51028 KB |
Output is correct |
12 |
Correct |
311 ms |
53540 KB |
Output is correct |
13 |
Correct |
328 ms |
53588 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
268 ms |
42576 KB |
Output is correct |
2 |
Correct |
283 ms |
47884 KB |
Output is correct |
3 |
Correct |
205 ms |
37732 KB |
Output is correct |
4 |
Correct |
312 ms |
51320 KB |
Output is correct |
5 |
Correct |
293 ms |
53328 KB |
Output is correct |
6 |
Correct |
309 ms |
54356 KB |
Output is correct |
7 |
Correct |
298 ms |
48280 KB |
Output is correct |
8 |
Correct |
307 ms |
54320 KB |
Output is correct |
9 |
Correct |
228 ms |
47184 KB |
Output is correct |
10 |
Correct |
206 ms |
46776 KB |
Output is correct |
11 |
Correct |
335 ms |
51136 KB |
Output is correct |
12 |
Correct |
274 ms |
50256 KB |
Output is correct |
13 |
Correct |
319 ms |
54280 KB |
Output is correct |
14 |
Correct |
251 ms |
50084 KB |
Output is correct |
15 |
Correct |
315 ms |
54076 KB |
Output is correct |
16 |
Correct |
246 ms |
50004 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
20960 KB |
Output is correct |
2 |
Correct |
3 ms |
21084 KB |
Output is correct |
3 |
Correct |
3 ms |
21084 KB |
Output is correct |
4 |
Correct |
5 ms |
21340 KB |
Output is correct |
5 |
Correct |
4 ms |
21340 KB |
Output is correct |
6 |
Correct |
5 ms |
21340 KB |
Output is correct |
7 |
Correct |
4 ms |
21084 KB |
Output is correct |
8 |
Correct |
4 ms |
21084 KB |
Output is correct |
9 |
Correct |
4 ms |
21220 KB |
Output is correct |
10 |
Correct |
5 ms |
21340 KB |
Output is correct |
11 |
Correct |
4 ms |
21340 KB |
Output is correct |
12 |
Correct |
5 ms |
21340 KB |
Output is correct |
13 |
Correct |
6 ms |
21308 KB |
Output is correct |
14 |
Correct |
304 ms |
47868 KB |
Output is correct |
15 |
Correct |
321 ms |
47168 KB |
Output is correct |
16 |
Correct |
79 ms |
30028 KB |
Output is correct |
17 |
Correct |
213 ms |
46776 KB |
Output is correct |
18 |
Correct |
215 ms |
46976 KB |
Output is correct |
19 |
Correct |
246 ms |
46672 KB |
Output is correct |
20 |
Correct |
251 ms |
46672 KB |
Output is correct |
21 |
Correct |
127 ms |
33920 KB |
Output is correct |
22 |
Correct |
301 ms |
54552 KB |
Output is correct |
23 |
Correct |
324 ms |
54612 KB |
Output is correct |
24 |
Correct |
306 ms |
54608 KB |
Output is correct |
25 |
Correct |
318 ms |
54612 KB |
Output is correct |
26 |
Correct |
287 ms |
48212 KB |
Output is correct |
27 |
Correct |
282 ms |
48148 KB |
Output is correct |
28 |
Correct |
300 ms |
51384 KB |
Output is correct |
29 |
Correct |
308 ms |
51280 KB |
Output is correct |
30 |
Correct |
288 ms |
51064 KB |
Output is correct |
31 |
Correct |
297 ms |
51028 KB |
Output is correct |
32 |
Correct |
311 ms |
53540 KB |
Output is correct |
33 |
Correct |
328 ms |
53588 KB |
Output is correct |
34 |
Correct |
268 ms |
42576 KB |
Output is correct |
35 |
Correct |
283 ms |
47884 KB |
Output is correct |
36 |
Correct |
205 ms |
37732 KB |
Output is correct |
37 |
Correct |
312 ms |
51320 KB |
Output is correct |
38 |
Correct |
293 ms |
53328 KB |
Output is correct |
39 |
Correct |
309 ms |
54356 KB |
Output is correct |
40 |
Correct |
298 ms |
48280 KB |
Output is correct |
41 |
Correct |
307 ms |
54320 KB |
Output is correct |
42 |
Correct |
228 ms |
47184 KB |
Output is correct |
43 |
Correct |
206 ms |
46776 KB |
Output is correct |
44 |
Correct |
335 ms |
51136 KB |
Output is correct |
45 |
Correct |
274 ms |
50256 KB |
Output is correct |
46 |
Correct |
319 ms |
54280 KB |
Output is correct |
47 |
Correct |
251 ms |
50084 KB |
Output is correct |
48 |
Correct |
315 ms |
54076 KB |
Output is correct |
49 |
Correct |
246 ms |
50004 KB |
Output is correct |
50 |
Correct |
365 ms |
54568 KB |
Output is correct |
51 |
Correct |
329 ms |
48208 KB |
Output is correct |
52 |
Correct |
331 ms |
51284 KB |
Output is correct |
53 |
Correct |
319 ms |
51028 KB |
Output is correct |
54 |
Correct |
309 ms |
53520 KB |
Output is correct |
55 |
Correct |
340 ms |
54396 KB |
Output is correct |
56 |
Correct |
220 ms |
50004 KB |
Output is correct |
57 |
Correct |
215 ms |
46848 KB |
Output is correct |
58 |
Correct |
209 ms |
46884 KB |
Output is correct |
59 |
Correct |
338 ms |
52308 KB |
Output is correct |
60 |
Correct |
209 ms |
50004 KB |
Output is correct |
61 |
Correct |
290 ms |
51024 KB |
Output is correct |
62 |
Correct |
318 ms |
49844 KB |
Output is correct |
63 |
Correct |
311 ms |
53328 KB |
Output is correct |
64 |
Correct |
208 ms |
50112 KB |
Output is correct |