Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.IOException;
- import java.io.InputStream;
- import java.io.InputStreamReader;
- public class Main {
- public static void main (String[] args) throws IOException {
- BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
- String[] input = read.readLine().split(" ");
- int N = Integer.parseInt(input[0]);
- int M = Integer.parseInt(input[1]);
- int j = Integer.parseInt(input[2]);
- String[] startPos = read.readLine().split(" ");
- int r = Integer.parseInt(startPos[0]);
- int c = Integer.parseInt(startPos[1]);
- long [][] matrix = new long[N][M];
- int counter = 1;
- for (int i = 0; i < matrix.length; i++) {
- for (int k = 0; k < matrix[i].length; k++) {
- matrix[i][k] = counter;
- counter++;
- }
- }
- boolean[][] visited = new boolean[N][M];
- visited[r][c] = true;
- int[][] jumps = new int[j][2];
- for (int i = 0; i < j; i++) {
- String[] currInput = read.readLine().split(" ");
- jumps[i][0] = Integer.parseInt(currInput[0]);
- jumps[i][1] = Integer.parseInt(currInput[1]);
- }
- int numberJumps = 0;
- long sum = matrix[r][c];
- boolean escaped = false;
- boolean caught = false;
- while (true) {
- for (int i = 0; i < j; i++) {
- int targetRow = jumps[i][0] + r;
- int targetCol = jumps[i][1] + c;
- if (targetRow < 0 || targetRow > matrix.length - 1) {
- escaped = true;
- numberJumps++;
- break;
- } else if (targetCol < 0 || targetCol > matrix[0].length - 1) {
- escaped = true;
- numberJumps++;
- break;
- }
- r = targetRow;
- c = targetCol;
- numberJumps++;
- sum += matrix[r][c];
- if(visited[r][c]){
- caught = true;
- break;
- }else {
- visited[r][c] = true;
- }
- }
- if(escaped){
- System.out.println("escaped "+sum);
- break;
- } else if(caught){
- System.out.println("caught "+ numberJumps);
- break;
- }
- }
- }
- public static void print (int[][] matrix) {
- for (int[] Row : matrix) {
- for (int num : Row) {
- System.out.printf("%d ", num);
- }
- System.out.println();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement