結果
問題 | No.179 塗り分け |
ユーザー | tutuz |
提出日時 | 2018-09-14 21:21:48 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 276 ms / 3,000 ms |
コード長 | 3,751 bytes |
コンパイル時間 | 4,890 ms |
コンパイル使用メモリ | 77,984 KB |
実行使用メモリ | 54,612 KB |
最終ジャッジ日時 | 2024-07-23 14:53:47 |
合計ジャッジ時間 | 11,615 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
50,416 KB |
testcase_01 | AC | 54 ms
50,040 KB |
testcase_02 | AC | 53 ms
50,184 KB |
testcase_03 | AC | 54 ms
50,524 KB |
testcase_04 | AC | 53 ms
50,396 KB |
testcase_05 | AC | 54 ms
50,228 KB |
testcase_06 | AC | 81 ms
50,804 KB |
testcase_07 | AC | 56 ms
50,172 KB |
testcase_08 | AC | 55 ms
50,204 KB |
testcase_09 | AC | 60 ms
50,412 KB |
testcase_10 | AC | 121 ms
53,908 KB |
testcase_11 | AC | 111 ms
54,260 KB |
testcase_12 | AC | 231 ms
54,372 KB |
testcase_13 | AC | 56 ms
50,528 KB |
testcase_14 | AC | 55 ms
50,604 KB |
testcase_15 | AC | 53 ms
50,168 KB |
testcase_16 | AC | 54 ms
50,288 KB |
testcase_17 | AC | 53 ms
50,160 KB |
testcase_18 | AC | 148 ms
54,140 KB |
testcase_19 | AC | 153 ms
54,240 KB |
testcase_20 | AC | 55 ms
50,384 KB |
testcase_21 | AC | 56 ms
50,172 KB |
testcase_22 | AC | 264 ms
54,520 KB |
testcase_23 | AC | 177 ms
54,612 KB |
testcase_24 | AC | 235 ms
54,216 KB |
testcase_25 | AC | 175 ms
54,368 KB |
testcase_26 | AC | 153 ms
54,120 KB |
testcase_27 | AC | 250 ms
54,288 KB |
testcase_28 | AC | 176 ms
54,240 KB |
testcase_29 | AC | 267 ms
54,392 KB |
testcase_30 | AC | 139 ms
53,948 KB |
testcase_31 | AC | 276 ms
54,500 KB |
testcase_32 | AC | 147 ms
54,028 KB |
testcase_33 | AC | 264 ms
54,148 KB |
testcase_34 | AC | 162 ms
54,152 KB |
testcase_35 | AC | 275 ms
53,988 KB |
testcase_36 | AC | 55 ms
50,580 KB |
testcase_37 | AC | 54 ms
50,492 KB |
testcase_38 | AC | 53 ms
50,152 KB |
testcase_39 | AC | 54 ms
50,224 KB |
testcase_40 | AC | 54 ms
50,400 KB |
testcase_41 | AC | 54 ms
50,392 KB |
testcase_42 | AC | 54 ms
50,308 KB |
testcase_43 | AC | 82 ms
51,408 KB |
testcase_44 | AC | 120 ms
54,032 KB |
testcase_45 | AC | 57 ms
50,544 KB |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.OutputStream; import java.io.PrintWriter; import java.util.InputMismatchException; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskX solver = new TaskX(); solver.solve(1, in, out); out.close(); } static int INF = 1 << 30; static long LINF = 1L << 55; static int MOD = 1000000007; static int[] mh4 = { 0, -1, 1, 0 }; static int[] mw4 = { -1, 0, 0, 1 }; static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 }; static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static class TaskX { int n, m; public void solve(int testNumber, InputReader in, PrintWriter out) { n = in.nextInt(); m = in.nextInt(); char[][] s = new char[n][m]; for (int i = 0; i < n; i++) { s[i] = in.nextString().toCharArray(); } int cnt = 0; for (char[] cs : s) { for (char c : cs) { cnt += c == '#' ? 1 : 0; } } if (cnt % 2 == 1 || cnt == 0) { out.println("NO"); return; } for (int i = -n+1; i < n; i++) { for (int j = -m+1; j < m; j++) { if (check(s, i, j, cnt)) { out.println("YES"); return; } } } out.println("NO"); } boolean check(char[][] s, int i, int j, int count) { int tmp = 0; boolean[][] used = new boolean[n][m]; for (int a = 0; a < n; a++) { for (int b = 0; b < m; b++) { if (a + i < 0 || b + j < 0 || a + i >= n || b + j >= m) { continue; } if (used[a][b] || used[a+i][b+j] || s[a][b] == '.' || s[a+i][b+j] == '.') { continue; } used[a][b] = used[a+i][b+j] = true; tmp += 2; } } return count == tmp; } } static class InputReader { BufferedReader in; StringTokenizer tok; public String nextString() { while (!tok.hasMoreTokens()) { try { tok = new StringTokenizer(in.readLine(), " "); } catch (IOException e) { throw new InputMismatchException(); } } return tok.nextToken(); } public int nextInt() { return Integer.parseInt(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } public InputReader(InputStream inputStream) { in = new BufferedReader(new InputStreamReader(inputStream)); tok = new StringTokenizer(""); } } }