結果

問題 No.226 0-1パズル
コンテスト
ユーザー EmKjp
提出日時 2015-06-12 23:00:07
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,643 bytes
コンパイル時間 903 ms
コンパイル使用メモリ 114,828 KB
実行使用メモリ 26,576 KB
最終ジャッジ日時 2024-07-06 15:55:58
合計ジャッジ時間 1,998 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 18 WA * 4
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using System.Numerics;

partial class Solver {
    const int mod = 1000000007;

    string[] Transpose(string[] s) {
        var r = new string[s[0].Length];
        for (int j = 0; j < r.Length; j++) {
            r[j] = "";
            for (int i = 0; i < s.Length; i++) {
                r[j] += s[i][j];
            }
        }
        return r;
    }

    int Count(string[] s) {
        int freeRowCount = 0;
        foreach (var line in s) {
            bool allFree = true;
            for (int i = 0; i < line.Length; i++) {
                if (line[i] != '?')
                    allFree = false;
            }
            int lastOne = -1;
            int lastZero = -1;
            for (int i = 0; i + 1 < line.Length; i++) {
                if (line[i] == '1') {
                    if (lastOne != -1 && (i - lastOne) % 2 == 1)
                        return 0;
                    lastOne = i;
                }
                if (line[i] == '0') {
                    if (lastZero != -1 && (i - lastZero) % 2 == 1)
                        return 0;
                    lastZero = i;
                }
            }
            if (allFree) freeRowCount++;
        }
        return (int)BigInteger.ModPow(2, freeRowCount, mod);
    }

    bool MatchCheckeredPattern(string[] s, int offset) {
        for (int i = 0; i < s.Length; i++) {
            for (int j = 0; j < s[i].Length; j++) {
                if (s[i][j] == '?') continue;
                char expected = (i + j + offset) % 2 == 0 ? '0' : '1';
                if (s[i][j] != expected)
                    return false;
            }
        }
        return true;
    }

    public void Run() {
        var h = ni();
        var w = ni();
        var s = ns(h);
        long ans = 0;
        ans += Count(s) + Count(Transpose(s));
        if (MatchCheckeredPattern(s, 0)) ans--;
        if (MatchCheckeredPattern(s, 1)) ans--;
        ans += mod;
        cout.WriteLine(ans % mod);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

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

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
    public string[] ns(int n) { return NextArray(n); }
}

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

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

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

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

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        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 bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0