結果
| 問題 | No.1141 田グリッド |
| ユーザー |
 yupiteru_kun
|
| 提出日時 | 2020-07-31 21:45:25 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 105 ms / 2,000 ms |
| コード長 | 13,630 bytes |
| コンパイル時間 | 3,465 ms |
| コンパイル使用メモリ | 124,380 KB |
| 実行使用メモリ | 29,880 KB |
| 最終ジャッジ日時 | 2024-07-06 17:28:56 |
| 合計ジャッジ時間 | 4,719 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| 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.IO;using System.Linq;using static System.Math;using System.Text;using System.Threading;using System.Globalization;using System.Runtime.CompilerServices;using Library;namespace Program{public static class ProblemC{static bool SAIKI = false;static public int numberOfRandomCases = 0;static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker){}static public void Solve(){var H = NN;var W = NN;var A = new long[H, W];LIB_Mod._mod = 1000000007;LIB_Mod allSum = 1;var zero = new bool[H, W];var zeroCnt = 0L;for (var i = 0; i < H; i++){for (var j = 0; j < W; j++){A[i, j] = NN;if (A[i, j] != 0) allSum *= A[i, j];else zeroCnt++;}}var rowList = new LIB_Mod[H];var colList = new LIB_Mod[W];var rowZeroList = new long[H];var colZeroList = new long[W];for (var i = 0; i < H; i++){rowList[i] = 1;for (var j = 0; j < W; j++){if (A[i, j] != 0) rowList[i] *= A[i, j];else rowZeroList[i] += 1;}}for (var i = 0; i < W; i++){colList[i] = 1;for (var j = 0; j < H; j++){if (A[j, i] != 0) colList[i] *= A[j, i];else colZeroList[i] += 1;}}var Q = NN;var rc = Repeat(0, Q).Select(_ => new { r = NN - 1, c = NN - 1 }).ToArray();foreach (var item in rc){var zeroZCnt = colZeroList[item.c] + rowZeroList[item.r];if (A[item.r, item.c] == 0) --zeroZCnt;if (zeroCnt - zeroZCnt > 0){Console.WriteLine(0);}else{var div = rowList[item.r] * colList[item.c];if (A[item.r, item.c] != 0) div /= A[item.r, item.c];Console.WriteLine(allSum / div);}}}class Printer : StreamWriter{public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }}static LIB_FastIO fastio = new LIB_FastIODebug();static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }static long NN => fastio.Long();static double ND => fastio.Double();static string NS => fastio.Scan();static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }static IEnumerator<uint> _xsi = _xsc();static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true){ var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }}}namespace Library {class LIB_FastIO{[MethodImpl(MethodImplOptions.AggressiveInlining)]public LIB_FastIO() { str = Console.OpenStandardInput(); }readonly Stream str;readonly byte[] buf = new byte[1024];int len, ptr;public bool isEof = false;public bool IsEndOfStream{[MethodImpl(MethodImplOptions.AggressiveInlining)]get { return isEof; }}[MethodImpl(MethodImplOptions.AggressiveInlining)]byte read(){if (isEof) throw new EndOfStreamException();if (ptr >= len){ptr = 0;if ((len = str.Read(buf, 0, 1024)) <= 0){isEof = true;return 0;}}return buf[ptr++];}[MethodImpl(MethodImplOptions.AggressiveInlining)]char Char(){byte b = 0;do b = read();while (b < 33 || 126 < b);return (char)b;}[MethodImpl(MethodImplOptions.AggressiveInlining)]virtual public string Scan(){var sb = new StringBuilder();for (var b = Char(); b >= 33 && b <= 126; b = (char)read())sb.Append(b);return sb.ToString();}[MethodImpl(MethodImplOptions.AggressiveInlining)]virtual public long Long(){long ret = 0; byte b = 0; var ng = false;do b = read();while (b != '-' && (b < '0' || '9' < b));if (b == '-') { ng = true; b = read(); }for (; true; b = read()){if (b < '0' || '9' < b)return ng ? -ret : ret;else ret = ret * 10 + b - '0';}}[MethodImpl(MethodImplOptions.AggressiveInlining)]virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }}class LIB_FastIODebug : LIB_FastIO{Queue<string> param = new Queue<string>();[MethodImpl(MethodImplOptions.AggressiveInlining)]string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue();}[MethodImpl(MethodImplOptions.AggressiveInlining)]public LIB_FastIODebug() { }[MethodImpl(MethodImplOptions.AggressiveInlining)]public override string Scan() => NextString();[MethodImpl(MethodImplOptions.AggressiveInlining)]public override long Long() => long.Parse(NextString());[MethodImpl(MethodImplOptions.AggressiveInlining)]public override double Double() => double.Parse(NextString());}partial struct LIB_Mod : IEquatable<LIB_Mod>, IEquatable<long>{static public long _mod = 1000000007; long v;[MethodImpl(MethodImplOptions.AggressiveInlining)]public LIB_Mod(long x){if (x < _mod && x >= 0) v = x;else if ((v = x % _mod) < 0) v += _mod;}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public implicit operator LIB_Mod(long x) => new LIB_Mod(x);[MethodImpl(MethodImplOptions.AggressiveInlining)]static public implicit operator long(LIB_Mod x) => x.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]public void Add(LIB_Mod x) { if ((v += x.v) >= _mod) v -= _mod; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public void Sub(LIB_Mod x) { if ((v -= x.v) < 0) v += _mod; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public void Mul(LIB_Mod x) => v = (v * x.v) % _mod;[MethodImpl(MethodImplOptions.AggressiveInlining)]public void Div(LIB_Mod x) => v = (v * Inverse(x.v)) % _mod;[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod operator +(LIB_Mod x, LIB_Mod y) { var t = x.v + y.v; return t >= _mod ? new LIB_Mod { v = t - _mod } : new LIB_Mod { v= t }; }[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod operator -(LIB_Mod x, LIB_Mod y) { var t = x.v - y.v; return t < 0 ? new LIB_Mod { v = t + _mod } : new LIB_Mod { v = t}; }[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod operator *(LIB_Mod x, LIB_Mod y) => x.v * y.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod operator /(LIB_Mod x, LIB_Mod y) => x.v * Inverse(y.v);[MethodImpl(MethodImplOptions.AggressiveInlining)]static public bool operator ==(LIB_Mod x, LIB_Mod y) => x.v == y.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]static public bool operator !=(LIB_Mod x, LIB_Mod y) => x.v != y.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]static public long Inverse(long x){long b = _mod, r = 1, u = 0, t = 0;while (b > 0){var q = x / b;t = u;u = r - q * u;r = t;t = b;b = x - q * b;x = t;}return r < 0 ? r + _mod : r;}[MethodImpl(MethodImplOptions.AggressiveInlining)]public bool Equals(LIB_Mod x) => v == x.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]public bool Equals(long x) => v == x;[MethodImpl(MethodImplOptions.AggressiveInlining)]public override bool Equals(object x) => x == null ? false : Equals((LIB_Mod)x);[MethodImpl(MethodImplOptions.AggressiveInlining)]public override int GetHashCode() => v.GetHashCode();[MethodImpl(MethodImplOptions.AggressiveInlining)]public override string ToString() => v.ToString();static List<LIB_Mod> _fact = new List<LIB_Mod>() { 1 };static long _factm = _mod;[MethodImpl(MethodImplOptions.AggressiveInlining)]static void B(long n){if (_factm != _mod) _fact = new List<LIB_Mod>() { 1 };if (n >= _fact.Count)for (int i = _fact.Count; i <= n; ++i)_fact.Add(_fact[i - 1] * i);_factm = _mod;}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod Comb(long n, long k){B(n);if (n == 0 && k == 0) return 1;if (n < k || n < 0) return 0;return _fact[(int)n] / _fact[(int)(n - k)] / _fact[(int)k];}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod CombOK(long n, long k){LIB_Mod ret = 1;for (var i = 0; i < k; i++) ret *= n - i;for (var i = 1; i <= k; i++) ret /= i;return ret;}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod Perm(long n, long k){B(n);if (n == 0 && k == 0) return 1;if (n < k || n < 0) return 0;return _fact[(int)n] / _fact[(int)(n - k)];}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod KanzenPerm(long n) => Enumerable.Range(0, (int)n + 1).Aggregate((LIB_Mod)0, (a, e) => a + (1 - ((e & 1) << 1)) *LIB_Mod.Comb(n, e) * LIB_Mod.Perm(n - e, n - e));[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod Pow(LIB_Mod x, long y){LIB_Mod a = 1;while (y != 0){if ((y & 1) == 1) a.Mul(x);x.Mul(x);y >>= 1;}return a;}}}