CodeForces 469B Chat Online

最新推荐文章于 2022-12-15 01:22:28 发布

一只皮蛋呵

最新推荐文章于 2022-12-15 01:22:28 发布

阅读量544

点赞数

分类专栏： ACM 文章标签： codeforces

本文链接：https://blog.csdn.net/ALONENanGong/article/details/50504725

版权

ACM 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

CodeForces 469B Chat Online

Time Limit: 1000 MS Memory Limit: 262144 KB 64bit IO Format: %I64d & %I64u

Description

Little X and Little Z are good friends. They always chat online. But both of them have schedules.

Little Z has fixed schedule. He always online at any moment of time between a₁ and b₁, between a₂ and b₂, ..., between a_p and b_p (all borders inclusive). But the schedule of Little X is quite strange, it depends on the time when he gets up. If he gets up at time 0, he will be online at any moment of time between c₁ and d₁, between c₂ and d₂, ..., between c_q and d_q (all borders inclusive). But if he gets up at time t, these segments will be shifted by t. They become [c_i + t, d_i + t] (for all i).

If at a moment of time, both Little X and Little Z are online simultaneosly, they can chat online happily. You know that Little X can get up at an integer moment of time between l and r (both borders inclusive). Also you know that Little X wants to get up at the moment of time, that is suitable for chatting with Little Z (they must have at least one common moment of time in schedules). How many integer moments of time from the segment [l, r] suit for that?

Input

The first line contains four space-separated integers p, q, l, r (1 ≤ p, q ≤ 50; 0 ≤ l ≤ r ≤ 1000).

Each of the next p lines contains two space-separated integers a_i, b_i (0 ≤ a_i < b_i ≤ 1000). Each of the next q lines contains two space-separated integers c_j, d_j (0 ≤ c_j < d_j ≤ 1000).

It's guaranteed that b_i < a_i + 1 and d_j < c_j + 1 for all valid i and j.

Output

Output a single integer — the number of moments of time from the segment [l, r] which suit for online conversation.

Sample Input

Input

1 1 0 4
2 3
0 1

Output

Input

Output

#include<stdio.h>
#include<string.h>
int main(){
	int i,j,k,p,q,l,r,a,b,c,d,num,flag,s[2222],z[2222];
	while(scanf("%d%d%d%d",&p,&q,&l,&r)!=EOF){
		num=0;flag=1;
		memset(s,0,sizeof(s));
		memset(z,0,sizeof(z));
		for(i=0;i<p;i++){
			scanf("%d%d",&a,&b);
			for(j=a;j<=b;j++){
				s[j]=1;
			}
		}
		for(i=0;i<q;i++){
			scanf("%d%d",&c,&d);
			for(j=l;j<=r;j++){
				for(k=c+j;k<=d+j;k++){
					if(s[k]==1&&z[j]!=1){
						z[j]=1;
						num++;
						break;
					}
				}
			}
		}
		
		printf("%d\n",num);
	}
	return 0;
}