CodeForces/Problem350C.java at master · raymondcho/CodeForces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
package CodeForces;


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Problem350C
{


	public static void main(String[] args) throws IOException
	{
		class BombCoordNode
		{
			int x;
			int y;
			int z;
			BombCoordNode left;
			BombCoordNode right;
			public BombCoordNode(int x, int y)
			{
				this.x = x;
				this.y = y;
				z = (Math.abs(x)+Math.abs(y));
			}
		}

		class BinaryBombTree
		{
			BombCoordNode root;
			public BinaryBombTree(BombCoordNode start)
			{
				root = start;
			}
			public void insert(BombCoordNode start, BombCoordNode b)
			{
				if (b.z < start.z && start.left != null)
				{
					insert(start.left, b);
				}
				else if (b.z >= start.z && start.right != null)
				{
					insert(start.right, b);
				}
				else if (b.z < start.z)
				{
					start.left = b;
				}
				else
				{
					start.right = b;
				}
			}
			public void inOrderDiffuse(BombCoordNode start)
			{
				if (start.left != null)
				{
					inOrderDiffuse(start.left);
				}
				if (start.x > 0)
					System.out.println("1 " + start.x + " R");
				if (start.x < 0)
					System.out.println("1 " + (start.x*-1) + " L");
				if (start.y > 0)
					System.out.println("1 " + start.y + " U");
				if (start.y < 0)
					System.out.println("1 " + (start.y*-1) + " D");

				System.out.println("2");

				if (start.x > 0)
					System.out.println("1 " + start.x + " L");
				if (start.x < 0)
					System.out.println("1 " + (start.x*-1) + " R");
				if (start.y > 0)
					System.out.println("1 " + start.y + " D");
				if (start.y < 0)
					System.out.println("1 " + (start.y*-1) + " U");

				System.out.println("3");
				if (start.right != null)
				{
					inOrderDiffuse(start.right);
				}
			}
		}

		fastinput.init(System.in);
		int count = 0;
		int n = fastinput.nextInt();
		int ix = fastinput.nextInt();
		int iy = fastinput.nextInt();
		BombCoordNode bi = new BombCoordNode(ix, iy);
		BinaryBombTree btree = new BinaryBombTree(bi);
		if (ix != 0 && iy != 0)
		{
			count += 6;
		}
		else
		{
			count += 4;
		}
		for (int i = 1; i < n; i++)
		{
			int x = fastinput.nextInt();
			int y = fastinput.nextInt();

			if (x != 0 && y != 0)
			{
				count += 6;
			}
			else
			{
				count += 4;
			}
			BombCoordNode b = new BombCoordNode(x, y);
			btree.insert(btree.root, b);
		}

		System.out.println(count);
		btree.inOrderDiffuse(btree.root);
	}

	public static class fastinput
	{
		static BufferedReader bf;
		static StringTokenizer st;

		static void init(InputStream input)
		{
			bf = new BufferedReader(new InputStreamReader(input));
			st = new StringTokenizer("");
		}

		static String next() throws IOException
		{
			while (!st.hasMoreTokens())
			{
				st = new StringTokenizer(bf.readLine());
			}
			return st.nextToken();
		}

		static int nextInt() throws IOException
		{
			return Integer.parseInt(next());
		}

	}
}