2014多校2（1002）hdu4872

来源：互联网发布：淘宝退货卡怎么填写编辑：程序博客网时间：2024/06/05 06:32

ZCC Loves COT

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 160 Accepted Submission(s): 43

Problem Description

After solves all problem of the series COT(count on a tree), ZCC feels bored and came up with a new COT problem, where letter T stands of Tetrahedron.
In this problem, Tetrahedron is define as a set of point:
T(n) = {(x, y, z) | 1≤z≤y≤x≤n}
Imagine T(n) is divided into n layers, the k-th layer contains k rows, of which the l-th row contains l points.
Moreover, we define sub-Tetrahedron a set of point, too:
sT(x, y, z, a) = {(x+i, y+j, z+k) | 0≤k≤j≤i＜a}
First of all, you are given a Tetrahedron T(N), every point of T(N) has a value of 0.
Then, you should deal with M operation (Mxi, Myi, Mzi, Mai), means you should add 1 to every point’s value if it belongs to sT(Mxi, Myi, Mzi, Mai).
Then, you should deal with Q queries (Qxi, Qyi, Qzi, Qai), you should output the sum of values of points in sT(Qxi, Qyi, Qzi, Qai).

Input

First line: three positive integer N, M, Q.(N≤100, M≤100000, Q≤100000)
Then followed M lines, each line contains four integers Mxi, Myi, Mzi, Mai, which describe an operation.
Then followed Q lines, each line contains four integers Qxi, Qyi, Qzi, Qai, which describe a query.

Output

For every query, output a line with one integer, the answer to the query.

Sample Input

2 1 21 1 1 21 1 1 22 1 1 1

Sample Output

41Hint
It is guaranteed, for every sT(x, y, z, a): 1≤z≤y≤x≤x+a-1≤N.
感谢LC大神提供的题解：http://blog.csdn.net/accelerator_916852/article/details/38133849

0 0