Educational Codeforces Round 1 C Nearest vectors（极角排序）

最新推荐文章于 2022-05-26 21:28:17 发布

TaoSama

最新推荐文章于 2022-05-26 21:28:17 发布

阅读量414

点赞数

分类专栏：计算几何文章标签：计算几何极角排序

本文链接：https://blog.csdn.net/lwt36/article/details/50544917

版权

计算几何专栏收录该内容

9 篇文章 0 订阅

订阅专栏

题意:

$求N\le 10^5个从原点出发的向量中夹角最小的2个向量编号$

分析:

$显然的极角排序$
$解释一下极角排序吧, 极角:=向量与x轴正半轴的夹角, 极角排序即是按照极角大小排序$
$Vector(x,y), ang = atan2(y,x); x和y不能同时为0, 值域范围为[-PI,+PI]$
$只要枚举一遍所有相邻的就好了, 这里我们不考虑锐角钝角, 因为答案必然在1\sim n夹角或者v_n与v_1的夹角中$
$画画图就能理解了$

代码:

//
//  Created by TaoSama on 2016-01-19
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

const long double PI = acosl(-1);

int n;

struct Point {
    int x, y;
    long double ang;
    int id;
    void read() {
        scanf("%d%d", &x, &y);
        ang = atan2l(y, x);
    }
    bool operator<(const Point& p) const {
        return ang < p.ang;
    }
} a[N];

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(scanf("%d", &n) == 1) {
        for(int i = 1; i <= n; ++i) {
            a[i].read();
            a[i].id = i;
        }
        sort(a + 1, a + 1 + n);
        a[n + 1] = a[1];
        a[n + 1].ang += 2 * PI;

        long double angle = INF;
        int ans;
        for(int i = 1; i <= n; ++i) {
            long double cur = a[i + 1].ang - a[i].ang;
//          cout << a[i].id << ' ' << a[i + 1].id << ' ' << cur << endl;
            if(cur < angle) {
                angle = cur;
                ans = i;
            }
        }
        printf("%d %d\n", a[ans].id, a[ans + 1].id);
    }
    return 0;
}