Submission #43134529

---

Source Code Expand

import java.awt.*;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main {
	public static void main(String[] args) throws Exception {
		try (Scanner scanner = new Scanner(System.in)) {
			int h = scanner.nextInt();
			int w = scanner.nextInt();
			char[][] map = new char[h][w];
			for (int i = 0; i < h; i++) {
				String line = scanner.next();
				for (int j = 0; j < w; j++) {
					map[i][j] = line.charAt(j);
				}
			}

			char[] list = {'s', 'n', 'u', 'k', 'e'};
			Set<Point> path = new HashSet<>();
			if (check(list, 0, 0, 0, h, w, map, path)) {
				System.out.println("Yes");
			} else {
				System.out.println("No");
			}
		}
	}

	private static boolean check(char[] list, int listSeq, int x, int y, int h, int w, char[][] map, Set<Point> path) {
		if (x < 0 || x >= w) {
			return false;
		}
		if (y < 0 || y >= h) {
			return false;
		}

		Point point = new Point(x, y);
		if (path.contains(point)) {
			return false;
		}

		char target = list[listSeq];
		if (map[y][x] != target) {
			return false;
		}
		if (x == w - 1 && y == h - 1) {
			return true;
		}
		listSeq++;
		if (listSeq >= list.length) {
			listSeq = 0;
		}

		path.add(point);

		if (check(list, listSeq, x, y - 1, h, w, map, path)) {
			return true;
		}
		if (check(list, listSeq, x + 1, y, h, w, map, path)) {
			return true;
		}
		if (check(list, listSeq, x, y + 1, h, w, map, path)) {
			return true;
		}
		return check(list, listSeq, x - 1, y, h, w, map, path);
	}
}

Submission Info

Judge Result