結果

問題 No.226 0-1パズル
ユーザー uwiuwi
提出日時 2015-06-12 22:39:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 45 ms / 5,000 ms
コード長 3,971 bytes
コンパイル時間 7,105 ms
コンパイル使用メモリ 81,260 KB
実行使用メモリ 49,728 KB
最終ジャッジ日時 2023-10-04 12:07:14
合計ジャッジ時間 9,461 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
49,172 KB
testcase_01 AC 39 ms
49,220 KB
testcase_02 AC 40 ms
49,544 KB
testcase_03 AC 41 ms
49,032 KB
testcase_04 AC 40 ms
49,328 KB
testcase_05 AC 41 ms
49,288 KB
testcase_06 AC 39 ms
49,188 KB
testcase_07 AC 39 ms
49,196 KB
testcase_08 AC 39 ms
49,348 KB
testcase_09 AC 39 ms
49,240 KB
testcase_10 AC 38 ms
49,180 KB
testcase_11 AC 40 ms
49,316 KB
testcase_12 AC 41 ms
49,728 KB
testcase_13 AC 40 ms
49,140 KB
testcase_14 AC 41 ms
49,340 KB
testcase_15 AC 40 ms
49,148 KB
testcase_16 AC 39 ms
49,244 KB
testcase_17 AC 43 ms
49,152 KB
testcase_18 AC 42 ms
49,200 KB
testcase_19 AC 45 ms
49,328 KB
testcase_20 AC 42 ms
49,280 KB
testcase_21 AC 41 ms
49,324 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q600 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		char[][] map = nm(n,m);
		int mod = 1000000007;
		// 1010
		long ret = 1;
		out:
		for(int j = 0;j < n;j++){
			int par = -1;
			for(int i = 0;i < m;i++){
				if(map[j][i] != '?'){
					if(par == -1){
						par = ((map[j][i]-'0')^i)&1;
					}else{
						int v = ((map[j][i]-'0')^i)&1;
						if(v != par){
							ret = 0;
							break out;
						}
					}
				}
			}
			if(par == -1){
				ret = ret * 2 % mod;
			}
		}
		
		long plus = 1;
		int[] pars = new int[m];
		out:
		for(int i = 0;i < m;i++){
			int par = -1;
			for(int j = 0;j < n;j++){
				if(map[j][i] != '?'){
					if(par == -1){
						par = ((map[j][i]-'0')^j)&1;
					}else{
						int v = ((map[j][i]-'0')^j)&1;
						if(v != par){
							plus = 0;
							break out;
						}
					}
				}
			}
			pars[i] = par;
			if(par == -1){
				plus = plus * 2 % mod;
			}
		}
		
		if(plus > 0){
			plus -= 2;
			for(int i = 0;i < m;i++){
				if(pars[i] != -1 && ((pars[i]^i)&1) == 0){
					plus++;
					break;
				}
			}
			for(int i = 0;i < m;i++){
				if(pars[i] != -1 && ((pars[i]^i)&1) == 1){
					plus++;
					break;
				}
			}
		}
		ret += plus;
		ret %= mod;
		if(ret < 0)ret += mod;
		out.println(ret);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q600().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0