Submission #1678023

---

Source Code Expand

#include<bits/stdc++.h>
#define N 400005
#define LL long long
#define L(__) (__ << 1)
#define R(__) (L(__)|1)
#define INF (1LL<<60)
using namespace std;
LL A[4*N],T[4*N],ans=INF;
int n,k,l[N],r[N],w[N],lw,a[N],b[N];
void B(int t,int l,int r)
{
	int mid=(l+r)>>1; T[t]=-INF;
	if(l==r){ A[t]=-w[l]; return ;}
	B(L(t),l,mid);
	B(R(t),mid+1,r);
	A[t]=min(A[L(t)],A[R(t)]);
}
void TA(int t,LL x){ T[t]=A[t]=x;}
void push(int t)
{
	if(T[t]==-INF) return ;
	TA(L(t),T[t]),TA(R(t),T[t]);
	T[t]=-INF;
}
void M(int t,int l,int r,int l1,int r1,LL x)
{
	int mid=(l+r)>>1;
	if(l>r1||r<l1||l>r) return ;
	if(l>=l1&&r<=r1) return TA(t,x);
	push(t);
	M(L(t),l,mid,l1,r1,x);
	M(R(t),mid+1,r,l1,r1,x);
	A[t]=min(A[L(t)],A[R(t)]);
}
LL Q(int t,int l,int r,int l1,int r1)
{
	int mid=(l+r)>>1; LL z=INF;
	if(l>r1||r<l1||l>r) return INF;
	if(l>=l1&&r<=r1) return A[t];
	push(t);
	z=min(z,Q(L(t),l,mid,l1,r1));
	z=min(z,Q(R(t),mid+1,r,l1,r1));
	A[t]=min(A[L(t)],A[R(t)]);
	return z;
}
int main()
{
	int i,p; LL z,e;
	scanf("%d %d",&n,&k),p=0;
	for(i=1;i<=n;i++){
		scanf("%d %d",&a[i],&b[i]);
		if(2*a[i]>k&&b[i]==1){ printf("-1"); exit(0);}
		if(b[i]==2) l[i]=k-1,r[i]=0;
		else r[i]=p,l[i]=(p-2*a[i]%k+k)%k;
		p=(p-2*a[i]%k+k)%k;
	  }
	for(i=1;i<=n;i++) w[++lw]=l[i],w[++lw]=r[i];
	sort(w+1,w+lw+1);
	lw=unique(w+1,w+lw+1)-w-1;
	for(i=1;i<=n;i++){
		l[i]=lower_bound(w+1,w+lw+1,l[i])-w;
		r[i]=lower_bound(w+1,w+lw+1,r[i])-w;
	  }
	B(1,1,lw);
	for(i=1;i<=n;i++){
		if(l[i]<r[i]){
			z=Q(1,1,lw,l[i]+1,r[i]-1);
			M(1,1,lw,l[i]+1,r[i]-1,INF);
			e=Q(1,1,lw,r[i],r[i]);
			if(z<e) M(1,1,lw,r[i],r[i],z);
		  }
		else{
			z=Q(1,1,lw,l[i]+1,lw);
			M(1,1,lw,l[i]+1,lw,INF);
			z=min(z+k,Q(1,1,lw,1,r[i]-1));
			M(1,1,lw,1,r[i]-1,INF);
			e=Q(1,1,lw,r[i],r[i]);
			if(z<e) M(1,1,lw,r[i],r[i],z);
		  }
	  }
	for(i=1;i<=lw;i++)
		ans=min(ans,Q(1,1,lw,i,i)+w[i]);
	for(i=1;i<=n;i++) ans+=a[i]*2;
	cout<<ans;
 	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:49:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&k),p=0;
                          ^
./Main.cpp:51:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&a[i],&b[i]);
                             ^

Judge Result