Submission #669112

---

Source Code Expand

import java.util.*;

public class Main {

    static final int MAX = 30;
    static Point[][] board = new Point[MAX][MAX];
    static List<Point> list = new ArrayList<>();
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < MAX; i++) {
            for (int j = 0; j < MAX; j++) {
                Point point = new Point();
                point.x = i;
                point.y = j;
                point.value = sc.nextInt();
                board[i][j] = point;
                list.add(point);
            }
        }
        while (true) {
            list.sort((p1, p2) -> Integer.compare(p1.value, p2.value) * -1);
            int firstValue = list.get(0).value;
            if (firstValue == 0) {
                return;
            }
            List<Point> answerList = new ArrayList<>();
            for (Point point :list) {
                if (point.value < firstValue) {
                    break;
                }
                
                List<Point> resultList = new ArrayList<>();
                resultList.add(point);
                resultList = test(resultList);
                if (answerList.size() < resultList.size()) {
                    answerList = resultList;
                }
            }
            for (Point point :answerList) {
                System.out.println(point.xy());
                point.value--;
            }
//            for (int i = 0; i < MAX; i++) {
//                for (int j = 0; j < MAX; j++) {
//                    System.out.print(board[i][j] + " ");
//                }
//                System.out.println();
//            }
        }
    }
    static List<Point> test(List<Point> pointList) {
        List<Point> nextList = pointList;
        Point point = pointList.get(pointList.size() - 1);
        int nextValue = point.value - 1;
        if (nextValue > 0) {
            if (point.x - 1 >= 0 && board[point.x - 1][point.y].value == nextValue) {
                Point next = board[point.x - 1][point.y];
                if (!pointList.contains(next)) {
                    List<Point> westList = new ArrayList<>();
                    for (Point p : pointList) {
                        westList.add(p);
                    }
                    westList.add(next);
                    westList = test(westList);
                    if (nextList.size() < westList.size()) {
                        nextList = westList;
                    }
                }
            }
            if (point.x + 1 < MAX && board[point.x + 1][point.y].value == nextValue) {
                Point next = board[point.x + 1][point.y];
                if (!pointList.contains(next)) {
                    List<Point> eastList = new ArrayList<>();
                    for (Point p : pointList) {
                        eastList.add(p);
                    }
                    eastList.add(next);
                    eastList = test(eastList);
                    if (nextList.size() < eastList.size()) {
                        nextList = eastList;
                    }
                }
            }
            if (point.y - 1 >= 0 && board[point.x][point.y - 1].value == nextValue) {
                Point next = board[point.x][point.y - 1];
                if (!pointList.contains(next)) {
                    List<Point> eastList = new ArrayList<>();
                    for (Point p : pointList) {
                        eastList.add(p);
                    }
                    eastList.add(next);
                    eastList = test(eastList);
                    if (nextList.size() < eastList.size()) {
                        nextList = eastList;
                    }
                }
            }
            if (point.y + 1 < MAX && board[point.x][point.y + 1].value == nextValue) {
                Point next = board[point.x][point.y + 1];
                if (!pointList.contains(next)) {
                    List<Point> eastList = new ArrayList<>();
                    for (Point p : pointList) {
                        eastList.add(p);
                    }
                    eastList.add(next);
                    eastList = test(eastList);
                    if (nextList.size() < eastList.size()) {
                        nextList = eastList;
                    }
                }
            }
        }
        return nextList;
    }
    
    static class Point {
        public int x;
        public int y;
        public int value;
        public String xy() {
            return (x + 1) + " " + (y + 1);
        }
        @Override
        public String toString() {
            return "(" + (x + 1) + ", " + (y + 1) + ") = " + value;
        }
    }
}

Submission Info

Judge Result