結果
| 問題 | No.3004 ヤング図形 |
| ユーザー |
👑  AngrySadEight
|
| 提出日時 | 2025-01-17 22:44:40 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 606 ms / 4,000 ms |
| コード長 | 4,170 bytes |
| コンパイル時間 | 4,864 ms |
| コンパイル使用メモリ | 192,432 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2025-01-17 22:45:02 |
| 合計ジャッジ時間 | 13,707 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 25 |
ソースコード
#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}ll my_pow(ll x, ll n, ll mod) {// 繰り返し二乗法．x^nをmodで割った余り．ll ret;if (n == 0) {ret = 1;} else if (n % 2 == 1) {ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;} else {ret = my_pow((x * x) % mod, n / 2, mod);}return ret;}ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }int main() {ll K;cin >> K;vector<ll> L(K);vector<ll> M(K);for (ll i = 0; i < K; i++) {cin >> L[i] >> M[i];}ll now = 0;for (ll i = 0; i < K; i++) {now += L[i] * M[i];}ll max_now = now;vector<ll> appear_val(1, now);for (ll i = 0; i < K; i++) {now -= L[i] * M[i];appear_val.push_back(now);appear_val.push_back(L[i]);appear_val.push_back(M[i]);}sort(all(appear_val));appear_val.erase(unique(all(appear_val)), appear_val.end());// debug(appear_val);map<ll, ll> fact;map<ll, ll> fact_inv;ll now_fact = 1;ll cur = 0;for (ll i = 0; i <= max_now; i++) {if (appear_val[cur] == i) {fact[i] = now_fact;fact_inv[i] = inv(now_fact, mod2);cur++;}now_fact = (now_fact * (i + 1)) % mod2;}ll ans = 1;now = max_now;for (ll i = 0; i < K; i++) {// debug_out(now, now - L[i] * M[i], L[i], M[i]);ans = (ans * fact[now]) % mod2;ans = (ans * fact_inv[now - L[i] * M[i]]) % mod2;ans = (ans * my_pow(fact_inv[L[i]], M[i], mod2)) % mod2;ans = (ans * fact_inv[M[i]]) % mod2;now -= L[i] * M[i];}cout << ans << endl;}