結果
問題 | No.179 塗り分け |
ユーザー | femto |
提出日時 | 2015-04-11 06:21:53 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,041 bytes |
コンパイル時間 | 2,003 ms |
コンパイル使用メモリ | 116,980 KB |
実行使用メモリ | 52,792 KB |
最終ジャッジ日時 | 2024-10-02 13:54:38 |
合計ジャッジ時間 | 11,948 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
19,072 KB |
testcase_01 | AC | 27 ms
18,816 KB |
testcase_02 | AC | 28 ms
18,816 KB |
testcase_03 | AC | 27 ms
18,944 KB |
testcase_04 | AC | 27 ms
18,816 KB |
testcase_05 | AC | 24 ms
18,816 KB |
testcase_06 | AC | 42 ms
23,040 KB |
testcase_07 | AC | 25 ms
19,072 KB |
testcase_08 | AC | 191 ms
38,760 KB |
testcase_09 | AC | 209 ms
39,960 KB |
testcase_10 | AC | 372 ms
42,888 KB |
testcase_11 | AC | 324 ms
44,688 KB |
testcase_12 | WA | - |
testcase_13 | AC | 30 ms
19,328 KB |
testcase_14 | WA | - |
testcase_15 | AC | 27 ms
18,944 KB |
testcase_16 | AC | 27 ms
19,072 KB |
testcase_17 | AC | 25 ms
18,944 KB |
testcase_18 | AC | 298 ms
42,908 KB |
testcase_19 | AC | 299 ms
43,868 KB |
testcase_20 | AC | 27 ms
18,944 KB |
testcase_21 | AC | 27 ms
18,944 KB |
testcase_22 | WA | - |
testcase_23 | AC | 291 ms
42,916 KB |
testcase_24 | WA | - |
testcase_25 | AC | 284 ms
42,632 KB |
testcase_26 | AC | 314 ms
43,024 KB |
testcase_27 | AC | 444 ms
42,840 KB |
testcase_28 | AC | 462 ms
42,788 KB |
testcase_29 | AC | 547 ms
42,972 KB |
testcase_30 | AC | 421 ms
42,672 KB |
testcase_31 | AC | 566 ms
42,824 KB |
testcase_32 | AC | 390 ms
42,736 KB |
testcase_33 | AC | 502 ms
42,840 KB |
testcase_34 | AC | 461 ms
42,988 KB |
testcase_35 | AC | 536 ms
42,844 KB |
testcase_36 | AC | 26 ms
18,944 KB |
testcase_37 | AC | 25 ms
18,944 KB |
testcase_38 | AC | 27 ms
19,200 KB |
testcase_39 | AC | 27 ms
18,944 KB |
testcase_40 | AC | 27 ms
19,072 KB |
testcase_41 | AC | 26 ms
18,688 KB |
testcase_42 | AC | 27 ms
18,816 KB |
testcase_43 | AC | 36 ms
23,168 KB |
testcase_44 | AC | 72 ms
23,040 KB |
testcase_45 | AC | 28 ms
19,584 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Diagnostics; using System.Collections.Generic; using System.Linq; using Enu = System.Linq.Enumerable; class Solution { int H, W; int[,] board; List<point> plist; void calc() { rio(out H, out W); board = new int[H, W]; plist = new List<point>(); for (int i = 0; i < H; i++) { var s = Console.ReadLine(); for (int j = 0; j < W; j++) { if (s[j] == '#') { board[i, j] = 1; plist.Add(new point(j, i)); } else board[i, j] = 0; } } if (plist.Count % 2 == 1 || plist.Count == 0) { Console.WriteLine("NO"); return; } bool ans = false; for (int dy = -H + 1; dy < H; dy++) { for (int dx = -W + 1; dx < W; dx++) { if (dx == 0 && dy == 0) continue; int[,] b = new int[H, W]; Array.Copy(board, b, H * W); for (int y = 0; y < H; y++) { for (int x = 0; x < W; x++) { if (b[y, x] == 0) continue; if (check(x, y, dx, dy)) { b[y, x] = 0; b[y + dy, x + dx] = 0; } } } ans = ans || b.ToJagArray().All(a => a.All(e => e == 0)); } } Console.WriteLine(ans ? "YES" : "NO"); } bool check(int x, int y, int dx, int dy) { int xx = x + dx, yy = y + dy; return 0 <= xx && xx < W && 0 <= yy && yy < H && board[yy, xx] == 1; } static void Main(string[] args) { new Solution().calc(); } #region static int ri() { return int.Parse(Console.ReadLine()); } static int[] ria(int n) { if (n <= 0) { Console.ReadLine(); return new int[0]; } else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray(); } static void rio(out int p1) { p1 = ri(); } static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; } static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; } static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; } static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; } static long rl() { return long.Parse(Console.ReadLine()); } static long[] rla(int n) { if (n <= 0) { Console.ReadLine(); return new long[0]; } else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray(); } static void rlo(out long p1) { p1 = rl(); } static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; } static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; } static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; } static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; } static double rd() { return double.Parse(Console.ReadLine()); } static double[] rda(int n) { if (n <= 0) { Console.ReadLine(); return new double[0]; } else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray(); } static void rdo(out double p1) { p1 = rd(); } static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; } static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; } static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; } static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; } static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; } static void wa1<T>(T[] a) { Debug.WriteLine(string.Join(" ", a)); } static void wa2<T>(T[][] a) { foreach (var row in a) { Debug.WriteLine(String.Join(" ", row)); } } [DebuggerDisplay("{x} , {y}")] class point { public int x, y; public point(int x, int y) { this.x = x; this.y = y; } } #endregion } static class Extention { public static T[][] ToJagArray<T>(this T[,] a) { int n = a.GetLength(0), m = a.GetLength(1); var ret = new T[n][]; for (int i = 0; i < n; i++) { ret[i] = new T[m]; for (int j = 0; j < m; j++) { ret[i][j] = a[i, j]; } } return ret; } }