-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathKindOfPeople.java
More file actions
199 lines (167 loc) · 4.98 KB
/
KindOfPeople.java
File metadata and controls
199 lines (167 loc) · 4.98 KB
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
import java.io.BufferedReader;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.*;
public class KindOfPeople {
public static void main(String[] args) {
FastIO fio = new FastIO();
int r = fio.nextInt();
int c = fio.nextInt();
Node[][] map = new Node[r][c];
// int[][] p = new int [r][c];
for (int i = 0 ; i < r ; i++) {
String input = fio.nextLine();
for (int j = 0; j < c ; j ++) {
map[i][j] = new Node(input.charAt(j),i,j);
// p[i][j] = -1;
}
}
int area = 0;
Queue<Node> q = new LinkedList<>();
for (int k = 0; k < r ; k ++ ){
for (int j = 0; j < c ; j++) {
Node now = map[k][j];
if (now.visited == false) {
now.visit();
now.setArea(area);
q.offer(now);
while (q.size() != 0) {
Node current = q.poll();
// fio.println(current);
int[][] move = {{-1,0}, {1,0}, {0,-1}, {0,1}};
for (int i = 0; i < move.length; i++) {
int thisRow = current.getR();
int thisCol = current.getC();
int nextRow = current.getR() + move[i][0];
int nextCol = current.getC() + move[i][1];
if ( nextRow >= r || nextRow < 0 || nextCol < 0 || nextCol >= c) {
continue;
}
Node next = map[nextRow][nextCol];
if (next.visited == false && next.value == current.value) {
next.visit();
next.setArea(current.area);
q.offer(next);
}
}
}
area++;
}
}
}
int n = fio.nextInt();
for (int i = 0; i < n ; i ++) {
int r1 = fio.nextInt() - 1;
int c1 = fio.nextInt() - 1;
int r2 = fio.nextInt() - 1;
int c2 = fio.nextInt() - 1;
Node source = map[r1][c1];
Node dest = map[r2][c2];
if (source.value == '1' && dest.value == '1') {
if (source.area == dest.area) {
fio.println("decimal");
} else {
fio.println("neither");
}
} else if (source.value == '0' && dest.value == '0') {
if (source.area == dest.area) {
fio.println("binary");
} else {
fio.println("neither");
}
} else {
fio.println("neither");
}
// fio.println("source value is " +source.value +" dest value is " + dest.value);
// fio.println("source area is " + source.area + " dest area is " + dest.area);
}
fio.close();
}
}
class Node {
public char value;
int i;
int j;
public boolean visited = false;
public int area;
Node(char value, int i, int j) {
this.value = value;
this.i = i;
this.j = j;
this.area = area;
}
public void visit() {
this.visited = true;
}
public void setArea(int area) {
this.area = area;
}
public int getR() {
return i;
}
public int getC() {
return j;
}
@Override
public String toString() {
return "(" + value + " " + i + " " + j + " " + area + ") " + visited;
}
}
/**
* Fast I/O
* @source https://www.geeksforgeeks.org/fast-io-in-java-in-competitive-programming/
*/
class FastIO extends PrintWriter
{
BufferedReader br;
StringTokenizer st;
public FastIO()
{
super(new BufferedOutputStream(System.out));
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
}