結果
問題 | No.307 最近色塗る問題多くない? |
ユーザー | くれちー |
提出日時 | 2017-08-18 01:55:05 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,419 bytes |
コンパイル時間 | 2,670 ms |
コンパイル使用メモリ | 109,372 KB |
実行使用メモリ | 41,784 KB |
最終ジャッジ日時 | 2023-08-14 04:17:51 |
合計ジャッジ時間 | 11,255 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 62 ms
21,500 KB |
testcase_01 | AC | 63 ms
21,692 KB |
testcase_02 | AC | 63 ms
21,792 KB |
testcase_03 | AC | 63 ms
21,472 KB |
testcase_04 | AC | 74 ms
24,100 KB |
testcase_05 | AC | 72 ms
22,048 KB |
testcase_06 | AC | 71 ms
24,008 KB |
testcase_07 | AC | 86 ms
27,296 KB |
testcase_08 | AC | 150 ms
34,528 KB |
testcase_09 | AC | 101 ms
27,612 KB |
testcase_10 | AC | 79 ms
26,692 KB |
testcase_11 | AC | 93 ms
30,808 KB |
testcase_12 | AC | 64 ms
23,692 KB |
testcase_13 | WA | - |
testcase_14 | AC | 74 ms
22,228 KB |
testcase_15 | AC | 76 ms
22,376 KB |
testcase_16 | AC | 75 ms
22,228 KB |
testcase_17 | AC | 119 ms
27,072 KB |
testcase_18 | AC | 211 ms
31,640 KB |
testcase_19 | AC | 193 ms
28,408 KB |
testcase_20 | AC | 74 ms
22,136 KB |
testcase_21 | AC | 168 ms
28,644 KB |
testcase_22 | AC | 157 ms
28,748 KB |
testcase_23 | AC | 821 ms
28,584 KB |
testcase_24 | AC | 354 ms
26,476 KB |
testcase_25 | AC | 501 ms
39,172 KB |
testcase_26 | AC | 923 ms
41,252 KB |
testcase_27 | AC | 126 ms
35,080 KB |
testcase_28 | AC | 167 ms
39,956 KB |
testcase_29 | AC | 107 ms
32,788 KB |
testcase_30 | AC | 941 ms
39,864 KB |
testcase_31 | AC | 157 ms
41,744 KB |
testcase_32 | AC | 152 ms
41,784 KB |
testcase_33 | AC | 101 ms
28,644 KB |
testcase_34 | AC | 154 ms
41,752 KB |
testcase_35 | AC | 158 ms
37,740 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.Collections.Generic; using System.IO; using System.Linq; using System.Numerics; using System.Text; using static System.Console; using static System.Convert; using static System.Math; using static Extentions; class IO { int idx; string[] input = In.ReadToEnd().Split(new[] { " ", "\n", "\r" }, StringSplitOptions.RemoveEmptyEntries); T Get<T>(Func<string, T> parser) => parser(input[idx++]); public string S => Get(s => s); public char C => Get(char.Parse); public int I => Get(int.Parse); public long L => Get(long.Parse); public double F => Get(double.Parse); public decimal D => Get(decimal.Parse); public BigInteger B => Get(BigInteger.Parse); T[] Gets<T>(int n, Func<string, T> parser) => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray(); public string[] Ss(int n) => Gets(n, s => s); public char[] Cs(int n) => Gets(n, char.Parse); public int[] Is(int n) => Gets(n, int.Parse); public long[] Ls(int n) => Gets(n, long.Parse); public double[] Fs(int n) => Gets(n, double.Parse); public decimal[] Ds(int n) => Gets(n, decimal.Parse); public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse); public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs)); public void Write(params object[] xs) => WriteLine(string.Join(" ", xs)); } #region Library static partial class Extentions { } #endregion static class Program { public static void Main() { var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" }; #if DEBUG sw.AutoFlush = true; #else sw.AutoFlush = false; #endif SetOut(sw); Solve(new IO()); Out.Flush(); } static void Solve(IO io) { var h = io.I; var w = io.I; var a = new bool[h * w]; for (var i = 0; i < h * w; i++) a[i] = ToBoolean(io.I); var d = new[] { -w, 1, w, -1 }; var queue = new Queue<int>(); var colored = a.Count(t => t); var q = io.I; var p = new int[q]; var x = new bool[q]; for (var i = 0; i < q; i++) { p[i] = (io.I - 1) * w + (io.I - 1); x[i] = ToBoolean(io.I); } for (var i = 0; i < q; i++) { if (colored == 0 || colored == h * w) { a = Enumerable.Repeat(x[q - 1], h * w).ToArray(); break; } if (a[p[i]] == x[i]) continue; a[p[i]] = x[i]; colored += x[i] ? 1 : -1; queue.Enqueue(p[i]); while (queue.Any()) { var p2 = queue.Dequeue(); for (var j = 0; j < 4; j++) { if (p2 % w == w - 1 && d[j] == 1) continue; if (p2 % w == 0 && d[j] == -1) continue; var p3 = p2 + d[j]; if (p3 < 0 || h * w <= p3) continue; if (a[p3] == !x[i]) { a[p3] = x[i]; colored += x[i] ? 1 : -1; queue.Enqueue(p3); } } } } for (var i = 0; i < h * w; i++) { Write(a[i] ? 1 : 0); Write(" "); if (i % w == w - 1) WriteLine(); } } }