Submission #2600015

---

Source Code Expand

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
//cout<<setprecision(20)
//cin.tie(0);
//ios::sync_with_stdio(false);
const llint mod=1000000007;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
llint LBI(vector<llint>&ar,llint in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
llint UBI(vector<llint>&ar,llint in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
	//祝日追加クエリを解けばよい
	llint y,w,n,m,d,i,j;cin>>y>>w>>n>>m>>d;
	vector<llint>A(n);
	vector<vector<llint>>B(w);
	for(i=0;i<n;i++){cin>>A[i];A[i]--;}
	for(i=0;i<m;i++){
		llint b,c;cin>>b>>c;b--;c--;
		B[c].pub(b);
	}
	multiset<llint>syu;
	syu.ins(-big);syu.ins(big);
	llint ans=0;
	for(i=0;i<w;i++){
		for(auto it:B[i]){
			llint in=it*w+i;
			llint mae=*prev(syu.upper_bound(in));
			llint ato=*syu.lower_bound(in);
			if(mae!=in&&in!=ato){
				ans++;
				if(in-mae-1<=d){ans+=in-mae-1;}
				if(ato-in-1<=d){ans+=ato-in-1;}
				if(ato-mae-1<=d){ans-=ato-mae-1;}
			}
			syu.ins(in);
		}
	}
	for(auto it:A){
		llint in=it;
		llint mae=*prev(syu.upper_bound(in));
		llint ato=*syu.lower_bound(in);
		if(mae!=in&&in!=ato){
			ans++;
			if(in-mae-1<=d){ans+=in-mae-1;}
			if(ato-in-1<=d){ans+=ato-in-1;}
			if(ato-mae-1<=d){ans-=ato-mae-1;}
		}
		syu.ins(in);
	}
	for(i=0;i<w;i++){
		cout<<ans<<endl;
		
		for(auto it:B[i]){
			llint in=it*w+i;
			syu.era(syu.lower_bound(in));//一つだけけす
			llint mae=*prev(syu.upper_bound(in));
			llint ato=*syu.lower_bound(in);
			if(mae!=in&&in!=ato){
				ans--;
				if(in-mae-1<=d){ans-=in-mae-1;}
				if(ato-in-1<=d){ans-=ato-in-1;}
				if(ato-mae-1<=d){ans+=ato-mae-1;}
			}
			
		}
		
		for(auto it:B[i]){
			llint in=(it+1)*w+i;
			llint mae=*prev(syu.upper_bound(in));
			llint ato=*syu.lower_bound(in);
			if(mae!=in&&in!=ato){
				ans++;
				if(in-mae-1<=d){ans+=in-mae-1;}
				if(ato-in-1<=d){ans+=ato-in-1;}
				if(ato-mae-1<=d){ans-=ato-mae-1;}
			}
			syu.ins(in);
		}
		for(auto it:A){
			llint in=it+i;
			syu.era(syu.lower_bound(in));//一つだけけす
			llint mae=*prev(syu.upper_bound(in));
			llint ato=*syu.lower_bound(in);
			if(mae!=in&&in!=ato){
				ans--;
				if(in-mae-1<=d){ans-=in-mae-1;}
				if(ato-in-1<=d){ans-=ato-in-1;}
				if(ato-mae-1<=d){ans+=ato-mae-1;}
			}
		}
		for(auto it:A){
			llint in=it+1+i;
			llint mae=*prev(syu.upper_bound(in));
			llint ato=*syu.lower_bound(in);
			if(mae!=in&&in!=ato){
				ans++;
				if(in-mae-1<=d){ans+=in-mae-1;}
				if(ato-in-1<=d){ans+=ato-in-1;}
				if(ato-mae-1<=d){ans-=ato-mae-1;}
			}
			syu.ins(in);
		}
	}
	return 0;
}

Submission Info

Judge Result