competitive_programming/ChefAndHisCake.java at master · Karthik-Ragunath/competitive_programming · GitHub

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
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.*;

class ChefAndHisCake
{
	public static void main(String[] args)
	{
		int testcases;
		Scanner in = new Scanner(System.in);
		testcases = in.nextInt();
		for(int i = 0; i < testcases; i++)
		{
			int rows = in.nextInt();
			int columns = in.nextInt();
			int[][] matrix = new int[rows][columns];
			for(int j = 0; j < rows; j++)
			{
                String input = in.next();
				for(int k = 0; k < columns; k++)
				{
                    if(input.charAt(k) == 'G')
                    {
                        matrix[j][k] = 1;
                    }
                    else
                    {
                        matrix[j][k] = 0;
                    }
				}
			}
			int checker = 0;
			int redInitially = 0;
			int greenInitially = 0;
			//Replacing red with green cost = 5
			//Replacing green with red cost = 3
			//Red Initially
			for(int j = 0; j < rows; j++)
			{
                if(j % 2 == 0)
                {
                    checker = 0;
                }
                else
                {
                    checker = 1;
                }
				for(int k = 0; k < columns; k++)
				{
					if(matrix[j][k] == checker)
					{
						checker = (checker + 1) % 2;
						continue;
					}
					else
					{
						if(checker == 0)
						{
                            System.out.println("Red Initially - checker 0 - j and k : " + j + " " + k);
							redInitially += 3;
						}
						else
						{
                            System.out.println("Red Initially - checker 1 - j and k : " + j + " " + k);
							redInitially += 5;
						}
						checker = (checker + 1) % 2;
					}
				}
			}
			//Green Initially
			checker = 1;
			for(int j = 0; j < rows; j++)
			{
				if(j % 2 == 0)
				{
                    checker = 1;
				}
                else
                {
                    checker = 0;
                }
				for(int k = 0; k < columns; k++)
				{
					if(matrix[j][k] == checker)
					{
						checker = (checker + 1) % 2;
						continue;
					}
					else
					{
						if(checker == 0)
						{
                            System.out.println("Green Initially - checker 0 - j and k : " + j + " " + k);
							greenInitially += 3;
						}
						else
						{
                            System.out.println("Green Initially - checker 1 - j and k : " + j + " " + k);
							greenInitially += 5;
						}
						checker = (checker + 1) % 2;
					}
				}
			}
			if(redInitially <= greenInitially)
			{
				System.out.println(redInitially);
			}
			else
			{
				System.out.println(greenInitially);
			}
		}
	}
}