結果
問題 | No.2230 Good Omen of White Lotus |
ユーザー | miscalc |
提出日時 | 2023-02-24 23:06:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 285 ms / 2,000 ms |
コード長 | 2,700 bytes |
コンパイル時間 | 4,632 ms |
コンパイル使用メモリ | 266,992 KB |
実行使用メモリ | 21,764 KB |
最終ジャッジ日時 | 2023-10-11 06:48:59 |
合計ジャッジ時間 | 11,229 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,352 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,352 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 1 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,356 KB |
testcase_07 | AC | 1 ms
4,348 KB |
testcase_08 | AC | 2 ms
4,352 KB |
testcase_09 | AC | 2 ms
4,352 KB |
testcase_10 | AC | 2 ms
4,352 KB |
testcase_11 | AC | 1 ms
4,348 KB |
testcase_12 | AC | 1 ms
4,348 KB |
testcase_13 | AC | 1 ms
4,348 KB |
testcase_14 | AC | 73 ms
4,672 KB |
testcase_15 | AC | 2 ms
4,356 KB |
testcase_16 | AC | 116 ms
5,108 KB |
testcase_17 | AC | 117 ms
5,136 KB |
testcase_18 | AC | 116 ms
5,000 KB |
testcase_19 | AC | 116 ms
5,044 KB |
testcase_20 | AC | 9 ms
4,352 KB |
testcase_21 | AC | 2 ms
4,352 KB |
testcase_22 | AC | 11 ms
4,348 KB |
testcase_23 | AC | 12 ms
4,352 KB |
testcase_24 | AC | 9 ms
15,328 KB |
testcase_25 | AC | 10 ms
15,492 KB |
testcase_26 | AC | 10 ms
15,436 KB |
testcase_27 | AC | 176 ms
21,764 KB |
testcase_28 | AC | 202 ms
21,708 KB |
testcase_29 | AC | 178 ms
17,208 KB |
testcase_30 | AC | 206 ms
17,368 KB |
testcase_31 | AC | 214 ms
21,592 KB |
testcase_32 | AC | 215 ms
21,592 KB |
testcase_33 | AC | 277 ms
19,664 KB |
testcase_34 | AC | 281 ms
19,860 KB |
testcase_35 | AC | 285 ms
19,480 KB |
testcase_36 | AC | 274 ms
19,500 KB |
testcase_37 | AC | 275 ms
19,596 KB |
testcase_38 | AC | 278 ms
19,600 KB |
testcase_39 | AC | 281 ms
19,596 KB |
testcase_40 | AC | 92 ms
16,124 KB |
testcase_41 | AC | 72 ms
8,016 KB |
testcase_42 | AC | 171 ms
11,668 KB |
testcase_43 | AC | 16 ms
11,744 KB |
testcase_44 | AC | 238 ms
14,820 KB |
testcase_45 | AC | 79 ms
8,564 KB |
testcase_46 | AC | 150 ms
15,652 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>; using tlll = tuple<ll, ll, ll>; constexpr ll INF = 1LL << 60; template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;} template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;} ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;} ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;} ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);} ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;} ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;} ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;} ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; } ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); } ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); } template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());} template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());} #define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';} template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';} template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);} //* #include <atcoder/all> using namespace atcoder; using mint = modint998244353; //using mint = modint1000000007; //using mint = modint; //*/ ll op(ll a, ll b) { return max(a, b); } ll e() { return -INF; } int main() { ll H, W, N, P; cin >> H >> W >> N >> P; vector<vector<ll>> A(H); for (ll i = 0; i < N; i++) { ll x, y; cin >> x >> y; x--, y--; A.at(x).push_back(y); } for (auto &a : A) sort(a.begin(), a.end()); lazy_segtree<ll, op, e, ll, op, op, e> seg(vector<ll>(W, 0)); for (auto &a : A) { for (auto i : a) { seg.apply(i, W, seg.get(i) + 1); } } ll res = seg.get(W - 1); cerr << res << endl; mint ans = 1 - (mint(P - 2) / P).pow(res) * (mint(P - 1) / P).pow(H + W - 3 - res); cout << ans.val() << endl; }