結果

問題 No.179 塗り分け
ユーザー くれちーくれちー
提出日時 2018-01-10 11:05:25
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 12,764 bytes
コンパイル時間 2,906 ms
コンパイル使用メモリ 118,912 KB
実行使用メモリ 29,452 KB
最終ジャッジ日時 2023-08-25 03:27:28
合計ジャッジ時間 9,045 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
21,372 KB
testcase_01 AC 54 ms
21,380 KB
testcase_02 AC 55 ms
21,328 KB
testcase_03 AC 54 ms
23,200 KB
testcase_04 AC 54 ms
21,284 KB
testcase_05 AC 55 ms
21,324 KB
testcase_06 AC 59 ms
23,608 KB
testcase_07 WA -
testcase_08 AC 55 ms
19,340 KB
testcase_09 AC 57 ms
21,456 KB
testcase_10 AC 102 ms
25,596 KB
testcase_11 AC 96 ms
25,384 KB
testcase_12 AC 232 ms
27,600 KB
testcase_13 AC 54 ms
21,356 KB
testcase_14 AC 55 ms
21,364 KB
testcase_15 AC 54 ms
23,416 KB
testcase_16 AC 55 ms
21,348 KB
testcase_17 AC 54 ms
23,268 KB
testcase_18 AC 138 ms
27,536 KB
testcase_19 AC 133 ms
25,604 KB
testcase_20 AC 56 ms
23,336 KB
testcase_21 AC 54 ms
21,560 KB
testcase_22 AC 206 ms
27,596 KB
testcase_23 AC 107 ms
27,636 KB
testcase_24 AC 206 ms
29,452 KB
testcase_25 AC 134 ms
27,504 KB
testcase_26 AC 135 ms
27,624 KB
testcase_27 AC 195 ms
25,600 KB
testcase_28 AC 127 ms
27,544 KB
testcase_29 AC 201 ms
25,600 KB
testcase_30 AC 156 ms
27,480 KB
testcase_31 AC 195 ms
27,680 KB
testcase_32 AC 146 ms
27,464 KB
testcase_33 AC 197 ms
27,476 KB
testcase_34 AC 136 ms
25,592 KB
testcase_35 AC 195 ms
23,660 KB
testcase_36 AC 54 ms
19,460 KB
testcase_37 AC 54 ms
23,260 KB
testcase_38 AC 54 ms
23,360 KB
testcase_39 AC 55 ms
21,352 KB
testcase_40 AC 54 ms
19,152 KB
testcase_41 AC 54 ms
23,244 KB
testcase_42 AC 54 ms
21,372 KB
testcase_43 AC 59 ms
25,420 KB
testcase_44 AC 75 ms
27,480 KB
testcase_45 AC 55 ms
21,480 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;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Text;
using static System.Math;
using static Extensions;
using static MathExtensions;

public static class Program
{
    public static void Solve()
    {
        void Yes() { Console.WriteLine("YES"); Exit(0); }
        void No() { Console.WriteLine("NO"); Exit(0); }

        var (h, w) = (I, I);
        var s = Repeat(h, () => S.ToCharArray()).ToArray();
        var t = Repeat(h, () => new bool[w]).ToArray();
        var cnt = s.Sum(r => r.Count(c => c == '#'));

        if (cnt % 2 != 0) No();

        for (var dy = -h + 1; dy < h; dy++)
            for (var dx = -w + 1; dx < w; dx++)
            {
                if (dy == 0 && dx == 0) continue;
                var cnt2 = 0;
                Repeat(h, i => Repeat(w, j => { t[i][j] = false; }));
                for (var y = 0; y < h && y + dy < h; y++)
                {
                    if (y + dy < 0) continue;
                    for (var x = 0; x < w && x + dx < w; x++)
                    {
                        if (x + dx < 0 || s[y][x] == '.' || t[y][x]) continue;
                        if (s[y][x] == s[y + dy][x + dx] && !t[y + dy][x + dx])
                        {
                            t[y][x] = t[y + dy][x + dx] = true;
                            cnt2 += 2;
                        }
                        else goto ExitLoop;
                    }
                }
                if (cnt2 == cnt) Yes();
                ExitLoop:;
            }
        No();
    }

    #region Scanners
    static Scanner _scanner;
    static char C => _scanner.NextChar();
    static string S => _scanner.NextString();
    static int I => _scanner.NextInt();
    static long L => _scanner.NextLong();
    static BigInteger B => _scanner.NextBigInteger();
    static double D => _scanner.NextDouble();
    static decimal M => _scanner.NextDecimal();
    #endregion

    public static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput());
        sw.NewLine = "\n";
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        Console.SetOut(sw);
        _scanner = new Scanner(Console.OpenStandardInput());
        Solve();
        Console.Out.Flush();
    }
}

public static partial class Extensions
{
}

