A和B是好友,他们经常在空闲时间聊天,A的空闲时间为[a1 ,b1 ],[a2 ,b2 ]..[ap ,bp ]。B的空闲时间是[c1 +t,d1 +t]..[cq +t,dq +t],这里t为B的起床时间。这些时间包括了边界点。B的起床时间为[l,r]的一个时刻。若一个起床时间能使两人在任意时刻聊天,那么这个时间就是合适的,问有多少个合适的起床时间?
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while (cin.hasNext()) {
int p = cin.nextInt();
int q = cin.nextInt();
int l = cin.nextInt();
int r = cin.nextInt();
int a[] = new int[p];
int b[] = new int[p];
int c[] = new int[q];
int d[] = new int[q];
int flag[]=new int[r-l+1];
for (int i = 0; i < p; i++) {
a[i] = cin.nextInt();
b[i] = cin.nextInt();
}
for (int i = 0; i < q; i++) {
c[i] = cin.nextInt();
d[i] = cin.nextInt();
}
for (int i = 0; i < p; i++) {
int ai = a[i];
int bi = b[i];
for (int t = l; t <= r; t++) {
for (int j = 0; j < q; j++) {
int ci = c[j]+t;
int di = d[j]+t;
if (ci >= ai && ci <= bi
|| di >= ai && di <= bi
|| ai >= ci && ai <= di
|| bi >= ci && bi <= di) {
flag[t-l]=1;
}
}
}
}
int ans = 0;
for(int i=0;i<flag.length;i++){
if(flag[i]==1) ans++;
}
System.out.println(ans);
}
}
}