fork download
copy 
  1. import java.io.*;
  2. import java.util.*;
  3. import java.lang.*;
  4.  
  5. class Main
  6. {
  7.  
  8. 	  static class FastReader{
  9. 	        BufferedReader br;
  10. 	        StringTokenizer st;
  11. 	        public FastReader(){
  12. 	            br = new BufferedReader(new InputStreamReader(System.in));
  13. 	        }
  14. 	        String next(){
  15. 	            while(st ==  null || !st.hasMoreElements()){
  16. 	                try{
  17. 	                    st = new StringTokenizer(br.readLine());
  18. 	                }
  19. 	                catch(IOException e){
  20. 	                    e.printStackTrace();
  21. 	                }
  22. 	            }
  23. 	            return st.nextToken();
  24. 	        }
  25. 	        int nextInt(){
  26. 	            return Integer.parseInt(next());
  27. 	        }
  28. 	        long nextLong(){
  29. 	            return Long.parseLong(next());
  30. 	        }
  31. 	        String nextLine(){
  32. 	            String sr = "";
  33. 	            try{
  34. 	                sr = br.readLine();
  35. 	            }
  36. 	            catch(IOException e){
  37. 	                e.printStackTrace();
  38. 	            }
  39. 	            return sr;
  40. 	        }
  41. 	    }
  42. 	     public static class Node {
  43. 	        int i ;
  44. 	        int j;
  45. 			public Node(int i, int j) {
  46. 				super();
  47. 				this.i = i;
  48. 				this.j = j;
  49. 			}
  50.  
  51. 		  }
  52.         static int dirX[] = {-1,0,1};
  53.         static int dirY[] = {-1,0,1};
  54. 		public static void main (String[] args) throws java.lang.Exception
  55. 		{
  56. 			FastReader ft = new FastReader();
  57. 		    BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
  58. 	        int t = ft.nextInt();
  59. 	        while(t-->0)
  60. 	        {
  61. 	        	int n = ft.nextInt();
  62. 	        	int m = ft.nextInt();
  63. 	        	int vis[][] = new int[n][m];
  64. 	        	char a[][] = new char[n][m];
  65. 	        	for(int i = 0;i < n;i++) {
  66. 	        		String s = ft.nextLine().trim().replace(" ", "");
  67. //	        		System.out.println(s);
  68. 	        	    a[i] = s.toCharArray();}
  69. 	            Queue<Node> q = new LinkedList<>();
  70. 	        	for(int i = 0;i < n;i++)
  71. 	        		for(int j = 0;j < m;j++)
  72. 	        		{
  73. 	        			if(a[i][j] == '1')
  74. 	        			{
  75. 	        				q.add(new Node(i,j));
  76. 	        				vis[i][j] = 1;
  77. 	        			}
  78. 	        		}
  79. 	        	while(!q.isEmpty()) {
  80. 	        		Node node = q.poll();
  81. 	        		int x = node.i;
  82. 	        		int y = node.j;
  83. 	        		for(int i = 0;i <=2;i++)
  84. 	        			for(int j = 0;j <= 2;j++)
  85. 	        			{  if(dirX[i] != dirY[j]) {
  86. 	        				int X = dirX[i]+x;
  87. 	        				int Y = dirY[j]+y;
  88. 	        				if(ok(X,Y,n,m) && vis[X][Y] == 0)
  89. 	        				{
  90. 	        					q.add(new Node(X,Y));
  91. 	        					vis[X][Y] = vis[x][y]+1;
  92. 	        				}}
  93. 	        			}
  94.  
  95. 	        	}
  96. 	        	for(int i = 0;i < n;i++) {
  97. 	        		for(int j = 0;j<m;j++)
  98. 	        			out.write((vis[i][j]-1)+" ");
  99. 	        		out.write("\n");
  100. 	        	}
  101.  
  102. 	        }
  103. 	    	out.flush();
  104. 		}
  105. 		private static boolean ok(int x, int y, int n, int m) {
  106.             if(x<0 || y <0 || x>=n || y>=m)
  107. 			return false;
  108.             return true;
  109. 		}
  110. 	}
Success #stdin #stdout 0.09s 48284KB
comments (?)
stdin
copy 
1
3 4
0001
0011
0110
stdout
copy 
3 2 1 0 
2 1 0 0 
1 0 0 1
https://ideone.com/Y712af
problem BITMAP, based on SPOJ submission 28358919 (JAVA), 2021-08-26 18:09:59
language:
Java (HotSpot 12)
created:
2 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!