結果
問題 | No.1141 田グリッド |
ユーザー |
|
提出日時 | 2020-07-31 22:01:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,451 bytes |
コンパイル時間 | 1,350 ms |
コンパイル使用メモリ | 133,068 KB |
最終ジャッジ日時 | 2025-01-12 10:06:45 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 WA * 5 RE * 8 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:95:23: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 95 | ll H, W; scanf("%lld %lld", &H, &W); | ~~~~~^~~~~~~~~~~~~~~~~~~~~ main.cpp:96:110: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 96 | vector<vector<ll>> a(H, vector<ll>(W)); for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) scanf("%lld", &a[i][j]); | ~~~~~^~~~~~~~~~~~~~~~~~ main.cpp:114:23: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 114 | int kkt; scanf("%d", &kkt); | ~~~~~^~~~~~~~~~~~ main.cpp:123:40: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 123 | int r, c; scanf("%d %d", &r, &c); | ~~~~~^~~~~~~~~~~~~~~~~ main.cpp:148:40: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 148 | int r, c; scanf("%d %d", &r, &c); | ~~~~~^~~~~~~~~~~~~~~~~
ソースコード
#include <cstdio> #include <iostream> #include <string> #include <sstream> #include <stack> #include <algorithm> #include <cmath> #include <queue> #include <map> #include <set> #include <cstdlib> #include <bitset> #include <tuple> #include <assert.h> #include <deque> #include <bitset> #include <iomanip> #include <limits> #include <chrono> #include <random> #include <array> #include <unordered_map> #include <functional> #include <complex> #include <numeric> template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } //constexpr long long MAX = 5100000; constexpr long long INF = 1LL << 60; constexpr int inf = 1000000007; constexpr long long mod = 1000000007LL; //constexpr long long mod = 998244353LL; const long double PI = acos((long double)(-1)); using namespace std; typedef unsigned long long ull; typedef long long ll; typedef long double ld; struct mint { long long x; mint(long long x = 0) :x((x% mod + mod) % mod) {} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint res(*this); return res += a; } mint operator-(const mint a) const { mint res(*this); return res -= a; } mint operator*(const mint a) const { mint res(*this); return res *= a; } mint pow(ll t) const { if (!t) return 1; mint a = pow(t >> 1); a *= a; if (t & 1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod - 2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res /= a; } }; int main() { /* cin.tie(nullptr); ios::sync_with_stdio(false); */ ll H, W; scanf("%lld %lld", &H, &W); vector<vector<ll>> a(H, vector<ll>(W)); for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) scanf("%lld", &a[i][j]); int ch = 0, cw = 0, zh = -1, zw = -1; for (int i = 0; i < H; i++) { bool ok = false; for (int j = 0; j < W; j++) ok |= (a[i][j] == 0); if (ok) { ch++; zh = i; } } for (int j = 0; j < W; j++) { bool ok = false; for (int i = 0; i < H; i++) ok |= (a[i][j] == 0); if (ok) { cw++; zw = j; } } int kkt; scanf("%d", &kkt); if (ch >= 2 or cw >= 2) { assert(false); for (int i = 0; i < kkt; i++) puts("0"); } else if (ch == 1 or cw == 1) { mint all = 1; for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) if (zh != i and zw != j) all *= a[i][j]; while (kkt--) { int r, c; scanf("%d %d", &r, &c); r--; c--; if ((zh == -1 or zh == r) and (zw == -1 or zw == c)) { printf("%lld\n", all.x); } else { puts("0"); } } } else { mint all = 1; for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) if (zh != i and zw != j) all *= a[i][j]; vector<mint> pH(H, 1), pW(W, 1); for (int i = 0; i < H; i++) { mint res = 1; for (int j = 0; j < W; j++) res *= a[i][j]; pH[i] = res; } for (int j = 0; j < W; j++) { mint res = 1; for (int i = 0; i < H; i++) res *= a[i][j]; pW[j] = res; } while (kkt--) { int r, c; scanf("%d %d", &r, &c); r--; c--; printf("%lld\n", (all / pH[r] / pW[c] * a[r][c]).x); } } return 0; }