結果

問題 No.606 カラフルタイル
ユーザー sekiya9311sekiya9311
提出日時 2017-12-06 00:24:41
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 388 ms / 2,000 ms
コード長 6,838 bytes
コンパイル時間 3,921 ms
コンパイル使用メモリ 111,996 KB
実行使用メモリ 29,332 KB
最終ジャッジ日時 2023-08-19 05:15:20
合計ジャッジ時間 9,477 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
19,584 KB
testcase_01 AC 56 ms
21,620 KB
testcase_02 AC 58 ms
21,644 KB
testcase_03 AC 54 ms
21,712 KB
testcase_04 AC 54 ms
21,652 KB
testcase_05 AC 55 ms
23,644 KB
testcase_06 AC 55 ms
23,672 KB
testcase_07 AC 54 ms
21,560 KB
testcase_08 AC 54 ms
21,564 KB
testcase_09 AC 55 ms
23,672 KB
testcase_10 AC 55 ms
21,716 KB
testcase_11 AC 55 ms
23,612 KB
testcase_12 AC 55 ms
21,712 KB
testcase_13 AC 67 ms
23,628 KB
testcase_14 AC 56 ms
21,564 KB
testcase_15 AC 57 ms
21,668 KB
testcase_16 AC 148 ms
26,288 KB
testcase_17 AC 388 ms
27,272 KB
testcase_18 AC 152 ms
28,456 KB
testcase_19 AC 152 ms
26,448 KB
testcase_20 AC 377 ms
29,296 KB
testcase_21 AC 156 ms
28,620 KB
testcase_22 AC 151 ms
28,556 KB
testcase_23 AC 185 ms
26,584 KB
testcase_24 AC 305 ms
25,260 KB
testcase_25 AC 366 ms
27,236 KB
testcase_26 AC 381 ms
29,332 KB
testcase_27 AC 373 ms
27,304 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 MainClass : IDisposable
    {
        Scanner sc;
        Writer wr;
        string backPath = "..";
        char dirSep = System.IO.Path.DirectorySeparatorChar;
        string inFilePath = null;
        string outFilePath = null;
        public MainClass()
        {
            this.inFilePath = this.backPath
                            + this.dirSep
                            + this.backPath
                            + this.dirSep
                            + "in.txt";
            this.outFilePath = this.backPath
                             + this.dirSep
                             + this.backPath
                             + this.dirSep
                             + "out.txt";
        }
        static void Main(string[] args)
        {
            using (var mainClass = new MainClass())
            {
                //mainClass.MakeTestCase();
                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;
            }
        }

        void MakeTestCase()
        {
            Random rand = new Random();
            this.wr = new Writer(inFilePath);


        }

        void Solve()
        {
            this.wr = new Writer(this.isReactive || true);
            //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

            long N = sc.NextInt;
            int K = sc.NextInt;
            int Q = sc.NextInt;
            char[] a = new char[Q];
            int[] b = new int[Q];
            int[] c = new int[Q];
            for (int i = 0; i < Q; i++)
            {
                a[i] = sc.Next[0];
                b[i] = sc.NextInt - 1;
                c[i] = sc.NextInt - 1;
            }

            long[] cnt = new long[K];
            int rowCnt = 0, colCnt = 0;
            bool[] rused = new bool[N];
            bool[] cused = new bool[N];
            for (int i = Q - 1; i >= 0; i--)
            {
                if (a[i] == 'R')
                {
                    if (rused[b[i]])
                    {
                        continue;
                    }
                    rused[b[i]] = true;
                    cnt[c[i]] += N - colCnt;
                    rowCnt++;
                }
                else
                {
                    if (cused[b[i]])
                    {
                        continue;
                    }
                    cused[b[i]] = true;
                    cnt[c[i]] += N - rowCnt;
                    colCnt++;
                }
            }
            cnt[0] = N * N;
            for (int i = 1; i < K; i++)
            {
                cnt[0] -= cnt[i];
            }
            for (int i = 0; i < K; i++)
            {
                wr.WriteLine(cnt[i]);
            }
        }

        bool isReactive = false; // TODO: reactive check !!
    }

    class Writer : IDisposable
    {
        private System.IO.TextWriter writer;
        private StringBuilder sb;
        private 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(string format, params object[] vals)
        {
            this.Write(format + System.Environment.NewLine, vals);
        }
    }

    class Scanner : IDisposable
    {
        private Queue<string> buffer;
        private char[] sep;
        private System.IO.TextReader reader;
        public Scanner(string path) : this(new System.IO.StreamReader(path))
        {
        }
        public Scanner(System.IO.TextReader reader = null)
        {
            this.buffer = new Queue<string>();
            this.sep = new char[] { ' ' };
            this.reader = (reader ?? Console.In);
        }
        private void CheckBuffer()
        {
            if (this.buffer.Count == 0)
            {
                string str = string.Empty;
                while (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 int NextInt
        {
            get
            {
                return int.Parse(this.Next);
            }
        }
        public double NextDouble
        {
            get
            {
                return double.Parse(this.Next);
            }
        }

        public long NextLong
        {
            get
            {
                return long.Parse(this.Next);
            }
        }

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