結果
問題 | No.2229 Treasure Searching Rod (Hard) |
ユーザー | tsugutsugu |
提出日時 | 2023-02-25 13:42:20 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 184 ms / 2,000 ms |
コード長 | 2,540 bytes |
コンパイル時間 | 2,193 ms |
コンパイル使用メモリ | 167,220 KB |
実行使用メモリ | 17,284 KB |
最終ジャッジ日時 | 2023-10-11 12:25:44 |
合計ジャッジ時間 | 9,206 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
15,092 KB |
testcase_01 | AC | 6 ms
15,044 KB |
testcase_02 | AC | 6 ms
15,084 KB |
testcase_03 | AC | 7 ms
15,080 KB |
testcase_04 | AC | 6 ms
15,088 KB |
testcase_05 | AC | 7 ms
15,144 KB |
testcase_06 | AC | 6 ms
15,140 KB |
testcase_07 | AC | 167 ms
16,976 KB |
testcase_08 | AC | 184 ms
17,084 KB |
testcase_09 | AC | 161 ms
17,144 KB |
testcase_10 | AC | 167 ms
17,032 KB |
testcase_11 | AC | 161 ms
17,160 KB |
testcase_12 | AC | 94 ms
15,988 KB |
testcase_13 | AC | 94 ms
15,928 KB |
testcase_14 | AC | 84 ms
16,084 KB |
testcase_15 | AC | 180 ms
17,032 KB |
testcase_16 | AC | 180 ms
17,284 KB |
testcase_17 | AC | 181 ms
17,144 KB |
testcase_18 | AC | 181 ms
17,036 KB |
testcase_19 | AC | 181 ms
17,028 KB |
testcase_20 | AC | 181 ms
16,984 KB |
testcase_21 | AC | 180 ms
17,040 KB |
testcase_22 | AC | 180 ms
17,076 KB |
testcase_23 | AC | 74 ms
15,828 KB |
testcase_24 | AC | 97 ms
16,044 KB |
testcase_25 | AC | 109 ms
16,300 KB |
testcase_26 | AC | 46 ms
15,300 KB |
testcase_27 | AC | 19 ms
15,340 KB |
testcase_28 | AC | 147 ms
16,772 KB |
testcase_29 | AC | 141 ms
16,632 KB |
testcase_30 | AC | 25 ms
15,332 KB |
testcase_31 | AC | 42 ms
15,524 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; // const int mod = 1000000007; struct modint { long long a = 0; modint(long long x = 0) {while (x < 0) x += mod; a = x % mod;} modint(const modint &r) {a = r.a;} modint operator -(){return modint(-a);} modint operator +(const modint &r) {return modint(*this) += r;} modint operator -(const modint &r) {return modint(*this) -= r;} modint operator *(const modint &r) {return modint(*this) *= r;} modint &operator +=(const modint &r) { a += r.a; if(a >= mod) a -= mod; return *this; } modint &operator -=(const modint &r) { a -= r.a; if(a < 0) a += mod; return *this; } modint &operator *=(const modint &r) { a = a * r.a % mod; return *this; } modint pow(long long r) const { if (!r) return 1; modint x = pow(r >> 1); x *= x; if (r & 1) x *= *this; return x; } modint inverse() const { return pow(mod - 2); } modint& operator/=(const modint r) { return (*this) *= r.inverse(); } modint operator/(const modint r) const { modint res(*this); return res /= r; } }; istream &operator>>(istream &is, modint &x) { long long t; is >> t; x = t; return is; } ostream &operator<<(ostream &os, const modint& x) { return os << x.a; } const int MAX = 500044; modint fac[MAX], inv[MAX], finv[MAX]; void cominit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for(int i = 2; i < MAX; i++) { fac[i] = fac[i - 1] * modint(i); inv[i] = - inv[mod % i] * modint(mod / i); finv[i] = finv[i - 1] * inv[i]; } } modint Com(long long n, long long k) { if(n < k) return 0; if(n < 0 || k < 0) return 0; return fac[n] * finv[k] * finv[n - k]; } modint Per(long long n, long long k) { if(n < k) return 0; if(n < 0 || k < 0) return 0; return fac[n] * finv[n - k]; } using Mint = modint; int main() { int h, w, k; cin >> h >> w >> k; vector<int> x(k), y(k), v(k); for (int i = 0; i < k; i++) { cin >> x[i] >> y[i] >> v[i]; } Mint ans = 0; for (int i = 0; i < k; i++) { long long A = max(1, x[i] - y[i] + 1); Mint B = (A + x[i]) * (x[i] - A + 1) / 2; long long C = max(1, x[i] - (w - y[i])); Mint D = (C + x[i]) * (x[i] - C + 1) / 2; ans += Mint(v[i]) * Mint(B + D - x[i]); } cout << ans << endl; }