Round #203 (Div. 2)C、Bombs

1、题目链接：http://codeforces.com/problemset/problem/350/C

2、这道题昨晚一直WA在第五组测试数据上，主要是因为<运算符没有定义好，分类讨论了很多情况都不对，后来比赛结束后一看大牛代码，恍然大悟！（具体见以下代码）

3、运算符重载非常巧妙，这样落在坐标轴上的点就不会“打架”，不在坐标轴上的点，如果有一个坐标相同，也不必担心，一样不会“打架”，两个坐标都不同，就更不用担心了，因为此时顺序可以是任意的。

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
struct point{
   int x,y;
   bool operator <(const point &obj)const{
       return abs(x)+abs(y)<abs(obj.x)+abs(obj.y);
   }
};
point a[100010];
int main()
{
    int n,ans;
    while(scanf("%d",&n)==1){
        ans=0;
        for(int i=0;i<n;i++)
           scanf("%d%d",&a[i].x,&a[i].y);
        sort(a,a+n);
        for(int i=0;i<n;i++){
           if(a[i].x==0||a[i].y==0){
                ans+=4;
           }
           else ans+=6;
        }
        printf("%d\n",ans);
        for(int i=0;i<n;i++){
            if(a[i].x>0&&a[i].y==0){
               printf("1 %d R\n",a[i].x);
               printf("2\n");
               printf("1 %d L\n",a[i].x);
               printf("3\n");
               continue;
           }
           if(a[i].x<0&&a[i].y==0){
               printf("1 %d L\n",-a[i].x);
               printf("2\n");
               printf("1 %d R\n",-a[i].x);
               printf("3\n");
               continue;
           }
           if(a[i].x==0&&a[i].y>0){
               printf("1 %d U\n",a[i].y);
               printf("2\n");
               printf("1 %d D\n",a[i].y);
               printf("3\n");
               continue;
           }
            if(a[i].x==0&&a[i].y<0){
               printf("1 %d D\n",-a[i].y);
               printf("2\n");
               printf("1 %d U\n",-a[i].y);
               printf("3\n");
               continue;
           }
           if(a[i].x>0&&a[i].y>0){
               printf("1 %d R\n",a[i].x);
               printf("1 %d U\n",a[i].y);
               printf("2\n");
               printf("1 %d D\n",a[i].y);
               printf("1 %d L\n",a[i].x);
               printf("3\n");
               continue;
           }
           if(a[i].x>0&&a[i].y<0){
               printf("1 %d R\n",a[i].x);
               printf("1 %d D\n",-a[i].y);
               printf("2\n");
               printf("1 %d U\n",-a[i].y);
               printf("1 %d L\n",a[i].x);
               printf("3\n");
               continue;
           }
            if(a[i].x<0&&a[i].y>0){
               printf("1 %d L\n",-a[i].x);
               printf("1 %d U\n",a[i].y);
               printf("2\n");
               printf("1 %d D\n",a[i].y);
               printf("1 %d R\n",-a[i].x);
               printf("3\n");
               continue;
           }
            if(a[i].x<0&&a[i].y<0){
               printf("1 %d L\n",-a[i].x);
               printf("1 %d D\n",-a[i].y);
               printf("2\n");
               printf("1 %d U\n",-a[i].y);
               printf("1 %d R\n",-a[i].x);
               printf("3\n");
               continue;
           }
        }
    }
    return 0;
}