#region Library
// hotfixed
public class Scanner
{
    private readonly Stream _stream;
    private const int _bufferSize = 1024;
    private readonly byte[] _buf = new byte[_bufferSize];
    private int _len, _ptr;

    public Scanner(Stream stream)
    {
        _stream = stream;
    }

    public byte ReadByte()
    {
        if (_ptr >= _len)
        {
            _len = _stream.Read(_buf, 0, _bufferSize);
            _ptr = 0;
        }
        return _buf[_ptr++];
    }

    public char ReadChar() => (char)ReadByte();

    public string ReadLine()
    {
        var r = new StringBuilder();
        if (_ptr == 0) r.Append(ReadChar());
        for (; _ptr < _len; _ptr++) r.Append((char)_buf[_ptr]);
        return r.ToString();
    }

    public char NextChar() => char.Parse(NextString());

    public string NextString()
    {
        var r = new StringBuilder();
        var b = ReadChar();
#if DEBUG
        while (b != ' ' && b != '\r')
        {
            r.Append(b);
            b = ReadChar();
        }
        if (b == '\r') ReadChar();
#else
        while (b != ' ' && b != '\n')
        {
            r.Append(b);
            b = ReadChar();
        }
#endif
        return r.ToString();
    }

    public int NextInt() => (int)NextLong();

    public long NextLong()
    {
        var r = 0L;
        var b = ReadByte();
        var n = b == '-';
        if (n) b = ReadByte();
#if DEBUG
        while (b != ' ' && b != '\r')
#else
        while (b != ' ' && b != '\n')
#endif
        {
            r = r * 10 + b - '0';
            b = ReadByte();
        }
#if DEBUG
        if (b == '\r') ReadChar();
#endif
        return n ? -r : r;
    }

    public BigInteger NextBigInteger()
    {
        var r = new BigInteger();
        var b = ReadByte();
        var n = b == '-';
        if (n) b = ReadByte();
#if DEBUG
        while (b != ' ' && b != '\r')
#else
        while (b != ' ' && b != '\n')
#endif
        {
            r = r * 10 + b - '0';
            b = ReadByte();
        }
#if DEBUG
        if (b == '\r') ReadChar();
#endif
        return n ? -r : r;
    }

    public double NextDouble()
    {
        var i = 0L;
        var b = ReadByte();
        var n = b == '-';
        if (n) b = ReadByte();
#if DEBUG
        while (b != '.' && b != ' ' && b != '\r')
#else
        while (b != '.' && b != ' ' && b != '\n')
#endif
        {
            i = i * 10 + b - '0';
            b = ReadByte();
        }
#if DEBUG
        if (b == '\r') ReadByte();
#endif
        if (b != '.') return n ? -i : i;
        b = ReadByte();
        var f = 0L;
        var p = 0;
#if DEBUG
        while (b != ' ' && b != '\r')
#else
        while (b != ' ' && b != '\n')
#endif
        {
            f = f * 10 + b - '0';
            b = ReadByte();
            p++;
        }
#if DEBUG
        if (b == '\r') ReadByte();
#endif
        var r = i + (double)f / MathExtensions.Pow(10, p);
        return n ? -r : r;
    }

    public decimal NextDecimal() => decimal.Parse(NextString());

    public T Next<T>(Converter<string, T> parser) => parser(NextString());
}

[DebuggerStepThrough]
public static partial class Extensions
{
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Assert(bool condition)
    {
        if (!condition) throw new Exception("Assertion failed");
    }

    public static string AsString(this IEnumerable<char> source) => new string(source.ToArray());

    public static Dictionary<T, int> Bucket<T>(this IEnumerable<T> source) where T : IEquatable<T>
    {
        var dict = new Dictionary<T, int>();
        foreach (var item in source) if (dict.ContainsKey(item)) dict[item]++; else dict[item] = 1;
        return dict;
    }

    public static int[] Bucket<T>(this IEnumerable<T> source, int maxValue, Func<T, int> selector)
    {
        var arr = new int[maxValue + 1];
        foreach (var item in source) arr[selector(item)]++;
        return arr;
    }

    public static IEnumerable<int> CumSum(this IEnumerable<int> source)
    {
        var sum = 0;
        foreach (var item in source) yield return sum += item;
    }

    public static IEnumerable<long> CumSum(this IEnumerable<long> source)
    {
        var sum = 0L;
        foreach (var item in source) yield return sum += item;
    }

