Submission #9809248
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
Submission Time | |
---|---|
Task | D - Robot Arms |
User | liji |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 956 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | subtask | All | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | 0 / 300 | ||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt, sample4.txt |
subtask | sample1.txt, sample2.txt, sample3.txt, sample4.txt, sub1.txt, sub10.txt, sub11.txt, sub12.txt, sub13.txt, sub14.txt, sub15.txt, sub16.txt, sub2.txt, sub3.txt, sub4.txt, sub5.txt, sub6.txt, sub7.txt, sub8.txt, sub9.txt |
All | sample1.txt, sample2.txt, sample3.txt, sample4.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt, sub1.txt, sub10.txt, sub11.txt, sub12.txt, sub13.txt, sub14.txt, sub15.txt, sub16.txt, sub2.txt, sub3.txt, sub4.txt, sub5.txt, sub6.txt, sub7.txt, sub8.txt, sub9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1.txt | WA | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | WA | 2 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 2 ms | 256 KB |
14.txt | AC | 2 ms | 256 KB |
15.txt | AC | 2 ms | 256 KB |
16.txt | WA | 2 ms | 256 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 2 ms | 256 KB |
19.txt | WA | 2 ms | 256 KB |
2.txt | AC | 1 ms | 256 KB |
20.txt | AC | 2 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | AC | 2 ms | 256 KB |
24.txt | AC | 2 ms | 256 KB |
25.txt | AC | 2 ms | 256 KB |
26.txt | WA | 2 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 2 ms | 256 KB |
29.txt | AC | 2 ms | 256 KB |
3.txt | AC | 2 ms | 256 KB |
30.txt | AC | 2 ms | 256 KB |
31.txt | WA | 2 ms | 256 KB |
32.txt | AC | 2 ms | 256 KB |
33.txt | WA | 2 ms | 256 KB |
34.txt | WA | 2 ms | 256 KB |
4.txt | AC | 2 ms | 256 KB |
5.txt | WA | 2 ms | 256 KB |
6.txt | AC | 2 ms | 256 KB |
7.txt | AC | 1 ms | 256 KB |
8.txt | AC | 2 ms | 256 KB |
9.txt | WA | 2 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | WA | 1 ms | 256 KB |
sample4.txt | WA | 1 ms | 256 KB |
sub1.txt | WA | 1 ms | 256 KB |
sub10.txt | AC | 1 ms | 256 KB |
sub11.txt | WA | 2 ms | 256 KB |
sub12.txt | AC | 1 ms | 256 KB |
sub13.txt | AC | 2 ms | 256 KB |
sub14.txt | AC | 2 ms | 256 KB |
sub15.txt | AC | 2 ms | 256 KB |
sub16.txt | WA | 2 ms | 256 KB |
sub2.txt | AC | 1 ms | 256 KB |
sub3.txt | AC | 1 ms | 256 KB |
sub4.txt | AC | 1 ms | 256 KB |
sub5.txt | WA | 2 ms | 256 KB |
sub6.txt | AC | 2 ms | 256 KB |
sub7.txt | AC | 1 ms | 256 KB |
sub8.txt | AC | 2 ms | 256 KB |
sub9.txt | WA | 2 ms | 256 KB |