結果
| 問題 | No.1691 Badugi |
| ユーザー |
 packer_jp
|
| 提出日時 | 2021-09-24 23:19:28 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,359 bytes |
| コンパイル時間 | 1,954 ms |
| コンパイル使用メモリ | 206,092 KB |
| 実行使用メモリ | 26,752 KB |
| 最終ジャッジ日時 | 2024-07-05 11:32:22 |
| 合計ジャッジ時間 | 4,346 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define SZ(x) ((int)(x).size())
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define vsum(x) reduce(all(x))
#define vmax(a) *max_element(all(a))
#define vmin(a) *min_element(all(a))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define mp make_pair
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vi = vector<int>;
using Vl = vector<ll>;
using Vc = vector<char>;
using VVi = vector<vector<int>>;
using VVl = vector<vector<ll>>;
using VVc = vector<vector<char>>;
template <typename T, typename U> using P = pair<T, U>;
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
constexpr ll inf = 1000000000ll;
constexpr ll INF = 4000000004000000000LL;
constexpr ld eps = 1e-15;
constexpr ld PI = 3.141592653589793;
constexpr int popcnt(ull x) { return __builtin_popcountll(x); }
template <typename T> using mat = vector<vector<T>>;
constexpr ll dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr ll dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr ll sign(ll a) { return (a > 0) - (a < 0); }
constexpr ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
constexpr ll cdiv(ll a, ll b) { return -fdiv(-a, b); }
constexpr ull bit(int n) { return 1ull << n; }
template <typename T> constexpr T mypow(T x, ll n) {
T ret = 1;
while (n) {
if (n & 1) ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
constexpr ll modpow(ll x, ll n, ll mod) {
ll ret = 1;
while (n) {
if (n & 1) ret *= x;
x *= x;
n >>= 1;
x %= mod;
ret %= mod;
}
return ret;
}
template <typename T> T xor64(T lb, T ub) {
static ull x = 88172645463325252ull;
x ^= x << 7;
return lb + (x ^= x >> 9) % (ub - lb);
}
constexpr ll safemod(ll x, ll mod) { return (x % mod + mod) % mod; }
template <typename T> constexpr T sq(const T &a) { return a * a; }
template <typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename U> bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <typename T, typename U> bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
os << "(" << a.first << ", " << a.second << ")";
return os;
}
template <typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {
os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
os << "(";
for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
os << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &a) {
os << "(";
for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
os << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
os << "(";
for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
os << ")";
return os;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
os << "(";
for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
os << ")";
return os;
}
template <typename T> void print(const T &a) { cout << a << endl; }
template <typename T> void print(const vector<T> &v) {
for (auto &e : v) cout << e << " ";
cout << endl;
}
template <typename T> void scan(vector<T> &a) {
for (auto &i : a) cin >> i;
}
struct timer {
clock_t start_time;
void start() { start_time = clock(); }
int lap() {
// return x ms.
return (clock() - start_time) * 1000 / CLOCKS_PER_SEC;
}
};
template <typename T = int> struct Edge {
int from, to;
T cost;
int idx;
Edge() = default;
Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}
operator int() const { return to; }
};
template <typename T = int> struct Graph {
vector<vector<Edge<T>>> g;
int es;
Graph() = default;
explicit Graph(int n) : g(n), es(0) {}
size_t size() const { return g.size(); }
void add_directed_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es++); }
void add_edge(int from, int to, T cost = 1) {
g[from].emplace_back(from, to, cost, es);
g[to].emplace_back(to, from, cost, es++);
}
void read(int M, int padding = -1, bool weighted = false, bool directed = false) {
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a += padding;
b += padding;
T c = T(1);
if (weighted) cin >> c;
if (directed)
add_directed_edge(a, b, c);
else
add_edge(a, b, c);
}
}
};
#ifdef ONLINE_JUDGE
#define dump(...) (void(0))
#else
void debug() { cerr << endl; }
template <typename Head, typename... Tail> void debug(Head &&head, Tail &&... tail) {
cerr << head;
if (sizeof...(Tail)) cerr << ", ";
debug(tail...);
}
#define dump(...) cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ", debug(__VA_ARGS__)
#endif
struct rep {
struct itr {
ll v;
itr(ll v) : v(v) {}
void operator++() { ++v; }
ll operator*() const { return v; }
bool operator!=(itr i) const { return v < *i; }
};
ll l, r;
rep(ll l, ll r) : l(l), r(r) {}
rep(ll r) : rep(0, r) {}
itr begin() const { return l; };
itr end() const { return r; };
};
struct per {
struct itr {
ll v;
itr(ll v) : v(v) {}
void operator++() { --v; }
ll operator*() const { return v; }
bool operator!=(itr i) const { return v > *i; }
};
ll l, r;
per(ll l, ll r) : l(l), r(r) {}
per(ll r) : per(0, r) {}
itr begin() const { return r - 1; };
itr end() const { return l - 1; };
};
struct io_setup {
static constexpr int PREC = 20;
io_setup() {
cout << fixed << setprecision(PREC);
cerr << fixed << setprecision(PREC);
};
} iOS;
template <ll MOD = 1000000007> struct modint {
ll val;
modint(ll val = 0) : val(val >= 0 ? val % MOD : (MOD - (-val) % MOD) % MOD) {}
static ll mod() { return MOD; }
modint inv() const {
ll a = val, b = MOD, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return modint(u);
}
modint pow(ll k) const {
modint ret = 1, mul = val;
while (k) {
if (k & 1) ret *= mul;
mul *= mul;
k >>= 1;
}
return ret;
}
modint &operator+=(const modint &a) {
if ((val += a.val) >= MOD) val -= MOD;
return *this;
}
modint &operator-=(const modint &a) {
if ((val += MOD - a.val) >= MOD) val -= MOD;
return *this;
}
modint &operator*=(const modint &a) {
(val *= a.val) %= MOD;
return *this;
}
modint &operator/=(const modint &a) { return *this *= a.inv(); }
modint operator+() const { return *this; }
modint operator-() const { return modint(-val); }
friend bool operator==(const modint &a, const modint &b) { return a.val == b.val; }
friend bool operator!=(const modint &a, const modint &b) { return rel_ops::operator!=(a, b); }
friend modint operator+(const modint &a, const modint &b) { return modint(a) += b; }
friend modint operator-(const modint &a, const modint &b) { return modint(a) -= b; }
friend modint operator*(const modint &a, const modint &b) { return modint(a) *= b; }
friend modint operator/(const modint &a, const modint &b) { return modint(a) /= b; }
friend istream &operator>>(istream &is, modint &a) {
ll val;
is >> val;
a = modint(val);
return is;
}
friend ostream &operator<<(ostream &os, const modint &a) { return os << a.val; }
};
template <typename T, T INF = numeric_limits<T>::max()> void wf(vector<vector<T>> &g) {
int n = g.size();
for (int k : rep(n)) {
for (int i : rep(n)) {
for (int j : rep(n)) {
if (g[i][k] != INF && g[k][j] != INF) chmin(g[i][j], g[i][k] + g[k][j]);
}
}
}
}
template <typename mint> struct combination {
vector<mint> fact, finv, inv;
combination(int n) : fact(n + 1), finv(n + 1), inv(n + 1) {
fact[0] = fact[1] = finv[0] = finv[1] = inv[1] = 1;
for (int i : rep(2, n + 1)) {
fact[i] = fact[i - 1] * i;
inv[i] = -inv[mint::mod() % i] * (mint::mod() / i);
finv[i] = finv[i - 1] * inv[i];
}
}
mint P(int n, int r) { return r < 0 || n < r ? 0 : (fact[n] * finv[n - r]); }
mint C(int n, int r) { return P(n, r) * finv[r]; }
mint H(int n, int r) { return C(n + r - 1, r); }
mint catalan(int n) { return C(2 * n, n) / (n + 1); }
};
int main() {
using mint = modint<998244353>;
ll n, m, k;
cin >> n >> m >> k;
combination<mint> comb(n + m + 2);
mint ans = 0;
for (ll i : rep(k - 2, k + 1)) {
for (ll j : rep(k - 2, k + 1)) {
if (i + j >= 2 * k - 1) continue;
mint s = comb.C(n, i) * comb.C(m, j);
ll a = i, b = j;
if (a > b) swap(a, b);
if (a == k - 2) {
mint cur = 0;
// b個の箱
for (ll x : rep(b + 1)) cur += mint(-1).pow(b - x) * comb.C(b, x) * mint(x).pow(a);
ans += s * cur;
} else {
// a = b = k - 1
mint cur = comb.C(a, 2) * comb.C(b, 2) * (k - 3) * comb.fact[k - 3];
ans += s * cur;
}
}
}
cout << ans << endl;
}