fork download
copy 
  1. import java.io.*;
  2. import java.math.*;
  3. import java.util.*;
  4. import java.lang.*;
  5.  
  6. public class Main{ 
  7.  
  8. 	public static InputStream inputStream = System.in;
  9. 	public static OutputStream outputStream = System.out;
  10. 	public static FastReader in = new FastReader(inputStream);
  11. 	public static PrintWriter out = new PrintWriter(outputStream);
  12.  
  13.  
  14. 	public static void main(String[] args)throws java.lang.Exception{
  15. 		new Main().run();
  16. 		out.close();
  17. 	}	
  18.  
  19. 	int N;
  20. 	int M;
  21. 	boolean[][] dfsNode;
  22. 	StringTokenizer tk;
  23. 	char[][] grid;
  24. 	char[][] filled;
  25. 	String[] sep;
  26.  
  27. 	void run()throws java.lang.Exception{
  28. 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  29. 		N = Integer.parseInt(br.readLine().trim());
  30. 		sep = new String[N];
  31. 		for(int i=0; i<N; i++){
  32. 			ArrayList<char[]> al = new ArrayList<char[]>();
  33. 			while(true){
  34. 				String s = br.readLine();
  35. 				if(s.contains("_")){
  36. 					sep[i] = s;
  37. 					break;
  38. 				}
  39. 				char[] arr = s.toCharArray();
  40. 				al.add(arr);
  41. 			}
  42. 			grid = new char[al.size()][];
  43. 			for(int j=0; j<al.size(); j++){
  44. 				grid[j] = al.get(j);
  45. 			}
  46. 			//			 ArrayUtils.printGrid(grid);
  47. 			int stari = -1;
  48. 			int starj = -1;
  49. 			for(int j=0; j<grid.length; j++){
  50. 				for(int k=0; k<grid[j].length; k++){
  51. 					if(grid[j][k] == '*'){
  52. 						stari = j;
  53. 						starj = k;
  54. 						break;
  55. 					}
  56. 				}
  57. 			}
  58. 			dfsNode = new boolean[grid.length][];
  59. 			filled = new char[grid.length][];
  60. 			for(int j=0; j<grid.length; j++){
  61. 				char[] arr = new char[grid[j].length];
  62. 				for(int k=0; k<grid[j].length; k++){
  63. 					arr[k] = grid[j][k];
  64. 				}
  65. 				filled[j] = arr;
  66. 				dfsNode[j] = new boolean[grid[j].length];
  67. 			}
  68. 			fillColour(stari, starj);
  69. 			for(int j=0; j<filled.length; j++){
  70. 				for(int k=0; k<filled[j].length; k++){
  71. 					if(filled[j][k] == '*'){
  72. 						out.print(' ');
  73. 					}else{
  74. 						out.print(filled[j][k]);
  75. 					}
  76. 				}
  77. 				out.println();
  78. 			}
  79. 			out.println(sep[i]);
  80. 		}
  81. 	}
  82.  
  83. 	void fillColour(int row, int col){
  84. 		if(row<0 || row>=grid.length || col<0 || col>=grid[row].length){
  85. 			return;
  86. 		}
  87. 		if(dfsNode[row][col]){
  88. 			return;
  89. 		}
  90.  
  91. 		// fill on border?
  92. 		if(grid[row][col]!=' ' && grid[row][col]!='*'){
  93. 			return;
  94. 		}
  95.  
  96. 		filled[row][col] = '#';
  97. 		dfsNode[row][col] = true;
  98. 		fillColour(row-1, col);
  99. 		fillColour(row+1, col);
  100. 		fillColour(row, col-1);
  101. 		fillColour(row, col+1);
  102. 	}
  103. }
  104.  
  105. class ArrayUtils{
  106.  
  107. 	public static void initGraph(ArrayList<Integer>[] graph){
  108. 		for(int i=0; i<graph.length; i++){
  109. 			graph[i] = new ArrayList<Integer>();
  110. 		}
  111. 	}
  112.  
  113. 	public static void fill2d(long[][] arr){
  114. 		for(int i=0; i<arr.length; i++){
  115. 			Arrays.fill(arr[i], -1L);
  116. 		}
  117. 	}
  118.  
  119. 	public static void fill2d(int[][] arr){
  120. 		for(int i=0; i<arr.length; i++){
  121. 			Arrays.fill(arr[i], -1);
  122. 		}
  123. 	}
  124.  
  125. 	public static void input2d(int[][] arr, FastReader in){
  126. 		for(int i=0; i<arr.length; i++){
  127. 			for(int j=0; j<arr[0].length; j++){
  128. 				arr[i][j] = in.nextInt();
  129. 			}
  130. 		}
  131. 	}
  132.  
  133. 	public static void input1d(int[] arr, FastReader in){
  134. 		for(int i=0; i<arr.length; i++){
  135. 			arr[i] = in.nextInt();
  136. 		}
  137. 	}
  138.  
  139. 	public static void printGrid(char[][] arr){
  140. 		System.out.println("Character grid : ");
  141. 		for(int i=0; i<arr.length; i++){
  142. 			for(int j=0; j<arr[i].length; j++){
  143. 				System.out.print(arr[i][j]);
  144. 			}
  145. 			System.out.println();
  146. 		}
  147. 		System.out.println("--------------------------------------");
  148. 	}
  149. }
  150.  
  151.  
  152. class FastReader{
  153. 	private boolean finished = false;
  154.  
  155. 	private InputStream stream;
  156. 	private byte[] buf = new byte[1024];
  157. 	private int curChar;
  158. 	private int numChars;
  159. 	private SpaceCharFilter filter;
  160.  
  161. 	public FastReader(InputStream stream){
  162. 		this.stream = stream;
  163. 	}
  164.  
  165. 	public int read(){
  166. 		if (numChars == -1){
  167. 			throw new InputMismatchException ();
  168. 		}
  169. 		if (curChar >= numChars){
  170. 			curChar = 0;
  171. 			try{
  172. 				numChars = stream.read (buf);
  173. 			} catch (IOException e){
  174. 				throw new InputMismatchException ();
  175. 			}
  176. 			if (numChars <= 0){
  177. 				return -1;
  178. 			}
  179. 		}
  180. 		return buf[curChar++];
  181. 	}
  182.  
  183. 	public int peek(){
  184. 		if (numChars == -1){
  185. 			return -1;
  186. 		}
  187. 		if (curChar >= numChars){
  188. 			curChar = 0;
  189. 			try{
  190. 				numChars = stream.read (buf);
  191. 			} catch (IOException e){
  192. 				return -1;
  193. 			}
  194. 			if (numChars <= 0){
  195. 				return -1;
  196. 			}
  197. 		}
  198. 		return buf[curChar];
  199. 	}
  200.  
  201. 	public int nextInt(){
  202. 		int c = read ();
  203. 		while (isSpaceChar (c))
  204. 			c = read ();
  205. 		int sgn = 1;
  206. 		if (c == '-'){
  207. 			sgn = -1;
  208. 			c = read ();
  209. 		}
  210. 		int res = 0;
  211. 		do{
  212. 			if(c==','){
  213. 				c = read();
  214. 			}
  215. 			if (c < '0' || c > '9'){
  216. 				throw new InputMismatchException ();
  217. 			}
  218. 			res *= 10;
  219. 			res += c - '0';
  220. 			c = read ();
  221. 		} while (!isSpaceChar (c));
  222. 		return res * sgn;
  223. 	}
  224.  
  225. 	public long nextLong(){
  226. 		int c = read ();
  227. 		while (isSpaceChar (c))
  228. 			c = read ();
  229. 		int sgn = 1;
  230. 		if (c == '-'){
  231. 			sgn = -1;
  232. 			c = read ();
  233. 		}
  234. 		long res = 0;
  235. 		do{
  236. 			if (c < '0' || c > '9'){
  237. 				throw new InputMismatchException ();
  238. 			}
  239. 			res *= 10;
  240. 			res += c - '0';
  241. 			c = read ();
  242. 		} while (!isSpaceChar (c));
  243. 		return res * sgn;
  244. 	}
  245.  
  246. 	public String nextString(){
  247. 		int c = read ();
  248. 		while (isSpaceChar (c))
  249. 			c = read ();
  250. 		StringBuilder res = new StringBuilder ();
  251. 		do{
  252. 			res.appendCodePoint (c);
  253. 			c = read ();
  254. 		} while (!isSpaceChar (c));
  255. 		return res.toString ();
  256. 	}
  257.  
  258. 	public boolean isSpaceChar(int c){
  259. 		if (filter != null){
  260. 			return filter.isSpaceChar (c);
  261. 		}
  262. 		return isWhitespace (c);
  263. 	}
  264.  
  265. 	public static boolean isWhitespace(int c){
  266. 		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
  267. 	}
  268.  
  269. 	private String readLine0(){
  270. 		StringBuilder buf = new StringBuilder ();
  271. 		int c = read ();
  272. 		while (c != '\n' && c != -1){
  273. 			if (c != '\r'){
  274. 				buf.appendCodePoint (c);
  275. 			}
  276. 			c = read ();
  277. 		}
  278. 		return buf.toString ();
  279. 	}
  280.  
  281. 	public String nextLine(){
  282. 		String s = readLine0 ();
  283. 		while (s.trim ().length () == 0)
  284. 			s = readLine0 ();
  285. 		return s;
  286. 	}
  287.  
  288. 	public String nextLine(boolean ignoreEmptyLines){
  289. 		if (ignoreEmptyLines){
  290. 			return nextLine ();
  291. 		}else{
  292. 			return readLine0 ();
  293. 		}
  294. 	}
  295.  
  296. 	public BigInteger nextBigInteger(){
  297. 		try{
  298. 			return new BigInteger (nextString ());
  299. 		} catch (NumberFormatException e){
  300. 			throw new InputMismatchException ();
  301. 		}
  302. 	}
  303.  
  304. 	public char nextCharacter(){
  305. 		int c = read ();
  306. 		while (isSpaceChar (c))
  307. 			c = read ();
  308. 		return (char) c;
  309. 	}
  310.  
  311. 	public double nextDouble(){
  312. 		int c = read ();
  313. 		while (isSpaceChar (c))
  314. 			c = read ();
  315. 		int sgn = 1;
  316. 		if (c == '-'){
  317. 			sgn = -1;
  318. 			c = read ();
  319. 		}
  320. 		double res = 0;
  321. 		while (!isSpaceChar (c) && c != '.'){
  322. 			if (c == 'e' || c == 'E'){
  323. 				return res * Math.pow (10, nextInt ());
  324. 			}
  325. 			if (c < '0' || c > '9'){
  326. 				throw new InputMismatchException ();
  327. 			}
  328. 			res *= 10;
  329. 			res += c - '0';
  330. 			c = read ();
  331. 		}
  332. 		if (c == '.'){
  333. 			c = read ();
  334. 			double m = 1;
  335. 			while (!isSpaceChar (c)){
  336. 				if (c == 'e' || c == 'E'){
  337. 					return res * Math.pow (10, nextInt ());
  338. 				}
  339. 				if (c < '0' || c > '9'){
  340. 					throw new InputMismatchException ();
  341. 				}
  342. 				m /= 10;
  343. 				res += (c - '0') * m;
  344. 				c = read ();
  345. 			}
  346. 		}
  347. 		return res * sgn;
  348. 	}
  349.  
  350. 	public boolean isExhausted(){
  351. 		int value;
  352. 		while (isSpaceChar (value = peek ()) && value != -1)
  353. 			read ();
  354. 		return value == -1;
  355. 	}
  356.  
  357. 	public String next(){
  358. 		return nextString ();
  359. 	}
  360.  
  361. 	public SpaceCharFilter getFilter(){
  362. 		return filter;
  363. 	}
  364.  
  365. 	public void setFilter(SpaceCharFilter filter){
  366. 		this.filter = filter;
  367. 	}
  368.  
  369. 	public interface SpaceCharFilter{
  370. 		public boolean isSpaceChar(int ch);
  371. 	}
  372. }
Success #stdin #stdout 0.08s 381184KB
comments (?)
stdin
copy 
2
XXXXXXXXX
X   X   X
X *     X
X   X   X
XXXXXXXXX
X   X
X   X
X   X
XXXXX
_____
XXXXX
X   X
X * X
X   X
XXXXX
_____
stdout
copy 
XXXXXXXXX
X###X###X
X#######X
X###X###X
XXXXXXXXX
X   X
X   X
X   X
XXXXX
_____
XXXXX
X###X
X###X
X###X
XXXXX
_____
https://ideone.com/uxHP25
language:
Java (HotSpot 12)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!