Submission #978811

#	Time	Username	Problem	Language	Result	Execution time	Memory
978811		MilosMilutinovic	Fish 3 (JOI24_fish3)	C++14	100 / 100	1398 ms	71108 KiB

Main

#include<bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
 
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
 
ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int n,q;
ll d,c[300005],a[300005],b[300005],val[300005],res[300005],sum[300005],mn[1200005],lzy[1200005],s[1200005],spref[300005];
int pref[300005];
vector<pii> qs[300005];

void pushdown(int id,int l,int r){
	if(lzy[id]==(ll)1e18||l==r) return;
	int mid=(l+r)/2;
	s[id<<1]=lzy[id]*(mid-l+1);
	s[id<<1|1]=lzy[id]*(r-mid);
	lzy[id<<1]=lzy[id];
	lzy[id<<1|1]=lzy[id];
	lzy[id]=(ll)1e18;
	return;
}

void build(int id,int l,int r){
	mn[id]=(ll)1e18;
	lzy[id]=(ll)1e18;
	s[id]=0;
	if(l==r) return;
	int mid=(l+r)/2;
	build(id<<1,l,mid);
	build(id<<1|1,mid+1,r);
	mn[id]=min(mn[id<<1],mn[id<<1|1]);
}

void change(int id,int l,int r,int ql,int qr,ll v){
	if(ql<=l&&r<=qr){
		s[id]=v*(r-l+1);
		lzy[id]=v;
		pushdown(id,l,r);
		return;
	}
	pushdown(id,l,r);
	int mid=(l+r)/2;
	if(qr<=mid) change(id<<1,l,mid,ql,qr,v);
	else if(ql>mid) change(id<<1|1,mid+1,r,ql,qr,v);
	else change(id<<1,l,mid,ql,qr,v),change(id<<1|1,mid+1,r,ql,qr,v);
	s[id]=s[id<<1]+s[id<<1|1];
}

ll query(int id,int l,int r,int ql,int qr){
	if(ql<=l&&r<=qr) return s[id];
	pushdown(id,l,r);
	int mid=(l+r)/2;
	ll ret;
	if(qr<=mid) ret=query(id<<1,l,mid,ql,qr);
	else if(ql>mid) ret=query(id<<1|1,mid+1,r,ql,qr);
	else ret=query(id<<1,l,mid,ql,qr)+query(id<<1|1,mid+1,r,ql,qr);
	s[id]=s[id<<1]+s[id<<1|1];
	return ret;
}

int main(){
	n=readint(); d=readint();
	for(int i=1;i<=n;i++) c[i]=readint();
	q=readint();
	for(int i=1;i<=q;i++){
		int l=readint(),r=readint();
		qs[r].pb(mp(l,i));
	}
	for(int i=1;i<=n;i++){
		a[i]=c[i]/d;
		b[i]=c[i]%d;
		sum[i]=sum[i-1]+a[i];
	}
	build(1,1,n);
	for(int i=2;i<=n;i++) pref[i]=pref[i-1]+(b[i]<b[i-1]?1:0);
	for(int i=2;i<=n;i++) spref[i]=spref[i-1]+pref[i];
	for(int i=1;i<=n;i++){
		int l=1,r=i,p=i;
		while(l<=r){
			int mid=(l+r)/2;
			if(query(1,1,n,mid,mid)+pref[mid]>a[i]-pref[i]+pref[mid]) p=mid,r=mid-1;
			else l=mid+1;
		}
		change(1,1,n,p,i,a[i]-pref[i]);
		for(auto p:qs[i]){
			if(query(1,1,n,p.fi,p.fi)+pref[p.fi]<0){
				res[p.se]=-1;
			}else{
				res[p.se]=sum[i]-sum[p.fi-1];
				res[p.se]-=query(1,1,n,p.fi,i);
				res[p.se]-=spref[i]-spref[p.fi-1];
			}
		}
	}
	for(int i=1;i<=q;i++) printf("%lld\n",res[i]);
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 7 / 7
• Subtask 3: 28 / 28
• Subtask 4: 20 / 20
• Subtask 5: 36 / 36