#843718 (C++17) No.2230 Good Omen of White Lotus

• 問題: No.2230 Good Omen of White Lotus
• ユーザー: noya2
• 提出日時: 2023-02-24 22:53:45
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 124 ms / 2,000 ms
• コード長: 4,263 bytes
• コンパイル時間: 4,898 ms
• コンパイル使用メモリ: 273,540 KB
• 実行使用メモリ: 17,160 KB
• 最終ジャッジ日時: 2024-09-13 05:57:09
• 合計ジャッジ時間: 8,170 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	2 ms; 6,940 KB
testcase_08	AC	2 ms; 6,940 KB
testcase_09	AC	2 ms; 6,944 KB
testcase_10	AC	2 ms; 6,944 KB
testcase_11	AC	2 ms; 6,944 KB
testcase_12	AC	2 ms; 6,940 KB
testcase_13	AC	2 ms; 6,940 KB
testcase_14	AC	29 ms; 6,940 KB
testcase_15	AC	3 ms; 6,940 KB
testcase_16	AC	42 ms; 6,940 KB
testcase_17	AC	43 ms; 6,940 KB
testcase_18	AC	42 ms; 6,940 KB
testcase_19	AC	42 ms; 6,944 KB
testcase_20	AC	4 ms; 6,940 KB
testcase_21	AC	2 ms; 6,940 KB
testcase_22	AC	5 ms; 6,944 KB
testcase_23	AC	6 ms; 6,944 KB
testcase_24	AC	8 ms; 10,812 KB
testcase_25	AC	8 ms; 10,720 KB
testcase_26	AC	7 ms; 10,676 KB
testcase_27	AC	61 ms; 17,156 KB
testcase_28	AC	71 ms; 17,020 KB
testcase_29	AC	64 ms; 11,572 KB
testcase_30	AC	71 ms; 11,580 KB
testcase_31	AC	81 ms; 17,160 KB
testcase_32	AC	81 ms; 17,072 KB
testcase_33	AC	124 ms; 14,652 KB
testcase_34	AC	119 ms; 14,732 KB
testcase_35	AC	114 ms; 14,764 KB
testcase_36	AC	121 ms; 14,780 KB
testcase_37	AC	121 ms; 14,712 KB
testcase_38	AC	119 ms; 14,680 KB
testcase_39	AC	122 ms; 14,676 KB
testcase_40	AC	40 ms; 11,352 KB
testcase_41	AC	27 ms; 6,940 KB
testcase_42	AC	73 ms; 10,904 KB
testcase_43	AC	9 ms; 7,040 KB
testcase_44	AC	99 ms; 12,260 KB
testcase_45	AC	30 ms; 6,944 KB
testcase_46	AC	60 ms; 11,056 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}
istream &operator>>(istream &is,vector<mint> &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;}

int op(int a, int b){
    return max(a,b);
}
int e(){
    return 0;
}

void solve(){
    int h, w, n, p; cin >> h >> w >> n >> p;
    vector<vector<int>> a(h);
    rep(i,n){
        int x, y; cin >> x >> y; x--, y--;
        a[x].emplace_back(y);
    }
    segtree<int,op,e> seg(w);
    int cnt = 0;
    rep(i,h){
        sort(all(a[i]));
        for (int y : a[i]){
            int cur = seg.prod(0,y+1) + 1;
            seg.set(y,max(seg.get(y),cur));
            chmax(cnt,cur);
        }
    }
    mint ans = mint(1) - mint(p-2).pow(cnt) * mint(p-1).pow(h+w-3-cnt) / mint(p).pow(h+w-3);
    out(ans.val());
}

int main(){
    fast_io();
    int t = 1; //cin >> t;
    while(t--) solve();
}