結果

問題 No.307 最近色塗る問題多くない？
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-11-28 00:51:15
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 7,402 bytes
コンパイル時間 2,154 ms
コンパイル使用メモリ 120,424 KB
実行使用メモリ 32,112 KB
最終ジャッジ日時 2024-09-14 00:58:32
合計ジャッジ時間 5,035 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
23,984 KB
testcase_01 WA -
testcase_02 AC 28 ms
25,772 KB
testcase_03 AC 29 ms
25,776 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 33 ms
25,696 KB
testcase_11 AC 36 ms
25,860 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 46 ms
32,112 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 51 ms
31,840 KB
testcase_32 AC 43 ms
25,596 KB
testcase_33 WA -
testcase_34 AC 45 ms
27,636 KB
testcase_35 AC 46 ms
25,860 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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>();
                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 >= 0) continue;
                        if (set[nx * w + ny] == root)
                        {
                            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
0