結果

問題 No.819 Enjapma game
ユーザー claw88claw88
提出日時 2019-04-22 23:11:45
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 29 ms / 2,000 ms
コード長 4,032 bytes
コンパイル時間 2,986 ms
コンパイル使用メモリ 116,944 KB
実行使用メモリ 26,112 KB
最終ジャッジ日時 2024-10-12 03:42:29
合計ジャッジ時間 5,078 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
23,988 KB
testcase_01 AC 25 ms
23,812 KB
testcase_02 AC 25 ms
23,940 KB
testcase_03 AC 26 ms
26,108 KB
testcase_04 AC 26 ms
24,068 KB
testcase_05 AC 26 ms
23,984 KB
testcase_06 AC 25 ms
26,112 KB
testcase_07 AC 25 ms
24,228 KB
testcase_08 AC 25 ms
24,068 KB
testcase_09 AC 25 ms
24,068 KB
testcase_10 AC 29 ms
25,856 KB
testcase_11 AC 26 ms
23,860 KB
testcase_12 AC 26 ms
23,940 KB
testcase_13 AC 27 ms
24,068 KB
testcase_14 AC 25 ms
21,684 KB
testcase_15 AC 25 ms
23,944 KB
testcase_16 AC 26 ms
23,964 KB
testcase_17 AC 27 ms
24,068 KB
testcase_18 AC 27 ms
24,224 KB
testcase_19 AC 29 ms
24,072 KB
testcase_20 AC 25 ms
21,812 KB
testcase_21 AC 29 ms
23,940 KB
testcase_22 AC 25 ms
23,852 KB
testcase_23 AC 26 ms
24,200 KB
testcase_24 AC 27 ms
26,008 KB
testcase_25 AC 26 ms
23,944 KB
testcase_26 AC 25 ms
25,760 KB
testcase_27 AC 25 ms
26,028 KB
testcase_28 AC 26 ms
26,020 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.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int H = cin.nextint;
        int W = cin.nextint;
        var S = new string[H];
        for (int i = 0; i < H; i++)
        {
            S[i] = ReadLine();
        }

        long G = 0;
        for (int i = 0; i < H; i++)
        {
            for (int j = 0; j < W; j++)
            {
                if (S[i][j] != 'o')
                {
                    continue;
                }
                int y = (H - 1 - i) % 2;
                int x = j % 2;
                if ((y ^ x) == 0)
                {
                    G++;
                }
                else
                {
                    G += 2;
                }
            }
        }
        if (G % 3 == 0)
        {
            WriteLine("YES");
        }
        else
        {
            WriteLine("NO");
        }
    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}
0