#962517 (C++17) No.2683 Two Sheets

• 問題: No.2683 Two Sheets
• ユーザー: binap
• 提出日時: 2024-03-20 21:49:47
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 60 ms / 2,000 ms
• コード長: 1,942 bytes
• コンパイル時間: 4,290 ms
• コンパイル使用メモリ: 263,476 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-03-20 21:49:53
• 合計ジャッジ時間: 5,509 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	4 ms; 6,676 KB
testcase_03	AC	43 ms; 6,676 KB
testcase_04	AC	10 ms; 6,676 KB
testcase_05	AC	40 ms; 6,676 KB
testcase_06	AC	36 ms; 6,676 KB
testcase_07	AC	29 ms; 6,676 KB
testcase_08	AC	51 ms; 6,676 KB
testcase_09	AC	30 ms; 6,676 KB
testcase_10	AC	50 ms; 6,676 KB
testcase_11	AC	45 ms; 6,676 KB
testcase_12	AC	37 ms; 6,676 KB
testcase_13	AC	60 ms; 6,676 KB
testcase_14	AC	57 ms; 6,676 KB
testcase_15	AC	39 ms; 6,676 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

using mint = modint998244353;

int main(){
	long long h, w, a, b;
	cin >> h >> w >> a >> b;
	mint ans = a * b * 2;
	mint f_sum = 0;
	for(long long y = 1; y <= h; y++){
		long long high = min(h - a + 1, y);
		long long low = max(1LL, y - a + 1);
//		cout << y << ' ' << low << ' ' << high << "\n";
		mint f = mint(high - low + 1) / (h - a + 1);
		f_sum += f * f;
	}
	mint g_sum = 0;
	for(long long x = 1; x <= w; x++){
		long long high = min(w - b + 1, x);
		long long low = max(1LL, x - b + 1);
		mint g = mint(high - low + 1) / (w - b + 1);
		g_sum += g * g;
	}
	ans -= f_sum * g_sum;
	cout << ans <<"\n";
	return 0;
}