結果

問題 No.923 オセロきりきざむたん
ユーザー EmKjpEmKjp
提出日時 2019-11-08 22:31:09
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 64 ms / 2,000 ms
コード長 5,169 bytes
コンパイル時間 1,903 ms
コンパイル使用メモリ 107,904 KB
実行使用メモリ 24,064 KB
最終ジャッジ日時 2024-09-15 02:52:39
合計ジャッジ時間 6,408 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
17,664 KB
testcase_01 AC 25 ms
17,664 KB
testcase_02 AC 25 ms
17,664 KB
testcase_03 AC 25 ms
17,792 KB
testcase_04 AC 25 ms
17,792 KB
testcase_05 AC 25 ms
18,048 KB
testcase_06 AC 25 ms
17,920 KB
testcase_07 AC 26 ms
17,792 KB
testcase_08 AC 24 ms
17,792 KB
testcase_09 AC 25 ms
17,792 KB
testcase_10 AC 25 ms
17,792 KB
testcase_11 AC 25 ms
17,920 KB
testcase_12 AC 25 ms
17,792 KB
testcase_13 AC 25 ms
17,920 KB
testcase_14 AC 25 ms
18,048 KB
testcase_15 AC 25 ms
17,792 KB
testcase_16 AC 25 ms
17,792 KB
testcase_17 AC 25 ms
17,664 KB
testcase_18 AC 25 ms
17,536 KB
testcase_19 AC 25 ms
18,048 KB
testcase_20 AC 26 ms
17,920 KB
testcase_21 AC 25 ms
17,792 KB
testcase_22 AC 26 ms
17,792 KB
testcase_23 AC 25 ms
17,792 KB
testcase_24 AC 25 ms
17,920 KB
testcase_25 AC 25 ms
17,920 KB
testcase_26 AC 28 ms
18,176 KB
testcase_27 AC 27 ms
18,048 KB
testcase_28 AC 27 ms
18,048 KB
testcase_29 AC 27 ms
18,304 KB
testcase_30 AC 26 ms
17,920 KB
testcase_31 AC 27 ms
18,048 KB
testcase_32 AC 26 ms
17,664 KB
testcase_33 AC 25 ms
17,792 KB
testcase_34 AC 26 ms
17,792 KB
testcase_35 AC 25 ms
17,920 KB
testcase_36 AC 25 ms
17,792 KB
testcase_37 AC 25 ms
17,792 KB
testcase_38 AC 25 ms
17,792 KB
testcase_39 AC 25 ms
17,664 KB
testcase_40 AC 25 ms
17,792 KB
testcase_41 AC 26 ms
17,792 KB
testcase_42 AC 26 ms
17,792 KB
testcase_43 AC 25 ms
17,920 KB
testcase_44 AC 26 ms
17,920 KB
testcase_45 AC 26 ms
17,664 KB
testcase_46 AC 25 ms
17,920 KB
testcase_47 AC 25 ms
17,792 KB
testcase_48 AC 25 ms
17,920 KB
testcase_49 AC 25 ms
17,792 KB
testcase_50 AC 31 ms
19,064 KB
testcase_51 AC 31 ms
18,816 KB
testcase_52 AC 31 ms
18,688 KB
testcase_53 AC 45 ms
21,376 KB
testcase_54 AC 32 ms
19,044 KB
testcase_55 AC 33 ms
19,168 KB
testcase_56 AC 34 ms
19,048 KB
testcase_57 AC 26 ms
17,792 KB
testcase_58 AC 25 ms
17,920 KB
testcase_59 AC 25 ms
17,920 KB
testcase_60 AC 25 ms
17,792 KB
testcase_61 AC 25 ms
17,792 KB
testcase_62 AC 25 ms
17,664 KB
testcase_63 AC 25 ms
17,920 KB
testcase_64 AC 25 ms
17,920 KB
testcase_65 AC 62 ms
23,936 KB
testcase_66 AC 64 ms
23,808 KB
testcase_67 AC 63 ms
24,064 KB
testcase_68 AC 63 ms
23,808 KB
testcase_69 AC 27 ms
17,920 KB
testcase_70 AC 27 ms
17,920 KB
testcase_71 AC 63 ms
23,936 KB
testcase_72 AC 28 ms
17,920 KB
testcase_73 AC 26 ms
17,920 KB
testcase_74 AC 26 ms
18,048 KB
testcase_75 AC 26 ms
17,920 KB
testcase_76 AC 26 ms
18,048 KB
testcase_77 AC 27 ms
18,176 KB
testcase_78 AC 26 ms
17,920 KB
testcase_79 AC 27 ms
18,048 KB
testcase_80 AC 27 ms
18,176 KB
testcase_81 AC 26 ms
17,920 KB
testcase_82 AC 28 ms
18,176 KB
testcase_83 AC 26 ms
18,176 KB
testcase_84 AC 27 ms
17,792 KB
testcase_85 AC 26 ms
18,048 KB
testcase_86 AC 26 ms
17,920 KB
testcase_87 AC 27 ms
18,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;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var H = ni();
        var W = ni();
        var s = ns(H);
        var histRow = new int[H];
        var histCol = new int[W];
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (s[i][j] == '1') {
                    histRow[i]++;
                    histCol[j]++;
                }
            }
        }

        bool impossible = false;

        for (int i = 0; i < H; i++) {
            var rowAll0 = histRow[i] == 0;
            var rowAll1 = histRow[i] == W;

            for (int j = 0; j < W; j++) {
                var colAll0 = histCol[j] == 0;
                var colAll1 = histCol[j] == H;

                if (rowAll0 && colAll0) {
                    impossible = true; break;
                }
                if (rowAll1 && colAll1) {
                    impossible = true; break;
                }
            }
            if (impossible) break;
        }

        cout.WriteLine(impossible ? "NO" : "YES");
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        Console.SetIn(new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length));
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}
0