ZOJ3961-Let's Chat

Let's Chat

---

Time Limit: 1 Second       Memory Limit: 65536 KB

---

ACM (ACMers' Chatting Messenger) is a famous instant messaging software developed by Marjar Technology Company. To attract more users, Edward, the boss of Marjar Company, has recently added a new feature to the software. The new feature can be described as follows:

If two users, A and B, have been sending messages to each other on the last m consecutive days, the "friendship point" between them will be increased by 1 point.

More formally, if user A sent messages to user B on each day between the (i - m + 1)-th day and the i-th day (both inclusive), and user B also sent messages to user A on each day between the (i - m + 1)-th day and the i-th day (also both inclusive), the "friendship point" between A and B will be increased by 1 at the end of the i-th day.

Given the chatting logs of two users A and B during n consecutive days, what's the number of the friendship points between them at the end of the n-th day (given that the initial friendship point between them is 0)?

Input

There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 10), indicating the number of test cases. For each test case:

The first line contains 4 integers n (1 ≤ n ≤ 10⁹), m (1 ≤ m ≤ n), x and y (1 ≤ x, y ≤ 100). The meanings of n and m are described above, while x indicates the number of chatting logs about the messages sent by A to B, and y indicates the number of chatting logs about the messages sent by B to A.

For the following x lines, the i-th line contains 2 integers l_a, i and r_a, i (1 ≤ l_a, i ≤ r_a, i ≤ n), indicating that A sent messages to B on each day between the l_a, i-th day and the r_a, i-th day (both inclusive).

For the following y lines, the i-th line contains 2 integers l_b, i and r_b, i (1 ≤ l_b, i ≤ r_b, i ≤ n), indicating that B sent messages to A on each day between the l_b, i-th day and the r_b, i-th day (both inclusive).

It is guaranteed that for all 1 ≤ i < x, r_a, i + 1 < l_{a, i + 1} and for all 1 ≤ i < y, r_b, i + 1 < l_{b, i + 1}.

Output

For each test case, output one line containing one integer, indicating the number of friendship points between A and B at the end of the n-th day.

Sample Input

2
10 3 3 2
1 3
5 8
10 10
1 8
10 10
5 3 1 1
1 2
4 5

Sample Output

3
0

Hint

For the first test case, user A and user B send messages to each other on the 1st, 2nd, 3rd, 5th, 6th, 7th, 8th and 10th day. As m = 3, the friendship points between them will be increased by 1 at the end of the 3rd, 7th and 8th day. So the answer is 3.

---

Author:  WENG, Caizhi
Source:  The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple

题意：有两个人互相发消息，a在x个连续时间段里给b发消息，b在y个连续时间段里给a发消息，若两个人相互发消息连续时间大于等于m，则每天拿到一个友好点，问在n天内他们能拿到多少友好点

解题思路：模拟

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

struct node
{
	int l, r;
}a[105],b[105];
int n, m,x,y;

int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d%d%d%d", &n, &m, &x, &y);
		for (int i = 1; i <= x; i++) scanf("%d%d", &a[i].l, &a[i].r);
		for (int i = 1; i <= y; i++) scanf("%d%d", &b[i].l, &b[i].r);
		int ll = 1, rr = 1,ans=0;
		while (a[ll].r <= n&&b[rr].r <= n)
		{
			if (ll > x || rr > y) break;
			int mi = min(a[ll].r, b[rr].r);
			int ma = max(a[ll].l, b[rr].l);
			ans += max(mi - ma + 2-m,0);
			if (a[ll].r < b[rr].r) ll++;
			else if (a[ll].r > b[rr].r) rr++;
			else ll++, rr++;
		}
		printf("%d\n", ans);
	}
	return 0;
}