cf Educational Codeforces Round 41 D. Pair Of Lines

最新推荐文章于 2018-11-12 09:24:25 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2018-11-12 09:24:25 发布

阅读量245

点赞数

分类专栏：计算几何文章标签： codeforces 几何

本文链接：https://blog.csdn.net/tengfei461807914/article/details/81058234

版权

计算几何专栏收录该内容

12 篇文章 0 订阅

订阅专栏

原题：
D. Pair Of Lines
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given n points on Cartesian plane. Every point is a lattice point (i. e. both of its coordinates are integers), and all points are distinct.

You may draw two straight lines (not necessarily distinct). Is it possible to do this in such a way that every point lies on at least one of these lines?

Input
The first line contains one integer n (1 ≤ n ≤ 105) — the number of points you are given.

Then n lines follow, each line containing two integers xi and yi (|xi|, |yi| ≤ 109)— coordinates of i-th point. All n points are distinct.

Output
If it is possible to draw two straight lines in such a way that each of given points belongs to at least one of these lines, print YES. Otherwise, print NO.

Examples
input
5
0 0
0 1
1 1
1 -1
2 2
output
YES
input
5
0 0
1 0
2 1
1 1
2 3
output
NO

Note
In the first example it is possible to draw two lines, the one containing the points 1, 3 and 5, and another one containing two remaining points.
这里写图片描述

中文：

给你一堆点，判断能否用两个直线把这些点都连接起来。

代码：

#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
#include <set>
#include <vector>
#include <cmath>
using namespace std;

typedef long long ll;


const int maxn = 100001;

struct Point
{
    ll x,y;
    ll rx,ry;//根据原点对称后的点
    Point(ll x = 0, ll y = 0) :x(x), y(y){}
};

typedef  Point Vector;

bool line(const Point &p1, const Point &p2, const Point &p3)//判断三点是否共线
{
    return (p3.y - p1.y)*(p2.x - p1.x) - (p2.y - p1.y)*(p3.x - p1.x)==0;
}

ll Cross(Vector A, Vector B)//叉积
{
    return A.rx*B.ry - A.ry*B.rx;
}


bool cross_cmp(const Vector &a,const Vector &b)
{
    if(Cross(a,b)==0)//在一条直线上是等于0
        return a.rx<b.rx;
    else
        return Cross(a,b)<0;
}

int n;
vector<Point> v,one,two,three;



bool solve(Point o,vector<Point> V)
{
    sort(V.begin(),V.end(),cross_cmp);

    vector<Point> tmp;

    int ind = 0,ans=0,pre=0;
    for (int i = 0; i < V.size();)
    {
        int j = i + 1;
        while (j <V.size())
        {
            if (Cross(V[i], V[j])==0)
                j++;
            else
                break;
        }
        if (j - i> ans +1 )
        {
            ans = j - i;//不算上原点
            pre = i;
            ind = j - 1;
        }
        i = j;
    }



    if(ans==0)
        return false;

    for (int i = 0; i < V.size(); i++)
        {
            if (i<pre || i>ind)//去除在一个极角上的点
                tmp.push_back(V[i]);
        }


        if (tmp.size() <= 2)
            return true;
        for (int i = 2; i < tmp.size(); i++)//剩下的点是否在一条直线
        {
            if (!line(tmp[i-2], tmp[i-1], tmp[i]))
                return false;
        }
    return true;

}
void trans(Point &p)//如果一个点在三，四象限或者在x轴负方向上，那么找到这个点关于原点的对称点
{
    if(p.ry<0||(p.ry==0&&p.rx<0))
    {
        p.rx=-p.rx;
        p.ry=-p.ry;
    }
}

int main()
{

    ios::sync_with_stdio(false);
    Point tmp,a,b,c;
    while (cin >> n)
    {
        v.clear();
        one.clear();
        two.clear();
        three.clear();
        for (int i = 0; i < n; i++)
        {
            cin >> tmp.x >> tmp.y;
            v.push_back(tmp);
        }
        if (n <= 4)
        {
            cout << "YES" << endl;
            continue;
        }
        a = v[0];
        b = v[1];
        c = v[2];
        for (int i = 0; i < v.size(); i++)
        {
            if (i != 0)//以第一个点为原点
            {
                tmp.x = v[i].x - a.x;
                tmp.y = v[i].y - a.y;
                tmp.rx=tmp.x,tmp.ry=tmp.y;
                trans(tmp);
                one.push_back(tmp);
            }
            if (i != 1)//以第二个点为原点
            {
                tmp.x = v[i].x - b.x;
                tmp.y = v[i].y - b.y;
                tmp.rx=tmp.x,tmp.ry=tmp.y;
                trans(tmp);
                two.push_back(tmp);
            }
            if (i != 2)//以第三个点为原点
            {
                tmp.x = v[i].x - c.x;
                tmp.y = v[i].y - c.y;
                tmp.rx=tmp.x,tmp.ry=tmp.y;
                trans(tmp);
                three.push_back(tmp);
            }
        }


        if (solve(a, one) || solve(b, two) || solve(c, three))
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }

    }
    return 0;
}