DemoExam_TheGarden

package Exams;

import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Scanner;

public class TheGarden {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        int n = Integer.parseInt(sc.nextLine());

        String[][] garden = new String[n][];

        for (int r = 0; r < n; r++) {
            garden[r] = sc.nextLine().split("\\s+");
        }

        int carrots = 0;
        int potatoes = 0;
        int lettuce = 0;

        int harmedVeggies = 0;

        String line = "";

        while (!"End of Harvest".equals(line = sc.nextLine())) {
            String[] tokens = line.split("\\s+");
            String command = tokens[0];

            int row = Integer.parseInt(tokens[1]);
            int col = Integer.parseInt(tokens[2]);

            if (row >= 0 && row < garden.length && col >= 0 && col < garden[row].length) {
                switch (command) {
                    case "Harvest":
                        if (garden[row][col].equals("C")) {
                            carrots++;
                        } else if (garden[row][col].equals("L")) {
                            lettuce++;
                        } else if (garden[row][col].equals("P")) {
                            potatoes++;
                        }

                        garden[row][col] = " ";

                        break;
                    case "Mole":
                        String direction = tokens[3];

                        switch (direction) {
                            case "up":
                                for (int r = row; r >= 0; r -= 2) {
                                    if (!garden[r][col].equals(" ")) {
                                        garden[r][col] = " ";
                                        harmedVeggies++;
                                    }
                                }
                                break;
                            case "down":
                                for (int r = row; r < garden.length; r += 2) {
                                    if (!garden[r][col].equals(" ")) {
                                        garden[r][col] = " ";
                                        harmedVeggies++;
                                    }
                                }
                                break;
                            case "left":
                                for (int c = col; c >= 0; c -= 2) {
                                    if (!garden[row][c].equals(" ")) {
                                        garden[row][c] = " ";
                                        harmedVeggies++;
                                    }
                                }
                                break;
                            case "right":
                                for (int c = col; c < garden[row].length; c += 2) {
                                    if (!garden[row][c].equals(" ")) {
                                        garden[row][c] = " ";
                                        harmedVeggies++;
                                    }
                                }
                                break;
                        }
                        break;
                }
            }
        }

        for (int r = 0; r < garden.length; r++) {
            for (int c = 0; c < garden[r].length; c++) {
                System.out.print(garden[r][c] + " ");
            }
            System.out.println();
        }

        System.out.println("Carrots: " + carrots);
        System.out.println("Potatoes: " + potatoes);
        System.out.println("Lettuce: " + lettuce);
        System.out.println("Harmed vegetables: " + harmedVeggies);
    }
}