Submission #41881

ソースコード

?
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
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
public class Main {
private static final InputStream in = System.in;
private static final PrintWriter out = new PrintWriter(System.out);
private static int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
private static int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
private static int INF = 1 << 29;
private static char[][] map;
public static void main(String[] args) {
// This is from IntelliJ IDEA
int h = fgetInt();
int w = fgetInt();
int q = fgetInt();
map = new char[h+10][w+10];
UnionFind unionFind = new UnionFind((h + 10) * (w + 10));
for ( int i = 0; i < h; i++ ) {
map[i] = fgetStr().toCharArray();
for ( int j = 0; j < w; j++ ) {
if ( map[i][j] == '#' ) {
if ( isMovable(j-1, i, w, h) && map[i][j-1] == '#' ) {
unionFind.unite(getIndex(w, j, i), getIndex(w, j-1, i));
}
if ( isMovable(j, i-1, w, h) && map[i-1][j] == '#' ) {
unionFind.unite(getIndex(w, j, i), getIndex(w, j, i-1));
}
}
}
}
for ( int i = 0; i < q; i++ ) {
int command = fgetInt();
int y = fgetInt();
int x = fgetInt();
y--; x--;
if ( command == 0 ) {
map[y][x] = '#';
for ( int j = 0; j < 4; j++ ) {
int ny = y + dy[j];
int nx = x + dx[j];
if ( isMovable(nx, ny, w, h) && map[ny][nx] == '#' ) {
unionFind.unite(getIndex(w, x, y), getIndex(w, nx, ny));
}
}
}
else {
iprint( map[y][x] == '#' ? unionFind.getSize(getIndex(w, x, y)) : 0 );
}
}
ifin();
}
private static long gcd(long x, long y) {
return x % y == 0 ? y : gcd(y, x % y);
}
private static long lcm(long x, long y) {
return ( x / gcd(x, y) * y);
}
private static boolean isMovable( int x, int y, int w, int h ) {
return ( x >= 0 && y >= 0 && x < w && y < h );
}
private static int getIndex( int w, int x, int y ) {
return (w*y) + x;
}
private static String fgetStr(){
return next();
}
private static String fgetLine(){
return nextLine();
}
private static char fgetChar(){
return fgetStr().charAt(0);
}
private static int fgetInt(){
return nextInt();
}
private static long fgetLong(){
return nextLong();
}
private static double fgetDouble(){
return nextDouble();
}
private static BigInteger fgetBig(){
return new BigInteger(fgetStr());
}
private static String reverseStr(String str){
StringBuffer sb = new StringBuffer(str);
return sb.reverse().toString();
}
private static void iprint(Object a){
out.println(a);
}
private static void iprintf(Object a){
out.print(a);
}
private static void ifin(){
out.flush();
}
private static final byte[] buffer = new byte[1024];
private static int ptr = 0;
private static int buflen = 0;
private static boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch ( IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private static int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
private static boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
private static String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static String nextLine() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b) || b == 32) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
private static int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
private static double nextDouble() {
return Double.parseDouble(next());
}
}
class Pair implements Comparable<Pair> {
int first, second, third;
public Pair(int a, int b, int c) {
this.first = a;
this.second = b;
this.third = c;
}
@Override
public int compareTo(Pair pair) {
if ( this.first == pair.first ) {
return pair.second - this.second;
}
return pair.first - this.first;
}
}
class UnionFind {
private int[] parent;
private int[] sizes;
public UnionFind(int n) {
parent = new int[n+5];
sizes = new int[n+5];
for (int i = 0; i < n; i++) {
parent[i] = i;
sizes[i] = 1;
}
}
public void unite(int x, int y) {
int rootX = getRoot(x);
int rootY = getRoot(y);
if ( !isUnited(rootX, rootY) ) {
sizes[rootY] += sizes[rootX];
parent[rootX] = rootY;
}
}
public int getRoot(int i) {
if (i != parent[i]) {
parent[i] = getRoot(parent[i]);
}
return parent[i];
}
public int getSize(int n) {
return sizes[getRoot(n)];
}
public boolean isUnited(int x, int y) {
return getRoot(x) == getRoot(y);
}
}

ステータス

項目 データ
問題 0971 - 島の創造
ユーザー名 r1825
投稿日時 2018-08-25 11:06:40
言語 Java
状態 Accepted
得点 10
ソースコード長 7280 Byte
最大実行時間 305 ms
最大メモリ使用量 75016 KB

セット

セット 得点 Cases
1 Easy 1 / 1 *easy, *sample*
2 ALL 9 / 9 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
input-sample1 AC 92 ms 13160 KB
1
2
input-sample2 AC 81 ms 13100 KB
1
2
input01-easy AC 86 ms 12704 KB
1
2
input02-easy AC 92 ms 12772 KB
1
2
input03-easy AC 94 ms 13228 KB
1
2
input04 AC 270 ms 33020 KB
2
input05 AC 216 ms 34952 KB
2
input06 AC 243 ms 38200 KB
2
input07 AC 263 ms 42972 KB
2
input08 AC 266 ms 54448 KB
2
input09 AC 305 ms 60556 KB
2
input10 AC 288 ms 65832 KB
2
input11 AC 272 ms 69608 KB
2
input12 AC 224 ms 75016 KB
2
input13 AC 92 ms 56248 KB
2
input14 AC 86 ms 56052 KB
2