Submission #1607439
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int x = sc.nextInt(); int y = sc.nextInt(); int x2 = sc.nextInt(); int y2 = sc.nextInt(); int Xsa = x2-x; int Ysa = y2-y; StringBuilder R = new StringBuilder(); for(int i = 0;i < Xsa; i++) { R.append("R"); } StringBuilder U = new StringBuilder(); for(int i = 0;i < Ysa; i++) { U.append("U"); } String L = R.toString(); L = L.replace("R", "L"); String D = U.toString(); D = D.replace("U","D"); StringBuilder ans = new StringBuilder(R); ans.append(U).append(L).append(D).append("D").append(R).append("R").append(U).append("U") .append("L").append("U").append(L).append("L").append(D).append("D").append("R"); System.out.println(ans); } }
Submission Info
Submission Time | |
---|---|
Task | C - Back and Forth |
User | naoppy |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 840 Byte |
Status | AC |
Exec Time | 131 ms |
Memory | 25556 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 92 ms | 21844 KB |
sample_02.txt | AC | 92 ms | 20560 KB |
subtask_1_01.txt | AC | 93 ms | 17108 KB |
subtask_1_02.txt | AC | 131 ms | 25556 KB |
subtask_1_03.txt | AC | 111 ms | 22484 KB |
subtask_1_04.txt | AC | 103 ms | 21716 KB |
subtask_1_05.txt | AC | 95 ms | 20052 KB |
subtask_1_06.txt | AC | 93 ms | 21844 KB |
subtask_1_07.txt | AC | 92 ms | 19796 KB |
subtask_1_08.txt | AC | 110 ms | 21460 KB |
subtask_1_09.txt | AC | 98 ms | 22356 KB |
subtask_1_10.txt | AC | 106 ms | 20180 KB |