-
Notifications
You must be signed in to change notification settings - Fork 0
/
UVA10267.java
155 lines (144 loc) · 3.35 KB
/
UVA10267.java
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
154
155
import java.util.*;
class UVA10267{
static char[][] pic;
static Scanner s = new Scanner(System.in);
static LinkedList<int []> q = new LinkedList<int[]>();
static boolean[][] cached;
public static void main(String [] args){
try{
while(true){
char gg = s.next().charAt(0);
switch(gg){
case 'I': I(); break;
case 'C': C(); break;
case 'L': L(); break;
case 'V': V(); break;
case 'H': H(); break;
case 'K': K(); break;
case 'F': F(); break;
case 'S': S(); break;
case 'X': System.exit(0); break;
default: s.nextLine(); break;
}
}
}
catch(Exception e){}
System.exit(0);
}
public static void I(){
int m = s.nextInt();
int n = s.nextInt();
pic = new char[n][m];
C();
}
public static void C(){
for(int i=0; i<pic.length; i++){
for(int j=0; j<pic[0].length; j++){
pic[i][j] = 'O';
}
}
}
public static void L(){
int x = s.nextInt();
int y = s.nextInt();
char color = s.next().charAt(0);
pic[y-1][x-1] = color;
}
public static void V(){
int x = s.nextInt();
int y1 = s.nextInt();
int y2 = s.nextInt();
int min = Math.min(y1, y2);
int max = Math.max(y1, y2);
char color = s.next().charAt(0);
for(int i=min-1; i<=max-1; i++){
pic[i][x-1] = color;
}
}
public static void H(){
int x1 = s.nextInt();
int x2 = s.nextInt();
int y = s.nextInt();
int min = Math.min(x1, x2);
int max = Math.max(x1, x2);
char color = s.next().charAt(0);
for(int i=min-1; i<=max-1; i++){
pic[y-1][i] = color;
}
}
public static void K(){
int x1 =s.nextInt();
int y1 = s.nextInt();
int x2 = s.nextInt();
int y2 = s.nextInt();
int minx = Math.min(x1, x2);
int maxx = Math.max(x1, x2);
int miny = Math.min(y1, y2);
int maxy = Math.max(y1, y2);
char color = s.next().charAt(0);
for(int i=minx-1; i<=maxx-1; i++){
for(int j=miny-1; j<=maxy-1; j++){
pic[j][i] = color;
}
}
}
public static void F(){
int x = s.nextInt();
int y = s.nextInt();
char color = s.next().charAt(0);
char oldcolor = pic[y-1][x-1];
cached = new boolean[pic.length][pic[0].length];
if(color == oldcolor){return;}
//recurF(x-1, y-1, color, oldcolor);
q.add(new int[] {x-1, y-1});
while(!q.isEmpty()){
int[] temp = q.remove();
int x1 = temp[0]; int y1 = temp[1];
pic[y1][x1]= color;
if(cached[y1][x1]){
continue;
}
cached[y1][x1] = true;
if(x1>=1 && pic[y1][x1-1] == oldcolor){
q.add(new int[] {x1-1, y1});
}
if(x1<pic[0].length-1 && pic[y1][x1+1] == oldcolor){
q.add(new int[] {x1+1, y1});
}
if(y1>=1 && pic[y1-1][x1] == oldcolor){
q.add(new int[] {x1, y1-1});
}
if(y1<pic.length-1 && pic[y1+1][x1] == oldcolor){
q.add(new int[] {x1, y1+1});
}
}
}
// Flood-fill with Stack Memoization which has StackOverflow Error
/*public static void recurF(int x, int y, char color, char oldcolor){
if(y>=pic.length || y<0){
return;
}
if(x>=pic[0].length || x<0){
return;
}
if(cached[y][x]){
return;
}
if(pic[y][x] != oldcolor){
return;
}
pic[y][x] = color;
cached[y][x] = true;
recurF(x+1, y, color, oldcolor);
recurF(x-1, y, color, oldcolor);
recurF(x, y+1, color, oldcolor);
recurF(x, y-1, color, oldcolor);
}*/
public static void S(){
String str = s.next();
System.out.println(str);
for(int i=0; i<pic.length; i++){
System.out.println(String.valueOf(pic[i]));
}
}
}