Gecko [ tsuru-no-tsurugi.tokyo ]

Name	Size	Permission	Date
a.cpp	2.89 KB	-rwxr-x---	2024-08-28 22:35
cerror.txt	0 B	-rwxr-x---	2024-08-28 22:35
error.txt	0 B	-rwxr-x---	2024-08-28 22:35
submit_info.txt	185 B	-rwxr-x---	2024-08-28 22:35

Rename

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
const ll mod=998244353;
const ld EPS=1e-8;
/*
const ll mod=1000000007;
//*/
struct dsu{
    private:
	vector<int>parent;
    public:
    dsu()=default;
	  dsu(size_t n):parent(n,-1){}
	  int leader(int i){
		    if(parent[i]<0)return i;
		    return parent[i]<0?i:(parent[i]=leader(parent[i]));
	  }
	  int merge(int a,int b){
		    a=leader(a);
		    b=leader(b);
		    if (a!=b){
			      if(-parent[a]<-parent[b])swap(a,b);
			      parent[a]+=parent[b];
			      parent[b]=a;
		    }
		    return a;
	  }
	  bool same(int a,int b){return leader(a)==leader(b);}
	  int size(int i){return -parent[leader(i)];}
	  vector<vector<int>>groups(){
	      size_t n=parent.size();
	      vector<vector<int>>A(n);
	      for(int i=0;i<n;i++)A[leader(i)].emplace_back(i);
	      vector<vector<int>>res;
	      for(auto a:A)if(a.size())res.emplace_back(a);
	      return res;
	  }
};
int main(){
  ll N,M,X,P;cin>>N>>M>>X>>P;
  vi B(N),T(M);cin>>B>>T;
  dsu D(M);
  REP(i,X){
    ll u,v;cin>>u>>v;
    D.merge(u-1,v-1);
  }
  auto g=D.groups();
  vi idx(M);
  ll L=sz(g);
  REP(i,L)for(auto v:g[i])idx[v]=i;
  set<ll>S;
  REP(i,N)REP(j,M)if(abs(B[i]-T[j])<=P)S.insert(idx[j]);
  cout<<sz(S)<<endl;
  return 0;
}