結果

問題 No.697 池の数はいくつか
ユーザー sekiya9311sekiya9311
提出日時 2018-06-16 16:53:25
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 4,335 ms / 6,000 ms
コード長 9,827 bytes
コンパイル時間 1,089 ms
コンパイル使用メモリ 120,708 KB
実行使用メモリ 67,644 KB
最終ジャッジ日時 2024-04-25 20:10:03
合計ジャッジ時間 28,341 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
24,808 KB
testcase_01 AC 27 ms
25,320 KB
testcase_02 AC 28 ms
25,320 KB
testcase_03 AC 25 ms
24,912 KB
testcase_04 AC 26 ms
25,260 KB
testcase_05 AC 27 ms
27,080 KB
testcase_06 AC 27 ms
26,960 KB
testcase_07 AC 26 ms
25,060 KB
testcase_08 AC 25 ms
25,068 KB
testcase_09 AC 26 ms
24,784 KB
testcase_10 AC 25 ms
22,964 KB
testcase_11 AC 26 ms
23,088 KB
testcase_12 AC 25 ms
24,876 KB
testcase_13 AC 25 ms
25,260 KB
testcase_14 AC 24 ms
24,936 KB
testcase_15 AC 25 ms
24,932 KB
testcase_16 AC 26 ms
25,064 KB
testcase_17 AC 26 ms
27,084 KB
testcase_18 AC 25 ms
25,268 KB
testcase_19 AC 25 ms
27,092 KB
testcase_20 AC 26 ms
25,264 KB
testcase_21 AC 26 ms
25,168 KB
testcase_22 AC 26 ms
25,056 KB
testcase_23 AC 25 ms
25,168 KB
testcase_24 AC 440 ms
50,124 KB
testcase_25 AC 417 ms
49,560 KB
testcase_26 AC 430 ms
51,604 KB
testcase_27 AC 417 ms
51,604 KB
testcase_28 AC 429 ms
51,604 KB
testcase_29 AC 4,275 ms
67,644 KB
testcase_30 AC 3,528 ms
60,088 KB
testcase_31 AC 4,335 ms
67,516 KB
testcase_32 AC 3,544 ms
58,300 KB
testcase_33 AC 3,417 ms
58,572 KB
testcase_34 AC 3,416 ms
62,488 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.Collections.Generic;
using System.Linq;
using System.Text;

namespace ProgrammingContest
{
    class Writer : IDisposable
    {
        private readonly System.IO.TextWriter writer;
        private StringBuilder sb;
        private readonly bool isReactive;
        public Writer(string path)
            : this(new System.IO.StreamWriter(path))
        {
        }
        public Writer(bool isReactive)
            : this(null, isReactive)
        {
        }
        public Writer(System.IO.TextWriter writer = null,
                        bool isReactive = false)
        {
            this.writer = (writer ?? Console.Out);
            this.isReactive = isReactive;
            if (!this.isReactive)
            {
                this.sb = new StringBuilder();
            }
        }
        public void Dispose()
        {
            if (!this.isReactive)
            {
                this.writer.Write(sb.ToString());
            }
            if (!this.writer.Equals(Console.Out))
            {
                this.writer.Dispose();
            }
        }
        public void Write(object val)
        {
            if (this.isReactive)
            {
                this.writer.Write(val.ToString());
                this.writer.Flush();
            }
            else
            {
                this.sb.Append(val.ToString());
            }
        }
        public void Write(string format, params object[] vals)
        {
            if (this.isReactive)
            {
                this.writer.Write(format, vals);
                this.writer.Flush();
            }
            else
            {
                this.sb.AppendFormat(format, vals);
            }
        }
        public void WriteLine(object val = null)
        {
            this.Write((val ?? string.Empty).ToString() + System.Environment.NewLine);
        }
        public void WriteLine(int val)
        {
            this.WriteLine(val.ToString());
        }
        public void WriteLine(long val)
        {
            this.WriteLine(val.ToString());
        }
        public void WriteLine(string val)
        {
            this.WriteLine((object)val);
        }
        public void WriteLine(string format, params object[] vals)
        {
            this.Write(format + System.Environment.NewLine, vals);
        }
    }

    class Scanner : IDisposable
    {
        private readonly Queue<string> buffer;
        private readonly char[] sep;
        private readonly System.IO.TextReader reader;
        public Scanner(string path, char[] sep = null)
            : this(new System.IO.StreamReader(path), sep)
        {
        }
        public Scanner(System.IO.TextReader reader = null,
                        char[] sep = null)
        {
            this.buffer = new Queue<string>();
            this.sep = (sep ?? new char[] { ' ' });
            this.reader = (reader ?? Console.In);
        }
        private void CheckBuffer()
        {
            if (this.buffer.Count == 0 && this.reader.Peek() != -1)
            {
                string str = string.Empty;
                for (; string.IsNullOrEmpty(str);
                    str = this.reader.ReadLine()) ;

                str.Split(this.sep).ToList()
                   .ForEach(el => this.buffer.Enqueue(el));
            }
        }