    public static void Exit(int exitCode)
    {
        Console.Out.Flush();
        Environment.Exit(exitCode);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void ForEach<T>(this IEnumerable<T> source, Action<T> action)
    {
        foreach (var item in source) action(item);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, _> func)
    {
        foreach (var item in source) func(item);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void ForEach<T>(this IEnumerable<T> source, Action<T, int> action)
    {
        var i = 0;
        foreach (var item in source) action(item, i++);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, int, _> func)
    {
        var i = 0;
        foreach (var item in source) func(item, i++);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Repeat(int count, Action action)
    {
        for (var i = 0; i < count; i++) action();
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Repeat(int count, Action<int> action)
    {
        for (var i = 0; i < count; i++) action(i);
    }

    public static IEnumerable<T> Repeat<T>(int count, Func<T> func)
    {
        for (var i = 0; i < count; i++) yield return func();
    }

    public static IEnumerable<T> Repeat<T>(int count, Func<int, T> func)
    {
        for (var i = 0; i < count; i++) yield return func(i);
    }

    public static void Swap<T>(ref T x, ref T y)
    {
        var tmp = x; x = y; y = tmp;
    }

    public static (T1[], T2[]) Unzip<T1, T2>(this ICollection<(T1, T2)> source)
    {
        var ts1 = new T1[source.Count];
        var ts2 = new T2[source.Count];
        var i = 0;
        foreach (var (t1, t2) in source) { ts1[i] = t1; ts2[i] = t2; i++; }
        return (ts1, ts2);
    }

    public static (T1[], T2[], T3[]) Unzip<T1, T2, T3>(this ICollection<(T1, T2, T3)> source)
    {
        var ts1 = new T1[source.Count];
        var ts2 = new T2[source.Count];
        var ts3 = new T3[source.Count];
        var i = 0;
        foreach (var (t1, t2, t3) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; i++; }
        return (ts1, ts2, ts3);
    }

    public static (T1[], T2[], T3[], T4[]) Unzip<T1, T2, T3, T4>(this ICollection<(T1, T2, T3, T4)> source)
    {
        var ts1 = new T1[source.Count];
        var ts2 = new T2[source.Count];
        var ts3 = new T3[source.Count];
        var ts4 = new T4[source.Count];
        var i = 0;
        foreach (var (t1, t2, t3, t4) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; ts4[i] = t4; i++; }
        return (ts1, ts2, ts3, ts4);
    }

    public static IEnumerable<T> Zip<T1, T2, T3, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, Func<T1, T2, T3, T> resultSelector)
    {
        using (var e1 = first.GetEnumerator())
        using (var e2 = second.GetEnumerator())
        using (var e3 = thrid.GetEnumerator())
        {
            while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext())
                yield return resultSelector(e1.Current, e2.Current, e3.Current);
        }
    }

    public static IEnumerable<T> Zip<T1, T2, T3, T4, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, IEnumerable<T4> fourth, Func<T1, T2, T3, T4, T> resultSelector)
    {
        using (var e1 = first.GetEnumerator())
        using (var e2 = second.GetEnumerator())
        using (var e3 = thrid.GetEnumerator())
        using (var e4 = fourth.GetEnumerator())
        {
            while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext() && e4.MoveNext())
                yield return resultSelector(e1.Current, e2.Current, e3.Current, e4.Current);
        }
    }
}

[DebuggerStepThrough]
public static class MathExtensions
{
    public static int DivCeil(int left, int right)
        => left / right + (left % right == 0 ? 0 : 1);

    public static long DivCeil(long left, long right)
        => left / right + (left % right == 0L ? 0L : 1L);

    public static int Gcd(int left, int right)
    {
        int r;
        while ((r = left % right) != 0) { left = right; right = r; }
        return right;
    }

    public static long Gcd(long left, long right)
    {
        long r;
        while ((r = left % right) != 0L) { left = right; right = r; }
        return right;
    }

    public static BigInteger Gcd(BigInteger left, BigInteger right)
        => BigInteger.GreatestCommonDivisor(left, right);

    public static int HighestOneBit(int x)
    {
        x |= x >> 01;
        x |= x >> 02;
        x |= x >> 04;
        x |= x >> 08;
        x |= x >> 16;
        return x - (x >> 1);
    }

    public static long HighestOneBit(long x)
    {
        x |= x >> 01;
        x |= x >> 02;
        x |= x >> 04;
        x |= x >> 08;
        x |= x >> 16;
        x |= x >> 32;
        return x - (x >> 1);
    }

    public static int Lcm(int left, int right) => left / Gcd(left, right) * right;

    public static long Lcm(long left, long right) => left / Gcd(left, right) * right;

    public static BigInteger Lcm(BigInteger left, BigInteger right)
        => left / Gcd(left, right) * right;

    public static int Pow(int value, int exponent)
    {
        var r = 1;
        while (exponent > 0)
        {
            if ((exponent & 1) == 1) r *= value;
            value *= value;
            exponent >>= 1;
        }
        return r;
    }

    public static long Pow(long value, int exponent)
    {
        var r = 1L;
        while (exponent > 0)
        {
            if ((exponent & 1) == 1) r *= value;
            value *= value;
            exponent >>= 1;
        }
        return r;
    }

    public static long Fact(int value)
    {
        var r = 1L;
        for (var i = 2; i <= value; i++) r *= i;
        return r;
    }
}
#endregion
0