結果
問題 | No.307 最近色塗る問題多くない? |
ユーザー | 紙ぺーぱー |
提出日時 | 2015-11-28 00:57:59 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 732 ms / 4,000 ms |
コード長 | 7,592 bytes |
コンパイル時間 | 2,560 ms |
コンパイル使用メモリ | 120,308 KB |
実行使用メモリ | 47,584 KB |
最終ジャッジ日時 | 2024-05-01 16:43:45 |
合計ジャッジ時間 | 8,760 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
27,968 KB |
testcase_01 | AC | 28 ms
27,608 KB |
testcase_02 | AC | 28 ms
25,900 KB |
testcase_03 | AC | 28 ms
25,704 KB |
testcase_04 | AC | 30 ms
25,696 KB |
testcase_05 | AC | 29 ms
27,956 KB |
testcase_06 | AC | 30 ms
28,088 KB |
testcase_07 | AC | 35 ms
28,032 KB |
testcase_08 | AC | 85 ms
34,996 KB |
testcase_09 | AC | 49 ms
34,296 KB |
testcase_10 | AC | 31 ms
27,800 KB |
testcase_11 | AC | 46 ms
38,664 KB |
testcase_12 | AC | 27 ms
25,796 KB |
testcase_13 | AC | 31 ms
25,904 KB |
testcase_14 | AC | 30 ms
25,820 KB |
testcase_15 | AC | 32 ms
27,900 KB |
testcase_16 | AC | 31 ms
23,860 KB |
testcase_17 | AC | 70 ms
30,232 KB |
testcase_18 | AC | 168 ms
32,544 KB |
testcase_19 | AC | 140 ms
34,664 KB |
testcase_20 | AC | 29 ms
28,012 KB |
testcase_21 | AC | 109 ms
37,280 KB |
testcase_22 | AC | 96 ms
34,156 KB |
testcase_23 | AC | 694 ms
45,572 KB |
testcase_24 | AC | 281 ms
47,584 KB |
testcase_25 | AC | 354 ms
46,916 KB |
testcase_26 | AC | 697 ms
45,584 KB |
testcase_27 | AC | 540 ms
45,024 KB |
testcase_28 | AC | 320 ms
46,956 KB |
testcase_29 | AC | 34 ms
27,868 KB |
testcase_30 | AC | 732 ms
47,508 KB |
testcase_31 | AC | 546 ms
47,080 KB |
testcase_32 | AC | 37 ms
25,740 KB |
testcase_33 | AC | 41 ms
27,924 KB |
testcase_34 | AC | 41 ms
25,616 KB |
testcase_35 | AC | 47 ms
27,916 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.Linq; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using Point = System.Numerics.Complex; namespace Program { public class Solver { public void Solve() { var h = sc.Integer(); var w = sc.Integer(); var a = Enumerate(h, x => sc.Integer(w)); var m = sc.Integer(); var set = new DisjointSet(h * w); int[] dx = { 1, 0, -1, 0 }; int[] dy = { 0, 1, 0, -1 }; for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { for (int k = 0; k < 4; k++) { var nx = i + dx[k]; var ny = j + dy[k]; if (nx < 0 || ny < 0 || nx >= h || ny >= w) continue; if (a[i][j] == a[nx][ny]) { set.Unite(i * w + j, nx * w + ny); } } } } for (int i = 0; i < m; i++) { var r = sc.Integer() - 1; var c = sc.Integer() - 1; var x = sc.Integer(); var pos = r * w + c; var root = set[pos]; var cnt = set.Size(pos); if (a[root / w][root % w] == x) continue; a[root / w][root % w] = x; if (cnt == h * w) continue; var q = new Queue<int>(); q.Enqueue(root); var s = new HashSet<int>(); var used = new bool[h * w]; used[root] = true; while (q.Any()) { var p = q.Dequeue(); var px = p / w; var py = p % w; for (int d = 0; d < 4; d++) { var nx = px + dx[d]; var ny = py + dy[d]; if (nx < 0 || nx >= h || ny < 0 || ny >= w) continue; if (used[nx * w + ny]) continue; if (set[nx * w + ny] == root) { used[nx * w + ny] = true; q.Enqueue(nx * w + ny); } else s.Add(set[nx * w + ny]); } } foreach (var u in s) set.Unite(u, root); } for (int i = 0; i < h; i++) { var s = new int[w]; for (int j = 0; j < w; j++) { var root = set[i * w + j]; s[j] = a[root / w][root % w]; } IO.Printer.Out.WriteLine(s.AsJoinedString()); } } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer : StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); } private T[] enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } static class Ex { static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region DisjointSet public class DisjointSet { public int[] par, ranks, count; public DisjointSet(int n) { par = new int[n]; count = new int[n]; for (int i = 0; i < n; i++) { par[i] = i; count[i] = 1; } ranks = new int[n]; } public int this[int id] { get { return (par[id] == id) ? id : this[par[id]]; } } public bool Unite(int x, int y) { x = this[x]; y = this[y]; if (x == y) return false; if (ranks[x] < ranks[y]) { par[x] = y; count[y] += count[x]; } else { par[y] = x; count[x] += count[y]; if (ranks[x] == ranks[y]) ranks[x]++; } return true; } public int Size(int x) { return count[this[x]]; } public bool IsUnited(int x, int y) { return this[x] == this[y]; } } #endregion