結果

問題 No.226 0-1パズル
ユーザー eitahoeitaho
提出日時 2015-06-13 00:50:07
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 33 ms / 5,000 ms
コード長 3,599 bytes
コンパイル時間 1,017 ms
コンパイル使用メモリ 110,848 KB
実行使用メモリ 20,864 KB
最終ジャッジ日時 2024-07-26 14:23:40
合計ジャッジ時間 2,453 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Linq;
using System.Text;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;
class Program
{
static readonly int Mod = (int)1e9 + 7;
void Add(ref int a, int b) { if ((a += b) >= Mod) a -= Mod; }
public void Solve()
{
int H = Reader.Int(), W = Reader.Int();
var grid = Reader.StringArray(H);
int ans = (DP(grid) + DP(Rotate(grid))) % Mod;
ans = (ans + Mod - CheckerdPattern(grid)) % Mod;
Console.WriteLine(ans);
}
int DP(string[] grid)
{
// grid[r][c] ^ 1 == grid[r + 1][c]
int H = grid.Length, W = grid[0].Length;
int[] count = new int[W];
for (int c = 0; c < W; c++)
for (int top = 0; top < 2; top++)
{
bool ok = true;
for (int r = 0; r < H; r++)
if (grid[r][c] != '?' && grid[r][c] - '0' != (top + r) % 2) ok = false;
if (ok) count[c]++;
}
int res = 1;
foreach (int x in count) res = res * x % Mod;
return res;
}
int CheckerdPattern(string[] grid)
{
int[] pattern = { 1, 1 };
for (int r = 0; r < grid.Length; r++)
for (int c = 0; c < grid[0].Length; c++)
if (grid[r][c] != '?')
{
if (grid[r][c] - '0' != (r + c) % 2) pattern[0] = 0;
if (grid[r][c] - '0' != (1 + r + c) % 2) pattern[1] = 0;
}
return pattern.Sum();
}
string[] Rotate(string[] a)
{
int H = a.Length, W = a[0].Length;
var rotated = new string[W];
for (int c = 0; c < W; c++)
for (int r = 0; r < H; r++)
rotated[c] += a[r][c];
return rotated;
}
}
class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
private static TextReader reader = Console.In;
private static readonly char[] separator = { ' ' };
private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
private static string[] A = new string[0];
private static int i;
private static void Init() { A = new string[0]; }
public static void Set(TextReader r) { reader = r; Init(); }
public static void Set(string file) { reader = new StreamReader(file); Init(); }
public static bool HasNext() { return CheckNext(); }
public static string String() { return Next(); }
public static int Int() { return int.Parse(Next()); }
public static long Long() { return long.Parse(Next()); }
public static double Double() { return double.Parse(Next()); }
public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
public static string Line() { return reader.ReadLine().Trim(); }
private static string[] Split(string s) { return s.Split(separator, op); }
private static string Next() { CheckNext(); return A[i++]; }
private static bool CheckNext()
{
if (i < A.Length) return true;
string line = reader.ReadLine();
if (line == null) return false;
if (line == "") return CheckNext();
A = Split(line);
i = 0;
return true;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0