Codeforces 975D 计算几何

最新推荐文章于 2024-02-03 20:14:52 发布

「已注销」

最新推荐文章于 2024-02-03 20:14:52 发布

阅读量489

点赞数

本文链接：https://blog.csdn.net/PiscesCrab/article/details/80471513

版权

Ghosts live in harmony and peace, they travel the space without any purpose other than scare whoever stands in their way.

There are $n$ ghosts in the universe, they move in the $O X Y$ plane, each one of them has its own velocity that does not change in time: $\to V = V_{x} \to i + V_{y} \to j$ where $V_{x}$ is its speed on the $x$ -axis and $V_{y}$ is on the $y$ -axis.

A ghost $i$ has experience value $E X_{i}$ , which represent how many ghosts tried to scare him in his past. Two ghosts scare each other if they were in the same cartesian point at a moment of time.

As the ghosts move with constant speed, after some moment of time there will be no further scaring (what a relief!) and the experience of ghost kind $G X = \sum_{i = 1}^{n} E X_{i}$ will never increase.

Tameem is a red giant, he took a picture of the cartesian plane at a certain moment of time $T$ , and magically all the ghosts were aligned on a line of the form $y = a \cdot x + b$ . You have to compute what will be the experience index of the ghost kind $G X$ in the indefinite future, this is your task for today.

Note that when Tameem took the picture, $G X$ may already be greater than $0$ , because many ghosts may have scared one another at any moment between $[- \infty, T]$ .

Input

The first line contains three integers $n$ , $a$ and $b$ ( $1 \leq n \leq 200000$ , $1 \leq | a | \leq 10^{9}$ , $0 \leq | b | \leq 10^{9}$ ) — the number of ghosts in the universe and the parameters of the straight line.

Each of the next $n$ lines contains three integers $x_{i}$ , $V_{x i}$ , $V_{y i}$ ( $- 10^{9} \leq x_{i} \leq 10^{9}$ , $- 10^{9} \leq V_{x i}, V_{y i} \leq 10^{9}$ ), where $x_{i}$ is the current $x$ -coordinate of the $i$ -th ghost (and $y_{i} = a \cdot x_{i} + b$ ).

It is guaranteed that no two ghosts share the same initial position, in other words, it is guaranteed that for all $(i, j)$ $x_{i} \neq x_{j}$ for $i \neq j$ .

Output

Output one line: experience index of the ghost kind $G X$ in the indefinite future.

   Examples 
 

     input 
    
      Copy 
    
4 1 1
1 -1 -1
2 1 1
3 1 1
4 -1 -1

     output 
    
      Copy 
    
8

     input 
    
      Copy 
    
3 1 0
-1 1 0
0 0 -1
1 -1 -2

     output 
    
      Copy 
    
6

     input 
    
      Copy 
    
3 1 0
0 0 0
1 0 0
2 0 0

     output 
    
      Copy 
    
0

Note

There are four collisions $(1, 2, T - 0.5)$ , $(1, 3, T - 1)$ , $(2, 4, T + 1)$ , $(3, 4, T + 0.5)$ , where $(u, v, t)$ means a collision happened between ghosts $u$ and $v$ at moment $t$ . At each collision, each ghost gained one experience point, this means that $G X = 4 \cdot 2 = 8$ .

In the second test, all points will collide when $t = T + 1$ .

大致题意：给出N个点（每个点均在直线y=ax+b上）和每个点前进的速度/方向，求能遇见多少次。

解法：推公式，由于起始点为(xi,axi+b)，若i,j能相遇，则应满足(xi+t*vxi = xj+t*vxj, (a*xi+b) + t*vyi = (a*xj+b)+t*vyj)

该公式化简后可发现，能否相遇仅与a*vx-vy的值有关。该值相等，则两个点可相交。

注意，需要处理平行的情况(vxi = vxj,vyi = vyj)

代码如下：

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll n,a,b,ans,para;
map<long long,int> m;
map< pair<int,int>,int> p;
int x,Vx,Vy;

int main()
{
    cin>>n>>a>>b;
    for(int i=1; i<=n; i++){

        scanf("%d%d%d",&x,&Vx,&Vy);
        ll key = a*Vx-Vy;
        ans += m[key];
        m[a*Vx-Vy]++;
        para += p[make_pair(Vx,Vy)];
        p[make_pair(Vx,Vy)]++;
    }
    cout<<(ans-para)*2<<endl;

    return 0;
}