跳到主要內容

Codeforces Round #203 (Div. 2) Bombs

根本就超水,比第二題還水了阿...

只要避免踩到地雷,一直挖最近的地雷就好了

有可能有人會說 誤踩地雷怎麼辦,答案是 如果取最短保證不會踩到地雷

//
// GGGGGGGGGGGGG CCCCCCCCCCCCC AAA
// GGG::::::::::::G CCC::::::::::::C A:::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::::A
// G:::::G GGGGGG C:::::C CCCCCC A:::::::::A
//G:::::G C:::::C A:::::A:::::A
//G:::::G C:::::C A:::::A A:::::A
//G:::::G GGGGGGGGGGC:::::C A:::::A A:::::A
//G:::::G G::::::::GC:::::C A:::::A A:::::A
//G:::::G GGGGG::::GC:::::C A:::::AAAAAAAAA:::::A
//G:::::G G::::GC:::::C A:::::::::::::::::::::A
// G:::::G G::::G C:::::C CCCCCC A:::::AAAAAAAAAAAAA:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::A A:::::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A A:::::A
// GGG::::::GGG:::G CCC::::::::::::C A:::::A A:::::A
// GGGGGG GGGG CCCCCCCCCCCCCAAAAAAA AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 100005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
#define X first
#define Y second
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n;
struct bombs{
int x,y;
}bomb[M];
bool cmp(bombs a,bombs b){
return abs(a.x)+abs(a.y)<abs(b.x)+abs(b.y);
}
int main() {
ios_base::sync_with_stdio(0);
while(~scanf("%d",&n)){
for(int i=0;i<n;i++){
scanf("%d%d",&bomb[i].x,&bomb[i].y);
}
sort(bomb,bomb+n,cmp);
int ans=0;
for(int i=0;i<n;i++){
int tx=abs(bomb[i].x);
int ty=abs(bomb[i].y);
if(tx)ans+=2;
if(ty)ans+=2;
ans+=2;
}
printf("%d\n",ans);
for(int i=0;i<n;i++){
int tx=abs(bomb[i].x);
int ty=abs(bomb[i].y);
if(tx){
if(bomb[i].x>0)printf("1 %d R\n",tx);
else printf("1 %d L\n",tx);
}
if(ty){
if(bomb[i].y>0)printf("1 %d U\n",ty);
else printf("1 %d D\n",ty);
}
printf("2\n");
if(tx){
if(bomb[i].x>0)printf("1 %d L\n",tx);
else printf("1 %d R\n",tx);
}
if(ty){
if(bomb[i].y>0)printf("1 %d D\n",ty);
else printf("1 %d U\n",ty);
}
printf("3\n");
}
}
















}

留言