课后自主练习（排序）1027. 极坐标排序 easy《编程思维与实践》个人学习笔记

题目

输入
3
5
1.0 1.0
2.0 2.0
-1.0 1.0
0 1.0
1.0 0
1
0 -1.0
6
1.0 1.0
0 1.0
1.0 0
-1.0 1.0
-1.0 -1.0
1.0 -1.0

思路

经典的 创造类，输入（并转化对应的量），排序，输出
需要注意的是由于atan只能转成一个pi的范围，所以要根据极坐标在哪个象限来分类讨论进行+npi/2的处理

代码

#include<iostream>
#include<cmath>
#define db double
using namespace std;

struct polar
{
    db x;
    db y;
    db angle;
    db chord;

    db hypoteuse(db x, db y)
    {
        db temp = pow(x,2) + pow(y,2);
        temp = sqrt(temp);
        return temp;
    }

    db Pangle(db x ,db y)
    {
        if(x == 0 && y > 0)
        {return acos(0);}
        else if(x == 0 && y < 0)
        {return 3 * acos(0);}

        db k = (db)y / (db)x;
        
        if(x > 0 && y >= 0)
        {return atan(k);}
        else if(x > 0 && y < 0)
        {return 4 *acos(0) + atan(k);}
        else if(x < 0 && y > 0)
        {return 2 * acos(0) + atan(k);}
        else
        {return  2 * acos(0) + atan(k);}

    }

    void init()
    {
        chord = hypoteuse(x,y);
        angle = Pangle(x,y);
    }
};

int cmp(const void *q1, const void *q2)
{
    polar * p1 = (polar *)q1;
    polar * p2 = (polar *)q2;

    if(p1->angle == p2->angle)
    {
        if(p1->chord > p2->chord)
        {return -1;}
        else
        {return 1;}
    }
    if(p1->angle > p2->angle)
    {return 1;}
    else
    return -1;
}

void print(polar *a,int len)
{
    for(int i = 0; i < len; i++)
        printf("(%.4lf,%.4lf)",a[i].chord,a[i].angle);
}



int main()
{
    int total;
    cin >> total;
    
    for(int i = 0; i < total; i++)
    {
        int allp;
        cin >> allp;
        polar * point = new polar[allp];

        for(int j = 0; j < allp; j++)
        {
            cin >> point[j].x >> point[j].y;
            point[j].init();
        }
        cout << "case #"<<i<<":" << endl;
        // for(int i = 0; i < allp; i++)
        // {
        //     printf("(%.4lf,%.4lf)\n",point[i].chord,point[i].angle);
        // }
        
        
        qsort(point,allp,sizeof(polar),cmp);
        for(int i = 0; i < allp; i++)
        {
            printf("(%.4lf,%.4lf)\n",point[i].chord,point[i].angle);
        }
        delete point;
    }
    
}