Submission #9809222

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1005,p=1000000007;
int read(){
	int f=1,g=0;
	char ch=getchar();
	for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-1;
	for (;isdigit(ch);ch=getchar()) g=g*10+ch-'0';
	return f*g;
}
int n,fl;
struct node{int x,y;}a[N];
void solve(int x,int y){
	for (int i=30;i>=0;i--)
	if (abs(x)>abs(y)){
		if (x>=0) {putchar('R');x-=1<<i;}
		else {putchar('L');x+=1<<i;}
	}
	else{
		if (y>=0) {putchar('U');y-=1<<i;}
		else {putchar('D');y+=1<<i;}
	}
}
int main(){
	n=read();
	for (int i=1;i<=n;i++){
		int x=read(),y=read();
		if (i==1) fl=(x+y)&1;
		if (((x+y)&1)!=fl){puts("-1");return 0;}
		if (!fl) y--;
		a[i]=(node){x,y};
	}
	puts((fl) ? "31" : "32");
	if (fl) printf("1 ");
	for (int i=30;i>=0;i--) printf("%d ",1<<i);
	printf("\n");
	for (int i=1;i<=n;i++){
		if (!fl) putchar('R');
		solve(a[i].x,a[i].y);
		putchar('\n');
	}
	return 0;
}

Submission Info

Judge Result