Submission #2599679

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define ALL(x) x.begin(),x.end()
#ifdef MAROON_LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr<<"reached"<<endl
#define DMP(x) cerr<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
#define ONE(x) memset(x,-1,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

ll read(){
	ll i;
	scanf("%" SCNd64,&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int d;

/*
struct SegTree{
	vi pos,cnt,lt,rt,sm;
	int s;
	SegTree(vi xs){
		int n=xs.size();
		s=1;
		while(s<n)s*=2;
		pos=xs;
		cnt.resize(s,0);
		lt.resize(s*2,-1);
		rt.resize(s*2,-1);
		sm.resize(s*2,0);
	}
	void UpdateNode(int i){
		sm[i]=sm[i*2]+sm[i*2+1];
		int a=rt[i*2],b=lt[i*2+1];
		if(a!=-1&&b!=-1&&b-a-1<=d)
			sm[i]+=b-a-1;
		lt[i]=(lt[i*2]!=-1?lt[i*2],lt[i*2+1]);
		rt[i]=(rt[i*2+1]!=-1?rt[i*2+1],rt[i*2]);
	}
	void Update(int i,int v){
		cnt[i]+=v;
		bool cur=cnt[i];
		int pos=pos[i];
		i+=s;
		if(cur){
			lt[i]=rt[i]=pos[i];
			sum[i]=1;
		}else{
			lt[i]=rt[i]=-1;
			sum[i]=0;
		}
		while((i>>=1))
			UpdateNode(i);
	}
	int Get(){
		return sm[1];
	}
};
* */

struct SegTree{
	vi pos;
	int Rng(int a,int b){
		a=pos[a];
		b=pos[b];
		if(b-a-1<=d)return b-a-1;
		else return 0;
	}
	int ans;
	multiset<signed> s;
	SegTree(vi xs){
		pos=xs;
		ans=0;
	}
	void Update(signed i,int v){
		if(v==1){
			auto itr=s.lower_bound(i);
			int a=-1,b=-1;
			if(itr!=s.end()){
				b=*itr;
				if(i==b){
					s.insert(itr,i);
					return;
				}
			}
			if(itr!=s.begin()){
				itr--;
				a=*itr;
				itr++;
			}
			if(a!=-1&&b!=-1)
				ans-=Rng(a,b);
			ans++;
			if(a!=-1)
				ans+=Rng(a,i);
			if(b!=-1)
				ans+=Rng(i,b);
			s.insert(itr,i);
		}else{
			auto itr=s.lower_bound(i);
			itr=s.erase(itr);
			int a=-1,b=-1;
			if(itr!=s.end()){
				b=*itr;
				if(b==i)return;
				ans-=Rng(i,b);
			}
			if(itr!=s.begin()){
				itr--;
				a=*itr;
				ans-=Rng(a,i);
			}
			ans--;
			if(a!=-1&&b!=-1)
				ans+=Rng(a,b);
		}
	}
	int Get(){
		return ans;
	}
};

signed main(){
	int y=read(),w=read();
	int n=read(),m=read();
	d=read();
	vi a(n);
	REP(i,n)
		a[i]=read()-1;
	vector<vi> waf(w);
	REP(i,m){
		int b=read()-1,c=read()-1;
		waf[c].PB(b);
	}
	
	vi pos;
	REP(i,w)for(auto x:a)
		pos.PB(i+x);
	
	REP(i,w)for(auto x:waf[i]){
		pos.PB(x*w+i);
		pos.PB((x+1)*w+i);
	}
	
	sort(ALL(pos));
	pos.erase(unique(ALL(pos)),pos.end());
	
	SegTree seg(pos);
	REP(i,w)for(auto x:waf[i]){
		int j=lower_bound(ALL(pos),x*w+i)-pos.begin();
		seg.Update(j,1);
	}
	
	vi ans(w);
	REP(i,w){
		for(auto x:a){
			int j=lower_bound(ALL(pos),x+i)-pos.begin();
			seg.Update(j,1);
		}
		ans[i]=seg.Get();
		for(auto x:a){
			int j=lower_bound(ALL(pos),x+i)-pos.begin();
			seg.Update(j,-1);
		}
		for(auto x:waf[i]){
			{
				int j=lower_bound(ALL(pos),x*w+i)-pos.begin();
				seg.Update(j,-1);
			}
			{
				int j=lower_bound(ALL(pos),(x+1)*w+i)-pos.begin();
				seg.Update(j,1);
			}
		}
	}
	REP(i,w)
		print(ans[i]);
}

Submission Info

Compile Error

./Main.cpp: In function ‘ll read()’:
./Main.cpp:55:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%" SCNd64,&i);
                      ^
./Main.cpp: In function ‘std::string readString()’:
./Main.cpp:77:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",buf);
                 ^
./Main.cpp: In function ‘char* readCharArray()’:
./Main.cpp:85:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",ret);
                 ^

Judge Result