結果

問題 No.1141 田グリッド
ユーザー uwiuwi
提出日時 2020-07-31 21:28:01
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 4,209 bytes
コンパイル時間 4,061 ms
コンパイル使用メモリ 92,028 KB
実行使用メモリ 52,672 KB
最終ジャッジ日時 2024-07-06 16:23:03
合計ジャッジ時間 9,834 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
37,068 KB
testcase_01 AC 40 ms
37,128 KB
testcase_02 AC 39 ms
37,244 KB
testcase_03 AC 40 ms
36,856 KB
testcase_04 AC 40 ms
36,692 KB
testcase_05 AC 40 ms
37,064 KB
testcase_06 AC 41 ms
37,244 KB
testcase_07 AC 41 ms
36,856 KB
testcase_08 AC 45 ms
37,256 KB
testcase_09 AC 43 ms
37,068 KB
testcase_10 AC 44 ms
37,292 KB
testcase_11 AC 47 ms
36,824 KB
testcase_12 AC 45 ms
36,820 KB
testcase_13 RE -
testcase_14 AC 203 ms
48,584 KB
testcase_15 AC 226 ms
46,784 KB
testcase_16 AC 228 ms
47,008 KB
testcase_17 AC 228 ms
47,064 KB
testcase_18 AC 151 ms
45,380 KB
testcase_19 AC 152 ms
45,400 KB
testcase_20 AC 154 ms
45,092 KB
testcase_21 AC 222 ms
46,368 KB
testcase_22 AC 224 ms
46,708 KB
testcase_23 AC 228 ms
46,932 KB
testcase_24 AC 157 ms
46,608 KB
testcase_25 RE -
testcase_26 AC 157 ms
46,976 KB
testcase_27 AC 155 ms
46,796 KB
testcase_28 RE -
testcase_29 RE -
testcase_30 AC 156 ms
46,724 KB
testcase_31 RE -
testcase_32 AC 156 ms
46,368 KB
testcase_33 AC 158 ms
46,324 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200731;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int H = ni(), W = ni();
		int[][] a = new int[H][];
		for(int i = 0;i < H;i++) {
			a[i] = na(W);
		}
		int mod = 1000000007;
		long[] sr = new long[H];
		int[] zr = new int[H];
		for(int i = 0;i < H;i++) {
			sr[i] = 1;
			for(int j = 0;j < W;j++) {
				if(a[i][j] == 0) {
					zr[i]++;
				}else {
					sr[i] = sr[i] * a[i][j] % mod;
				}
			}
		}
		long[] sc = new long[W];
		int[] zc = new int[H];
		for(int i = 0;i < W;i++) {
			sc[i] = 1;
			for(int j = 0;j < H;j++) {
				if(a[j][i] == 0) {
					zc[i]++;
				}else {
					sc[i] = sc[i] * a[j][i] % mod;
				}
			}
		}
		
		long all = 1;
		int allz = 0;
		for(long v : sr)all = all * v % mod;
		for(int v : zr)allz += v;
		all %= mod;
		
		for(int Q = ni();Q > 0;Q--) {
			int r = ni()-1, c = ni()-1;
			int z = allz - zr[r] - zc[c] + (a[r][c] == 0 ? 1 : 0);
			if(z == 0) {
				out.println(all*invl(sr[r]*sc[c]%mod, mod)%mod*Math.max(1, a[r][c])%mod);
			}else {
				out.println(0);
			}
		}
	}
	
	public static long invl(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}

	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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