codeforce-817E
# codeforces 817E
# The problem
E. Counting Rectangles
time limit per test6 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You have n rectangles, the i-th rectangle has height hi and width wi.
You are asked q queries of the form hs ws hb wb.
For each query output, the total area of rectangles you own that can fit a rectangle of height hs and width ws while also fitting in a rectangle of height hb and width wb. In other words, print ∑hi⋅wi for i such that hs<hi<hb and ws<wi<wb.
Please note, that if two rectangles have the same height or the same width, then they cannot fit inside each other. Also note that you cannot rotate rectangles.
Please note that the answer for some test cases won’t fit into 32-bit integer type, so you should use at least 64-bit integer type in your programming language (like long long for C++).Input
The first line of the input contains an integer t (1≤t≤100) — the number of test cases.
The first line of each test case two integers n,q (1≤n≤105; 1≤q≤105) — the number of rectangles you own and the number of queries.
Then n lines follow, each containing two integers hi,wi (1≤hi,wi≤1000) — the height and width of the i-th rectangle.
Then q lines follow, each containing four integers hs,ws,hb,wb (1≤hs<hb, ws<wb≤1000) — the description of each query.
The sum of q over all test cases does not exceed 105, and the sum of n over all test cases does not exceed 105.
Output
For each test case, output q lines, the i-th line containing the answer to the i-th query.Example
inputCopy
3
2 1
2 3
3 2
1 1 3 4
5 5
1 1
2 2
3 3
4 4
5 5
3 3 6 6
2 1 4 5
1 1 2 10
1 1 100 100
1 1 3 3
3 1
999 999
999 999
999 998
1 1 1000 1000
outputCopy
6
41
9
0
54
4
2993004