View difference between Paste ID: gUnVSR6q and wEn6tdvb

 //Author - Saurav Kalsoor
-//House Renovation - JAVA
+//House Renovation - KOTLIN
 
-import java.util.*;
+import java.util.*
 import java.lang.*
-public class Test {
+
-
+var sc: Scanner = Scanner(System.`in`)
-    static Scanner sc = new Scanner(System.in);
+var area = 0
-    static int area = 0;
+
-
+fun main() {
-
+    val n: Int = sc.nextInt()
-    public static void dfs(int[][] a,int i,int j,Boolean[][] visited) {
+    val m: Int = sc.nextInt()
-    	if(visited[i][j]) return;
+    val q: Int = sc.nextInt()
-
+    val a = Array(n) { IntArray(m) }
-    	visited[i][j] = true;
+    for (i in 0 until n) {
-    	area++;
+        for (j in 0 until m) {
-    	if((a[i][j] & 1)==0) {
+            a[i][j] = sc.nextInt()
-    		dfs(a,i,j-1,visited);
+
-    	}
+
-    	if((a[i][j] & 2)==0) {
+    val queries = IntArray(q)
-    		dfs(a,i+1,j,visited);
+    for (i in queries.indices) {
-    	}
+        queries[i] = sc.nextInt()
-    	if((a[i][j] & 4)==0) {
+
-    		dfs(a,i,j+1,visited);
+    val result = houseRenovation(n, m, q, a, queries)
-    	}
+    for (i in result.indices) {
-    	if((a[i][j] & 8)==0) {
+        print(result[i].toString() + " ")
-    		dfs(a,i-1,j,visited);
+
-    	}
+    println()
 }
-
+
-    public static int[] houseRenovation(int n, int m, int q, int[][] a,int[] queries){
+fun dfs(a: Array<IntArray>, i: Int, j: Int, visited: Array<BooleanArray>) {
-        Boolean[][] visited = new Boolean[n][m];
+    if (visited[i][j]) return
-
+    visited[i][j] = true
-        for(int i=0;i<n;i++) {
+    area++
-        	for(int j=0;j<m;j++) {
+    if (a[i][j] and 1 == 0) {
-            	visited[i][j] = false;
+        dfs(a, i, j - 1, visited)
     }
     if (a[i][j] and 2 == 0) {
-
+        dfs(a, i + 1, j, visited)
-        Map<Integer,Integer> hm = new HashMap<Integer,Integer>();
+
-
+    if (a[i][j] and 4 == 0) {
-        for(int i=0;i<n;i++) {
+        dfs(a, i, j + 1, visited)
-        	for(int j=0;j<m;j++) {
+
-        		if(visited[i][j] == false) {
+    if (a[i][j] and 8 == 0) {
-        			area = 0;
+        dfs(a, i - 1, j, visited)
-        			dfs(a,i,j,visited);
+
-        			hm.put(area,hm.getOrDefault(area, 0)+1);
+}
-        		}
+
 fun houseRenovation(n: Int, m: Int, q: Int, a: Array<IntArray>, queries: IntArray): IntArray {
     val visited = Array(n){BooleanArray(m)}
-
+    // val a = Array(n) { IntArray(m) }
-        int[] result = new int[q];
+    for (i in 0 until n) {
-        for(int i=0;i<queries.length;i++) {
+        for (j in 0 until m) {
-        	if(hm.containsKey(queries[i])) {
+            visited[i][j] = false
-        		result[i] = hm.get(queries[i]);
+
-        	}
+
-        	else {
+    val hm: MutableMap<Int, Int> = HashMap<Int, Int>()
-        		result[i] = 0;
+    for (i in 0 until n) {
-        	}
+        for (j in 0 until m) {
             if (visited[i][j] == false) {
-
+                area = 0
-        return result;
+                dfs(a, i, j, visited)
                 hm.put(area, hm.getOrDefault(area, 0) + 1)
-
+
-    public static void main(String[] args) {
+
-    	int n = sc.nextInt();
+
-    	int m = sc.nextInt();
+    val result = IntArray(q)
-    	int q = sc.nextInt();
+    for (i in queries.indices) {
-
+        if (hm.containsKey(queries[i])) {
-    	int[][] a = new int[n][m];
+            result[i] = hm[queries[i]]!!
-    	for(int i=0;i<n;i++) {
+        } else {
-        	for(int j=0;j<m;j++) {
+            result[i] = 0
-        		a[i][j] = sc.nextInt();
+
     }
     return result
-
+}
-    	int[] queries = new int[q];
+