-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q2578.java
87 lines (76 loc) · 2.1 KB
/
Q2578.java
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
package olympiad;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
public class Q2578 {
private static final int SIZE = 5;
private static final int LINE = 3;
private static int map[][] = new int[SIZE][SIZE];
private static boolean visited[][] = new boolean[SIZE][SIZE];
private static boolean isBingGo(){
int lines = 0;
for (int i = 0; i < SIZE; i++) { //행, 열방향 체크
boolean isLineRow = true;
boolean isLineCol = true;
for (int j = 0; j < SIZE; j++) {
if(!visited[i][j])
isLineRow = false;
if(!visited[j][i])
isLineCol = false;
}
if(isLineRow)
lines++;
if(isLineCol)
lines++;
}
boolean isLineDiag = true;
boolean isLineRevDiag = true;
for (int i = 0; i < SIZE; i++) { //대각선 체크
if(!visited[i][i])
isLineDiag = false;
if(!visited[i][SIZE - 1 - i])
isLineRevDiag = false;
}
if(isLineDiag)
lines++;
if(isLineRevDiag)
lines++;
return lines >= LINE;
}
private static void mark(int value){
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
if(map[i][j] == value)
visited[i][j] = true;
}
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st;
//inputs
for (int i = 0; i < SIZE; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < SIZE; j++)
map[i][j] = Integer.parseInt(st.nextToken());
}
for (int i = 0; i < SIZE; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 1; j <= SIZE; j++) {
mark(Integer.parseInt(st.nextToken()));
if(i * SIZE + j >= SIZE * LINE - LINE){
if(isBingGo()){
bw.write((i * SIZE + j) + "\n");
br.close();
bw.close();
return;
}
}
}
}
}
}