        public void Dispose()
        {
            if (!this.reader.Equals(Console.In))
            {
                this.reader.Dispose();
            }
        }

        public string Next
        {
            get
            {
                this.CheckBuffer();
                return this.buffer.Dequeue();
            }
        }
        public string[] GetStringArray(int N)
        {
            return Enumerable.Range(0, N)
                             .Select(e => this.Next)
                             .ToArray();
        }

        public int NextInt
        {
            get
            {
                return int.Parse(this.Next);
            }
        }
        public int[] GetIntArray(int N)
        {
            return Enumerable.Range(0, N)
                             .Select(e => this.NextInt)
                             .ToArray();
        }

        public double NextDouble
        {
            get
            {
                return double.Parse(this.Next);
            }
        }
        public double[] GetdoubleArray(int N)
        {
            return Enumerable.Range(0, N)
                             .Select(e => this.NextDouble)
                             .ToArray();
        }

        public long NextLong
        {
            get
            {
                return long.Parse(this.Next);
            }
        }
        public long[] GetLongArray(int N)
        {
            return Enumerable.Range(0, N)
                             .Select(e => this.NextLong)
                             .ToArray();
        }

        public bool IsEnd
        {
            get
            {
                this.CheckBuffer();
                return this.buffer.Count == 0;
            }
        }
    }

    class MainClass : IDisposable
    {
        Scanner sc;
        Writer wr;
        const string backPath = "..";
        private readonly char dirSep = System.IO.Path.DirectorySeparatorChar;
        private readonly string inFilePath = string.Empty;
        private readonly string outFilePath = string.Empty;
        public MainClass()
        {
            this.inFilePath = MainClass.backPath
                            + this.dirSep
                            + MainClass.backPath
                            + this.dirSep
                            + "in.txt";
            this.outFilePath = MainClass.backPath
                             + this.dirSep
                             + MainClass.backPath
                             + this.dirSep
                             + "out.txt";

            this.wr = new Writer(this.IsReactive);
            //this.wr = new Writer(this.outFilePath);
#if DEBUG
            if (!this.IsReactive)
            {
                this.sc = new Scanner(this.inFilePath);
            }
            else
            {
                this.sc = new Scanner();
            }
#else
            this.sc = new Scanner();
#endif
        }
        static void Main(string[] args)
        {
            using (var mainClass = new MainClass())
            {
                mainClass.Solve();
            }
        }

        public void Dispose()
        {
            if (this.sc != null)
            {
                this.sc.Dispose();
                this.sc = null;
            }
            if (this.wr != null)
            {
                this.wr.Dispose();
                this.wr = null;
            }
#if DEBUG
            Console.WriteLine("続行するには何かキーを押してください...");
            Console.ReadKey();
#endif
        }

        void MakeTestCase()
        {
            var rand = new Random();
            if (this.wr != null)
            {
                this.wr.Dispose();
            }
            this.wr = new Writer(inFilePath);


        }

        void Solve()
        {
            int H = sc.NextInt;
            int W = sc.NextInt;
            bool[,] A = new bool[H, W];
            for (int i = 0; i < H; i++)
            {
                for (int j = 0; j < W; j++)
                {
                    A[i, j] = sc.NextInt == 1;
                }
            }
            int[] nh = new int[] { -1, 0, 0, 1 };
            int[] nw = new int[] { 0, -1, 1, 0 };
            bool[,] vis = new bool[H, W];
            Queue<Pair<int, int>> que = new Queue<Pair<int, int>>();
            int ans = 0;
            for (int i = 0; i < H; i++)
            {
                for (int j = 0; j < W; j++)
                {
                    if (A[i, j] && !vis[i, j])
                    {
                        ans++;
                        que.Enqueue(new Pair<int, int>()
                        {
                            First = i,
                            Second = j
                        });
                        while (que.Count > 0)
                        {
                            var p = que.Dequeue();
                            if (!(0 <= p.First && p.First < H && 0 <= p.Second && p.Second < W) || vis[p.First, p.Second] || !A[p.First, p.Second])
                            {
                                continue;
                            }
                            vis[p.First, p.Second] = true;
                            for (int k = 0; k < 4; k++)
                            {
                                int ni = p.First + nh[k];
                                int nj = p.Second + nw[k];
                                que.Enqueue(new Pair<int, int>()
                                {
                                    First = ni,
                                    Second = nj
                                });
                            }
                        }
                    }
                }
            }
            wr.WriteLine(ans);
        }
        class Pair<T1, T2> : IComparable<Pair<T1, T2>>
        {
            public T1 First { get; set; }
            public T2 Second { get; set; }

            public int CompareTo(Pair<T1, T2> other)
            {
                int ret = 0;
                if (First is IComparable<T1>)
                {
                    ret = (First as IComparable<T1>).CompareTo(other.First);
                }
                if (ret == 0 && Second is IComparable<T2>)
                {
                    ret = (Second as IComparable<T2>).CompareTo(other.Second);
                }
                return ret;
            }
        }
        private bool IsReactive { get; } = false; // TODO: reactive check !!
    }
}
0