ZOJ Monthly, January 2019 Little Sub and his Geometry Problem 【推导 + 双指针】

传送门：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5861

Little Sub and his Geometry Problem

Time Limit: 4 Seconds Memory Limit: 65536 KB

Little Sub loves math very much, and has just come up with an interesting problem when he is working on his geometry homework.

It is very kind of him to share this problem with you. Please solve it with your coding and math skills. Little Sub says that even Mr.Potato can solve it easily, which means it won't be a big deal for you.

The problem goes as follows:

Given two integers and , and points with their Euclidean coordinates on a 2-dimensional plane. Different points may share the same coordinate.

Define the function

where

You are required to solve several queries.

In each query, one parameter is given and you are required to calculate the number of integer pairs such that and .

Input

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

The first line contains two positive integers and ().

For the following lines, the -th line contains two integers and (), indicating the coordinate of the -th point.

The next line contains an integer (), indicating the number of queries.

The following line contains integers (), indicating the parameters for each query.

It's guaranteed that at most 20 test cases has .

Output

For each test case, output the answers of queries respectively in one line separated by a space.

Please, DO NOT output extra spaces at the end of each line, or your answer may be considered incorrect!

Sample Input

Sample Output

2 3 4 1 2

5 11 5

题意概括：

N*N的大小的二维平面， M 个特殊点。

Q 次查询：查询到达特殊点距离总和为 Ci 的点的数量。

只有在特殊点的右上方的点才会产生距离。

解题思路：

过特殊点作斜率为 -1 的直线，发现这些线上的点到特殊点距离相等，也就是说同一X，只有一个点满足距离和为 Ci。

选择最左下角的点作为参考点（假设虚拟一个（0,0））。

那么平面上坐标为（x，y）的点所产生的距离和 C = (x+y)*cnt-sum；

其中 cnt 为该点左下方的特殊点个数，sum为这些特殊点到参考点的距离总和。

（也就是相当于 (x, y)到参考点的距离 - 特殊点 i 到参考点的距离 = (x,y)到特殊点的距离。）

很显然x，y具有线性关系，随着 x 增大 y 减小，每次查询遍历一遍 x 而 y 的值会随着 x 的增加而相应减少，总负责度 O（Q*N）约为 1e6;

AC code:

 #include <set>

 #include <map>

 #include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 #define INF 0x3f3f3f3f

 #define LL long long

 using namespace std;

 const int MAXN = 1e5+;

 struct Node

 {

     LL x, y;

 }node[MAXN];

 LL C[];

 bool cmp(Node a, Node b)

 {

     if(a.x != b.x) return a.x < b.x;

     else return a.y > b.y;

 }

 LL vis[MAXN];

 LL vis_sum[MAXN];

 int N, M, Q;

 int main()

 {

     int T_case;

     scanf("%d", &T_case);

     while(T_case--){

         scanf("%d %d", &N, &M);

         for(int i = ;  i <= M; i++){

             scanf("%lld %lld", &node[i].x, &node[i].y);

         }

         scanf("%d", &Q);

         for(int i = ; i <= Q; i++){

             scanf("%lld", &C[i]);

         }

         //sort(C+1, C+1+Q);

         sort(node+, node+M+, cmp);

         LL ty = N, tx = ;

         LL cnt = , sum = , ans = ;

         for(int i = ; i <= Q; i++){

             cnt = ; sum = ; ans = ;

             int top = ;

             memset(vis, , sizeof(vis));

             memset(vis_sum, , sizeof(vis_sum));

             tx = ;ty = N;

             while(tx <= N){

                 while(top+ <= M && node[top+].x <= tx){

                     top++;

                     if(node[top].y <= ty){

                         cnt++;

                         vis[node[top].y]++;

                         sum+=node[top].x+node[top].y;

                         vis_sum[node[top].y]+=tx;

                         //top++;

                     }

                     //else break;

                     //puts("zjy");

                 }

                 while(cnt*(tx+ty)-sum > C[i]){

                     cnt-=vis[ty];

                     sum-=(vis_sum[ty]+vis[ty]*ty);

                     ty--;

                 }

                 if(cnt*(tx+ty)-sum == C[i]) ans++;

                 tx++;

             }

             printf("%lld", ans);

             if(i < Q) printf(" ");

             else puts("");

         }

     }

     return ;

 }