Submission #2399007


Source Code Expand

using System;
using System.IO;
using System.Collections.Generic;

namespace ARC093D
{
    public class Program
    {
        void Solve(StreamScanner ss, StreamWriter sw)
        {
            //---------------------------------
            var A = ss.Next(int.Parse);
            var B = ss.Next(int.Parse);

            var h = 50;
            var w = 100;

            var ret = new char[h, w];

            for (var i = 0; i < h; i++)
            for (var j = 0; j < h; j++)
            {
                ret[i, j] = '#';
                ret[i, j + h] = '.';
            }

            for (var i = 1; i < h - 1; i += 2)
            for (var j = 1; j < h - 1; j += 2)
            {
                A--;
                B--;
                if (A > 0) ret[i, j] = '.';
                if (B > 0) ret[i, j + h] = '#';
            }

            for (var i = 0; i < h; i++)
            {
                for (var j = 0; j < w; j++) sw.Write(ret[i, j]);
                sw.WriteLine();
            }
            //---------------------------------
        }

        static void Main()
        {
            var ss = new StreamScanner(new StreamReader(Console.OpenStandardInput()));
            var sw = new StreamWriter(Console.OpenStandardOutput()) {AutoFlush = false};
            new Program().Solve(ss, sw);
            sw.Flush();
        }

        static readonly Func<string, string> String = s => s;
    }

    public class StreamScanner
    {
        static readonly char[] Sep = {' '};
        readonly Queue<string> buffer = new Queue<string>();
        readonly TextReader textReader;

        public StreamScanner(TextReader textReader)
        {
            this.textReader = textReader;
        }

        public T Next<T>(Func<string, T> parser)
        {
            if (buffer.Count != 0) return parser(buffer.Dequeue());
            var nextStrings = textReader.ReadLine().Split(Sep, StringSplitOptions.RemoveEmptyEntries);
            foreach (var nextString in nextStrings) buffer.Enqueue(nextString);
            return Next(parser);
        }

        public T[] Next<T>(Func<string, T> parser, int x)
        {
            var ret = new T[x];
            for (var i = 0; i < x; ++i) ret[i] = Next(parser);
            return ret;
        }

        public T[][] Next<T>(Func<string, T> parser, int x, int y)
        {
            var ret = new T[y][];
            for (var i = 0; i < y; ++i) ret[i] = Next(parser, x);
            return ret;
        }
    }
}

Submission Info

Submission Time
Task D - Grid Components
User AreTrash
Language C# (Mono 4.6.2.0)
Score 0
Code Size 2572 Byte
Status WA
Exec Time 22 ms
Memory 13248 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
WA × 4
WA × 44
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Case Name Status Exec Time Memory
01.txt WA 22 ms 9152 KB
02.txt WA 22 ms 11200 KB
03.txt WA 22 ms 11200 KB
04.txt WA 21 ms 9152 KB
05.txt WA 22 ms 9152 KB
06.txt WA 22 ms 11200 KB
07.txt WA 22 ms 9152 KB
08.txt WA 22 ms 11200 KB
09.txt WA 21 ms 11200 KB
10.txt WA 22 ms 11200 KB
11.txt WA 22 ms 11200 KB
12.txt WA 22 ms 9152 KB
13.txt WA 21 ms 9152 KB
14.txt WA 21 ms 9152 KB
15.txt WA 21 ms 11200 KB
16.txt WA 22 ms 11200 KB
17.txt WA 21 ms 9152 KB
18.txt WA 22 ms 9152 KB
19.txt WA 22 ms 9152 KB
20.txt WA 22 ms 11200 KB
21.txt WA 22 ms 9152 KB
22.txt WA 22 ms 13248 KB
23.txt WA 22 ms 11200 KB
24.txt WA 22 ms 9152 KB
25.txt WA 22 ms 13248 KB
26.txt WA 22 ms 11200 KB
27.txt WA 22 ms 9152 KB
28.txt WA 22 ms 9152 KB
29.txt WA 22 ms 11200 KB
30.txt WA 22 ms 11200 KB
31.txt WA 22 ms 9152 KB
32.txt WA 22 ms 11200 KB
33.txt WA 22 ms 11200 KB
34.txt WA 22 ms 11200 KB
35.txt WA 22 ms 11200 KB
36.txt WA 21 ms 9152 KB
37.txt WA 21 ms 9152 KB
38.txt WA 22 ms 11200 KB
39.txt WA 22 ms 9152 KB
40.txt WA 22 ms 11200 KB
sample-01.txt WA 22 ms 9152 KB
sample-02.txt WA 22 ms 11200 KB
sample-03.txt WA 21 ms 9152 KB
sample-04.txt WA 21 ms 9152 KB