CF1722E.Counting Rectangles

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You have nn rectangles, the ii -th rectangle has height hih_i and width wiw_i .

You are asked qq queries of the form hs ws hb wbh_s \ w_s \ h_b \ w_b .

For each query output, the total area of rectangles you own that can fit a rectangle of height hsh_s and width wsw_s while also fitting in a rectangle of height hbh_b and width wbw_b . In other words, print hiwi\sum h_i \cdot w_i for ii such that hs<hi<hbh_s < h_i < h_b and ws<wi<wbw_s < w_i < w_b .

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++).

输入格式

The first line of the input contains an integer tt ( 1t1001 \leq t \leq 100 ) — the number of test cases.

The first line of each test case two integers n,qn, q ( 1n1051 \leq n \leq 10^5 ; 1q1051 \leq q \leq 10^5 ) — the number of rectangles you own and the number of queries.

Then nn lines follow, each containing two integers hi,wih_i, w_i ( 1hi,wi10001 \leq h_i, w_i \leq 1000 ) — the height and width of the ii -th rectangle.

Then qq lines follow, each containing four integers hs,ws,hb,wbh_s, w_s, h_b, w_b ( 1hs<hb, ws<wb10001 \leq h_s < h_b,\ w_s < w_b \leq 1000 ) — the description of each query.

The sum of qq over all test cases does not exceed 10510^5 , and the sum of nn over all test cases does not exceed 10510^5 .

输出格式

For each test case, output qq lines, the ii -th line containing the answer to the ii -th query.

输入输出样例

  • 输入#1

    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

    输出#1

    6
    41
    9
    0
    54
    4
    2993004

说明/提示

In the first test case, there is only one query. We need to find the sum of areas of all rectangles that can fit a 1×11 \times 1 rectangle inside of it and fit into a 3×43 \times 4 rectangle.

Only the 2×32 \times 3 rectangle works, because 1<21 < 2 (comparing heights) and 1<31 < 3 (comparing widths), so the 1×11 \times 1 rectangle fits inside, and 2<32 < 3 (comparing heights) and 3<43 < 4 (comparing widths), so it fits inside the 3×43 \times 4 rectangle. The 3×23 \times 2 rectangle is too tall to fit in a 3×43 \times 4 rectangle. The total area is 23=62 \cdot 3 = 6 .

首页