結果

問題 No.697 池の数はいくつか
ユーザー GrenacheGrenache
提出日時 2018-09-22 12:00:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,717 ms / 6,000 ms
コード長 5,884 bytes
コンパイル時間 4,210 ms
コンパイル使用メモリ 80,416 KB
実行使用メモリ 170,008 KB
最終ジャッジ日時 2024-11-08 08:05:42
合計ジャッジ時間 18,742 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,920 KB
testcase_01 AC 51 ms
36,800 KB
testcase_02 AC 50 ms
36,916 KB
testcase_03 AC 50 ms
36,924 KB
testcase_04 AC 51 ms
36,824 KB
testcase_05 AC 51 ms
37,272 KB
testcase_06 AC 51 ms
36,892 KB
testcase_07 AC 52 ms
36,792 KB
testcase_08 AC 49 ms
37,080 KB
testcase_09 AC 49 ms
37,224 KB
testcase_10 AC 51 ms
37,028 KB
testcase_11 AC 51 ms
37,236 KB
testcase_12 AC 50 ms
37,104 KB
testcase_13 AC 50 ms
36,684 KB
testcase_14 AC 50 ms
37,068 KB
testcase_15 AC 48 ms
37,132 KB
testcase_16 AC 49 ms
37,052 KB
testcase_17 AC 49 ms
36,784 KB
testcase_18 AC 49 ms
37,332 KB
testcase_19 AC 49 ms
37,208 KB
testcase_20 AC 53 ms
37,276 KB
testcase_21 AC 49 ms
36,792 KB
testcase_22 AC 49 ms
37,052 KB
testcase_23 AC 49 ms
37,128 KB
testcase_24 AC 427 ms
50,512 KB
testcase_25 AC 390 ms
50,164 KB
testcase_26 AC 440 ms
50,236 KB
testcase_27 AC 431 ms
50,260 KB
testcase_28 AC 382 ms
50,004 KB
testcase_29 AC 1,702 ms
170,008 KB
testcase_30 AC 1,410 ms
87,444 KB
testcase_31 AC 1,717 ms
169,708 KB
testcase_32 AC 1,407 ms
85,876 KB
testcase_33 AC 1,398 ms
84,952 KB
testcase_34 AC 1,379 ms
88,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder697 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
//		4近傍
		int[] dx = { 1, 0, -1, 0 };
		int[] dy = { 0, 1, 0, -1 };

		int h = sc.nextInt();
		int w = sc.nextInt();

		BitSet a = new BitSet(h * w);
		for (int i = 0; i < h; i++) {
			char[] tmp = sc.nextLine().toCharArray();
			for (int j = 0; j < w; j++) {
				if (tmp[j * 2] == '1') {
					a.set(i * w + j);
				}
			}
		}

		int cnt = 0;
		BitSet used = new BitSet(h * w);
		Deque<Integer> st = new ArrayDeque<>(h * w);
		
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				int index = i * w + j;
				if (!used.get(index) && a.get(index)) {
					cnt++;

					used.set(index);
					st.clear();
					st.push(i * 10000 + j);
					while (!st.isEmpty()) {
						int e = st.pop();
						int x = e % 10000;
						int y = e / 10000;
						
						for (int k = 0; k < 4; k++) {
							int nextx = x + dx[k];
							int nexty = y + dy[k];
							int nindex = nexty * w + nextx;
							
							if (nextx < 0 || nextx >= w || nexty < 0 || nexty >= h) {
								continue;
							}
							if (used.get(nindex) || !a.get(nindex)) {
								continue;
							}

							used.set(nindex);
							st.push(nexty * 10000 + nextx);
						}
					}
				}
			}
		}

		pr.println(cnt);
	}

	static class Pair implements Comparable<Pair> {
		int a;
		int b;

		Pair(int a, int b) {
			this.a = a;
			this.b = b;
		}

		@Override
		public int compareTo(Pair o) {
			if (a == o.a) {
				return Integer.compare(b, o.b);
			}

			return Integer.compare(a, o.a);
		}

		@Override
		public int hashCode() {
			return Integer.hashCode(a + b);
		}

		@Override
		public boolean equals(Object obj) {
			Pair o = (Pair) obj;
			return a == o.a && b == o.b;
		}

		@Override
		public String toString() {
			// [xxx, xxxx]
			StringBuilder stmp = new StringBuilder(32);
			stmp.append('[');
			stmp.append(a);
			stmp.append(',');
			stmp.append(' ');
			stmp.append(b);
			stmp.append(']');

			return stmp.toString();
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(INPUT == null ? System.in : new ByteArrayInputStream(INPUT.getBytes()));
		pr = new Printer(System.out);

		solve();

//		pr.close();
		pr.flush();
//		sc.close();
	}

	static String INPUT = null;

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(OutputStream out) {
			super(out);
		}
	}
}
0