fork download
copy 
  1. import java.io.BufferedReader;
  2. import java.io.IOException;
  3. import java.io.InputStreamReader;
  4. import java.util.ArrayList;
  5. import java.util.Arrays;
  6. import java.util.LinkedList;
  7. import java.util.StringTokenizer;
  8.  
  9.  
  10. public class Main {
  11.  
  12. 	public static class Pair {
  13. 		int i , j;
  14. 		char direction;
  15. 		public Pair(int i , int j) {
  16. 			this.i = i;
  17. 			this.j = j;
  18. 		}
  19. 		public Pair(int i , int j , char c) {
  20. 			this.i = i;
  21. 			this.j = j;
  22. 			this.direction = c;
  23. 		}
  24. 	}
  25. 	static char[][] grid = new char[110][110];
  26. 	static boolean[][] visited = new boolean[110][110];
  27. 	static ArrayList<Pair> toflood = new ArrayList<Pair>(150);
  28. 	static ArrayList<Pair> Is = new ArrayList<Pair>(150);
  29. 	static LinkedList<Pair> q = new LinkedList<Pair>();
  30. 	static int[] dx = {-1, -1, 0, 0, 1, 1};
  31. 	static int[] dy = {0, 1, -1, 1, -1, 0};
  32. 	static StringBuffer sb = new StringBuffer();
  33. 	static boolean l = false;
  34. 	static int n , m;
  35.  
  36. 	public static void main(String[] args) throws IOException {
  37. 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  38. 		//		StringTokenizer st = new StringTokenizer(br.readLine());
  39. 		while(true) {
  40. 			StringTokenizer st = new StringTokenizer(br.readLine());
  41. 			n = Integer.parseInt(st.nextToken());
  42. 			m = Integer.parseInt(st.nextToken());
  43. 			if(n == 0 && m == 0)
  44. 				break;
  45. 			for(int i = 0 ; i < n ; i++) {
  46. 				String temp = br.readLine();
  47. 				for(int j = 0 ; j < m ; j++) {
  48. 					grid[i][j] = temp.charAt(j);
  49. 					if(grid[i][j] == 'I') {
  50. 						Is.add(new Pair(i , j , '('));
  51. 						//						grid[i][j] = '(';
  52. 					}
  53. 				}
  54. 			}
  55. 			//			for(int i = 0 ; i < n ; i++) {
  56. 			//				for(int j = 0 ; j < m ; j++) {
  57. 			//					System.out.print(grid[i][j] + " ");
  58. 			//				}
  59. 			//				System.out.println();
  60. 			//			}
  61. 			for(int i = 0 ; i < Is.size() ; i++) {
  62. 				q.add(Is.get(i));
  63. 				bfs();
  64. 			}
  65. 			if (l)
  66. 				sb.append('\n');
  67. 			sb.append('\n');
  68. 			for(int i = 0 ; i < toflood.size() ; i++) {
  69. 				Pair curr = toflood.get(i);
  70. 				floodfill(curr.i , curr.j);
  71. 			}
  72. 			for(int i = 0 ; i < n ; i++) {
  73. 				for(int j = 0 ; j < m ; j++) {
  74. 					if(grid[i][j] == '*')
  75. 						sb.append("F");
  76. 					else
  77. 						sb.append(grid[i][j]);
  78. 				}
  79. 				if (i != (n - 1))
  80. 					sb.append('\n');
  81. 			}
  82. 			//		System.out.println(toflood.isEmpty());
  83. 			q.clear();
  84. 			toflood.clear();
  85. 			Is.clear();
  86. 			l = true;
  87. 			for(int i = 0 ; i < n ; i++)
  88. 				Arrays.fill(visited[i], false);
  89. 		}
  90. 		System.out.print(sb);
  91. 	}
  92.  
  93. 	public static void floodfill(int i, int j) {
  94. 		if(i < 0 || i >= n || j < 0 || j >= m)
  95. 			return;
  96. 		if(grid[i][j] != '(' && grid[i][j] != ')' && grid[i][j] != '*')
  97. 			return;
  98. 		grid[i][j] = 'B';
  99. 		for(int k = 0 ; k < dx.length ; k++) {
  100. 			floodfill(i + dx[k], j + dy[k]);
  101. 		}
  102. 	}
  103.  
  104. 	public static void bfs() {
  105. 		while(!q.isEmpty()) {
  106. 			Pair curr = q.poll();
  107. 			if((grid[curr.i][curr.j] == '(' && curr.direction == ')') || (grid[curr.i][curr.j] == ')' && curr.direction == '(')) {
  108. 				toflood.add(new Pair(curr.i, curr.j));
  109. 				q.clear();
  110. 				continue;
  111. 			}
  112. 			else {
  113. 				grid[curr.i][curr.j] = curr.direction;
  114. 			}
  115. 			if(visited[curr.i][curr.j])
  116. 				continue;
  117. 			visited[curr.i][curr.j] = true;
  118. 			char newdirection;
  119. 			if(curr.direction == ')')
  120. 				newdirection = '(';
  121. 			else
  122. 				newdirection = ')';
  123. 			for(int j = 0 ; j < dx.length ; j++) {
  124. 				int newI = curr.i + dx[j];
  125. 				int newJ = curr.j + dy[j];
  126. 				if(newI >= 0 && newI < n && newJ >= 0 && newJ < m && grid[newI][newJ] != '.') {
  127. 					q.add(new Pair(newI , newJ , newdirection));
  128. 				}
  129. 			}
  130. 		}
  131. 	}
  132. }
Success #stdin #stdout 0.07s 380160KB
comments (?)
stdin
copy 
4 3
...
.*.
.I.
...
4 4
....
.**.
.I..
..*.
0 0
stdout
copy 
...
.).
.(.
...

....
.BB.
.B..
..F.
https://ideone.com/DF3yZz
language:
Java (12.0.1)
created:
9 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!