結果
問題 | No.697 池の数はいくつか |
ユーザー | Daigo HIROOKA |
提出日時 | 2018-06-23 03:43:36 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 832 ms / 6,000 ms |
コード長 | 3,714 bytes |
コンパイル時間 | 4,702 ms |
コンパイル使用メモリ | 78,204 KB |
実行使用メモリ | 121,520 KB |
最終ジャッジ日時 | 2024-04-25 20:10:53 |
合計ジャッジ時間 | 13,551 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
50,192 KB |
testcase_01 | AC | 46 ms
50,180 KB |
testcase_02 | AC | 45 ms
50,568 KB |
testcase_03 | AC | 45 ms
50,164 KB |
testcase_04 | AC | 49 ms
50,212 KB |
testcase_05 | AC | 50 ms
50,016 KB |
testcase_06 | AC | 48 ms
50,144 KB |
testcase_07 | AC | 50 ms
50,104 KB |
testcase_08 | AC | 51 ms
50,096 KB |
testcase_09 | AC | 50 ms
49,904 KB |
testcase_10 | AC | 49 ms
50,004 KB |
testcase_11 | AC | 47 ms
49,616 KB |
testcase_12 | AC | 48 ms
49,772 KB |
testcase_13 | AC | 48 ms
50,184 KB |
testcase_14 | AC | 47 ms
49,996 KB |
testcase_15 | AC | 47 ms
50,036 KB |
testcase_16 | AC | 49 ms
49,820 KB |
testcase_17 | AC | 49 ms
50,180 KB |
testcase_18 | AC | 47 ms
49,780 KB |
testcase_19 | AC | 45 ms
49,788 KB |
testcase_20 | AC | 53 ms
50,124 KB |
testcase_21 | AC | 49 ms
50,140 KB |
testcase_22 | AC | 51 ms
49,932 KB |
testcase_23 | AC | 51 ms
50,104 KB |
testcase_24 | AC | 223 ms
61,592 KB |
testcase_25 | AC | 209 ms
61,808 KB |
testcase_26 | AC | 227 ms
61,744 KB |
testcase_27 | AC | 207 ms
61,840 KB |
testcase_28 | AC | 225 ms
61,872 KB |
testcase_29 | AC | 768 ms
121,008 KB |
testcase_30 | AC | 720 ms
121,128 KB |
testcase_31 | AC | 832 ms
121,492 KB |
testcase_32 | AC | 724 ms
121,520 KB |
testcase_33 | AC | 692 ms
121,172 KB |
testcase_34 | AC | 703 ms
121,180 KB |
ソースコード
// This is completely copied from answer #264206 // I think the given time limit is a little strict ... import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.Scanner; public class No697 implements Runnable { public static void main(String[] args) { new Thread(null, new No697(), "", Runtime.getRuntime().maxMemory()).run(); } class DJSet { int n; int[] upper; public DJSet(int n_) { n = n_; upper = new int[n]; Arrays.fill(upper, -1); } int root(int x) { return upper[x] < 0 ? x : (upper[x] = root(upper[x])); } boolean equiv(int x, int y) { return root(x) == root(y); } void setUnion(int x, int y) { x = root(x); y = root(y); if (x == y) return; if (upper[x] > upper[y]) { x ^= y; y ^= x; x ^= y; } upper[x] += upper[y]; upper[y] = x; } } public void run() { FastScanner sc = new FastScanner(); int H = sc.nextInt(); int W = sc.nextInt(); DJSet ds = new DJSet(H * W); int[][] A = new int[H][W]; for (int i = 0; i < H; ++i) { for (int j = 0; j < W; ++j) { A[i][j] = sc.nextInt(); } } for (int i = 0; i < H; ++i) { for (int j = 0; j < W; ++j) { if (A[i][j] != 1) continue; for (int di = -1; di <= 1; ++di) { for (int dj = -1; dj <= 1; ++dj) { if (Math.abs(di) + Math.abs(dj) != 1) continue; int ni = i + di; int nj = j + dj; if (ni < 0 || nj < 0 || ni >= H || nj >= W) continue; if (A[ni][nj] != 1) continue; ds.setUnion(i * W + j, ni * W + nj); } } } } int cnt = 0; for (int i = 0; i < H; ++i) { for (int j = 0; j < W; ++j) { if (A[i][j] == 1 && i * W + j == ds.root(i * W + j)) ++cnt; } } System.out.println(cnt); } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private 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 int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public 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(); } public 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(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } } void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }