Hello_Java/J14890_1.java at master · cod0216/Hello_Java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
importjava.io.*;
importjava.util.*;


publicclassJ14890_1 {
staticintN, L, map[][];
publicstaticvoidmain(String[] args) throwsIOException {
BufferedReaderbuffer = newBufferedReader(newInputStreamReader(System.in));
String[] input = buffer.readLine().split(" ");
N = Integer.parseInt(input[0]);
L = Integer.parseInt(input[1]);

map = newint[N][N];
for(inti = 0; i< N; i++){
input = buffer.readLine().split(" ");
for(intj = 0; j< N; j++){
map[i][j] = Integer.parseInt(input[j]);
 }
 } //input end;

intans = 0;
for(inti = 0 ; i < N; i++){
if(col(i)) ans++;
if(row(i)) ans++;
 }

System.out.println(ans);
 }

publicstaticbooleancol(intnum) {
boolean[] incline = newboolean[N];
for(inti = 0 ; i < N-1; i++){
if(Math.abs(map[i][num]- map[i+1][num]) > 1)
returnfalse;
if(map[i][num] - map[i+1][num] == 1){
for(intj = 1 ; j <= L; j++){
if(i+j>=N || incline[i+j]) returnfalse;
if((map[i][num] -1) != map[i+j][num] ) returnfalse;
incline[i+j] = true;
 }
 }
elseif (map[i][num] - map[i+1][num] == -1){
for(intj = 0; j< L; j++){
if(i-j < 0 || incline[i-j]) returnfalse;
if(map[i][num] != map[i-j][num]) returnfalse;
incline[i-j]= true;
 }
 }
 }
returntrue;
 }
publicstaticbooleanrow(intnum) {
boolean[] incline = newboolean[N];
for(inti = 0 ; i < N-1; i++){
if(Math.abs(map[num][i] - map[num][i+1]) > 1) returnfalse;
if(map[num][i] - map[num][i+1] == 1){
for(intj = 1; j<=L; j++){
if(i+j >= N || incline[i+j]) returnfalse;
if(map[num][i]-map[num][i+j] != 1) returnfalse;
incline[i+j] = true;
 }
 }
elseif (map[num][i] - map[num][i+1] == -1){
for(intj = 0; j< L; j++){
if(i-j<0 || incline[i-j]) returnfalse;
if(map[num][i]-map[num][i-j] != 0 ) returnfalse;
incline[i-j] = true;
 }
 }
 }
returntrue;
 }
}