結果
| 問題 | No.1141 田グリッド |
| ユーザー |
 ひばち
|
| 提出日時 | 2020-07-31 22:12:12 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 815 ms / 2,000 ms |
| コード長 | 9,475 bytes |
| コンパイル時間 | 2,713 ms |
| コンパイル使用メモリ | 124,572 KB |
| 実行使用メモリ | 45,932 KB |
| 最終ジャッジ日時 | 2024-07-06 18:29:49 |
| 合計ジャッジ時間 | 20,351 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 31 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections.Generic;using System.Linq;using System.IO;using System.Threading;using System.Runtime.CompilerServices;using System.Text;using System.Diagnostics;using System.Numerics;using static System.Console;using static System.Convert;using static System.Math;using static Template;class Solver{public Scanner sc;public void Solve(){int H, W;sc.Make(out H, out W);var A = sc.ArrInt2D(H);var LU = new Sum2D(H, W);var RU = new Sum2D(H, W);var LD = new Sum2D(H,W);var RD = new Sum2D(H, W);for(int i=0;i<H;i++)for(int j = 0; j < W; j++){LU[i, j] = A[i][j];RU[i, W-j-1] = A[i][j];LD[H - i - 1, j] = A[i][j];RD[H - i - 1, W - j - 1] = A[i][j];}LU.Build();RU.Build();LD.Build();RD.Build();var Q = sc.Int;while (Q-- > 0){int r, c;sc.Make(out r, out c);r--; c--;ModInt res = 1;res *= LU.Sum(0, 0, r, c);res *= RU.Sum(0, 0, r, W - c - 1);res *= LD.Sum(0, 0, H - r - 1, c);res *= RD.Sum(0, 0, H - r - 1, W - c - 1);Console.WriteLine(res);}}}public class Sum2D{private ModInt[][] data;public Sum2D(int H, int W){data = Create(H + 1, () => Create(W + 1, () => (ModInt)1));}public ModInt this[int i, int j]{ get { return data[i + 1][j + 1]; } set { data[i + 1][j + 1] = value; } }public void Build(){for (var i = 1; i < data.Length; i++)for (var j = 1; j < data[0].Length; j++)data[i][j] *= data[i - 1][j] * data[i][j - 1] / data[i - 1][j - 1];}public ModInt Sum(int y1, int x1, int y2, int x2)=> data[y2][x2] / (data[y2][x1] * data[y1][x2]) * data[y1][x1];}public struct ModInt{public const long MOD = (int)1e9 + 7;//public const long MOD = 998244353;public long Value { get; set; }public ModInt(long n = 0) { Value = n; }private static ModInt[] fac, inv, facinv;public override string ToString() => Value.ToString();[MethodImpl(MethodImplOptions.AggressiveInlining)]public static ModInt operator +(ModInt l, ModInt r){l.Value += r.Value;if (l.Value >= MOD) l.Value -= MOD;return l;}[MethodImpl(MethodImplOptions.AggressiveInlining)]public static ModInt operator -(ModInt l, ModInt r){l.Value -= r.Value;if (l.Value < 0) l.Value += MOD;return l;}[MethodImpl(MethodImplOptions.AggressiveInlining)]public static ModInt operator *(ModInt l, ModInt r) => new ModInt(l.Value * r.Value % MOD);[MethodImpl(MethodImplOptions.AggressiveInlining)]public static ModInt operator /(ModInt l, ModInt r) => l * Pow(r, MOD - 2);[MethodImpl(MethodImplOptions.AggressiveInlining)]public static implicit operator long(ModInt l) => l.Value;[MethodImpl(MethodImplOptions.AggressiveInlining)]public static implicit operator ModInt(long n){n %= MOD; if (n < 0) n += MOD;return new ModInt(n);}public static ModInt Pow(ModInt m, long n){if (n == 0) return 1;if (n % 2 == 0) return Pow(m * m, n >> 1);else return Pow(m * m, n >> 1) * m;}public static void Build(int n){fac = new ModInt[n + 1];facinv = new ModInt[n + 1];inv = new ModInt[n + 1];inv[1] = fac[0] = fac[1] = facinv[0] = facinv[1] = 1;for (var i = 2; i <= n; i++){fac[i] = fac[i - 1] * i;inv[i] = MOD - inv[MOD % i] * (MOD / i);facinv[i] = facinv[i - 1] * inv[i];}}[MethodImpl(MethodImplOptions.AggressiveInlining)]public static ModInt Fac(int n) => fac[n];[MethodImpl(MethodImplOptions.AggressiveInlining)]public static ModInt Inv(int n) => inv[n];[MethodImpl(MethodImplOptions.AggressiveInlining)]public static ModInt FacInv(int n) => facinv[n];[MethodImpl(MethodImplOptions.AggressiveInlining)]public static ModInt Comb(int n, int r){if (n < r) return 0;if (n == r) return 1;return fac[n] * facinv[r] * facinv[n - r];}public static ModInt Perm(int n, int r){if (n < r) return 0;return fac[n] * facinv[n - r];}}#region Templatepublic static class Template{static void Main(string[] args){Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });var sol = new Solver() { sc = new Scanner() };//var th = new Thread(sol.Solve, 1 << 26);th.Start();th.Join();sol.Solve();Console.Out.Flush();}[MethodImpl(MethodImplOptions.AggressiveInlining)]public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }public static void Out<T>(this IList<T> A, out T a) => a = A[0];public static void Out<T>(this IList<T> A, out T a, out T b) { a = A[0]; b = A[1]; }public static void Out<T>(this IList<T> A, out T a, out T b, out T c) { A.Out(out a, out b); c = A[2]; }public static void Out<T>(this IList<T> A, out T a, out T b, out T c, out T d) { A.Out(out a, out b, out c); d = A[3]; }public static string Concat<T>(this IEnumerable<T> A, string sp) => string.Join(sp, A);public static char ToChar(this int s, char begin = '0') => (char)(s + begin);public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if(A.Length > B.Length) return 1; else return -1; }public static int ArgMax<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for(int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }}public class Scanner{public string Str => Console.ReadLine().Trim();public int Int => int.Parse(Str);public long Long => long.Parse(Str);public double Double => double.Parse(Str);public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());public int[] ArrInt1D(int n) => Create(n, () => Int);public long[] ArrLong1D(int n) => Create(n, () => Long);public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);private Queue<string> q = new Queue<string>();[MethodImpl(MethodImplOptions.AggressiveInlining)]public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }public void Make<T1>(out T1 v1) => v1 = Next<T1>();public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4,out v5); v6 = Next<T6>(); }public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2,out v3, out v4, out v5, out v6); v7 = Next<T7>(); }public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }}#endregion