题解

#include<cstdio>
#include<cmath>
#include<cstring>
unsigned long long n,m,c,k,x;
unsigned long long result=0;
unsigned long long ans=0;
unsigned long long p,q,tot=0;
bool visit[32768];
int main(){
	memset(visit,true,sizeof(visit));
	scanf("%llu %llu %llu %llu",&n,&m,&c,&k);
	for(int i=1;i<=n;i++){
		scanf("%llu",&x);
		result|=x;
	}
	for(int i=1;i<=m;i++){
		scanf("%llu %llu",&p,&q);
		if((result & 1ull<<p)!=(1ull<<p) && visit[p] ){
			visit[p]=false;
			tot++;
		}
	}
	if(k==64 && tot==0)printf("18446744073709551616");
	else printf("%llu",(1ull<<(k-tot))-n);
	return 0;
}