Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //elab-source: NewPavement.java
- import java.util.Scanner;
- public class NewPavement {
- public static void main(String[]args){
- Scanner input=new Scanner(System.in);
- int size = input.nextInt();
- int matrix[][]=new int [size][size];
- for (int i=0;i<size;i++){
- for (int j=0;j<size;j++){
- int in=input.nextInt();
- matrix[i][j]=in;
- }
- }
- int level=0;
- int newi=0; int newj=0;
- for (int i=0;i<size;i++){
- for (int j=0;j<size;j++){
- if (matrix[i][j]==1){
- level=matrix[i][j];
- newi=i;
- newj=i;
- }
- }
- }
- for (int i=newi;i<size;i++){
- for (int j=newj;j<size;j++){
- if (i==0&&j==0){
- if(matrix[i+1][j]==level+1){
- level=matrix[i+1][j];
- i=i+1;
- j=j;
- }
- if(matrix[i][j+1]==level+1){
- level=matrix[i][j+1];
- i=i;
- j=j+1;
- }
- }
- if(j==0&&i==size-1){
- if(matrix[i-1][j]==level+1){
- level=matrix[i-1][j];
- i=i-1;
- j=j;
- }
- if(matrix[i][j+1]==level+1){
- level=matrix[i][j+1];
- i=i;
- j=j+1;
- }
- }
- if(j==0&&i!=0&&i!=size-1){
- if (matrix[i-1][j]==level+1){
- level=matrix[i-1][j];
- i=i-1;
- j=j;
- }
- if (matrix[i+1][j]==level+1){
- level=matrix[i+1][j];
- i=i+1;
- j=j;
- }
- if (matrix[i][j+1]==level+1){
- level=matrix[i][j+1];
- i=i;
- j=j+1;
- }
- }
- if(i==0&&j==size-1){
- if (matrix[i][j-1]==level+1){
- level=matrix[i][j-1];
- i=i;
- j=j-1;
- }
- if (matrix[i+1][j]==level+1){
- level=matrix[i+1][j];
- i=i+1;
- j=j;
- }
- }
- if(i==0&&j!=0&&j!=size-1){
- if (matrix[i+1][j]==level+1){
- level=matrix[i+1][j];
- i=i+1;
- j=j;
- }
- if (matrix[i][j-1]==level+1){
- level=matrix[i][j-1];
- i=i;
- j=j-1;
- }
- if(matrix[i][j+1]==level+1){
- level=matrix[i][j+1];
- i=i;
- j=j+1;
- }
- }
- if (i==size-1&&j==size-1){
- if(matrix[i][j-1]==level+1){
- level=matrix[i][j-1];
- i=i;
- j=j-1;
- }
- if(matrix[i-1][j]==level+1){
- level=matrix[i-1][j];
- i=i-1;
- j=j;
- }
- }
- if(j==size-1&&i!=0&&i!=size-1){
- if(matrix[i-1][j]==level+1){
- level=matrix[i-1][j];
- i=i-1;
- j=j;
- }
- if(matrix[i+1][j]==level+1){
- level=matrix[i+1][j];
- i=i+1;
- j=j;
- }
- if(matrix[i][j-1]==level+1){
- level=matrix[i][j-1];
- i=i;
- j=j-1;
- }
- }
- if(i==size-1&&j!=0&&j!=size-1){
- if(matrix[i-1][j]==level+1){
- level=matrix[i-1][j];
- i=i-1;
- j=j;
- }
- if(matrix[i][j-1]==level+1){
- level=matrix[i][j-1];
- i=i;
- j=j-1;
- }
- if(matrix[i][j+1]==level+1){
- level=matrix[i][j+1];
- i=i;
- j=j+1;
- }
- }
- if(i!=size-1&&i!=0&&j!=size-1&&j!=0){
- if(matrix[i-1][j]==level+1){
- level=matrix[i-1][j];
- i=i-1;
- j=j;
- }
- if(matrix[i][j-1]==level+1){
- level=matrix[i][j-1];
- i=i;
- j=j-1;
- }
- if(matrix[i][j+1]==level+1){
- level=matrix[i][j+1];
- i=i;
- j=j+1;
- }
- if(matrix[i+1][j]==level+1){
- level=matrix[i+1][j];
- i=i+1;
- j=j;
- }
- }
- }
- }
- System.out.print(level);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement