結果
問題 | No.1552 Simple Dice Game |
ユーザー | tokusakurai |
提出日時 | 2021-06-18 21:56:00 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 888 ms / 2,500 ms |
コード長 | 3,457 bytes |
コンパイル時間 | 2,149 ms |
コンパイル使用メモリ | 203,492 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-22 20:18:43 |
合計ジャッジ時間 | 12,468 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 888 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 654 ms
5,376 KB |
testcase_10 | AC | 768 ms
5,376 KB |
testcase_11 | AC | 773 ms
5,376 KB |
testcase_12 | AC | 220 ms
5,376 KB |
testcase_13 | AC | 654 ms
5,376 KB |
testcase_14 | AC | 375 ms
5,376 KB |
testcase_15 | AC | 480 ms
5,376 KB |
testcase_16 | AC | 69 ms
5,376 KB |
testcase_17 | AC | 110 ms
5,376 KB |
testcase_18 | AC | 589 ms
5,376 KB |
testcase_19 | AC | 848 ms
5,376 KB |
testcase_20 | AC | 850 ms
5,376 KB |
testcase_21 | AC | 848 ms
5,376 KB |
testcase_22 | AC | 847 ms
5,376 KB |
testcase_23 | AC | 882 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define each(e, v) for(auto &e: v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;//const int MOD = 1000000007;const int MOD = 998244353;const int inf = (1<<30)-1;const ll INF = (1LL<<60)-1;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};struct io_setup{io_setup(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;template<int mod>struct Mod_Int{int x;Mod_Int() : x(0) {}Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}Mod_Int &operator += (const Mod_Int &p){if((x += p.x) >= mod) x -= mod;return *this;}Mod_Int &operator -= (const Mod_Int &p){if((x += mod - p.x) >= mod) x -= mod;return *this;}Mod_Int &operator *= (const Mod_Int &p){x = (int) (1LL * x * p.x % mod);return *this;}Mod_Int &operator /= (const Mod_Int &p){*this *= p.inverse();return *this;}Mod_Int &operator ++ () {return *this += Mod_Int(1);}Mod_Int operator ++ (int){Mod_Int tmp = *this;++*this;return tmp;}Mod_Int &operator -- () {return *this -= Mod_Int(1);}Mod_Int operator -- (int){Mod_Int tmp = *this;--*this;return tmp;}Mod_Int operator - () const {return Mod_Int(-x);}Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}bool operator == (const Mod_Int &p) const {return x == p.x;}bool operator != (const Mod_Int &p) const {return x != p.x;}Mod_Int inverse() const{assert(*this != Mod_Int(0));return pow(mod-2);}Mod_Int pow(long long k) const{Mod_Int now = *this, ret = 1;for(; k > 0; k >>= 1, now *= now){if(k&1) ret *= now;}return ret;}friend ostream &operator << (ostream &os, const Mod_Int &p){return os << p.x;}friend istream &operator >> (istream &is, Mod_Int &p){long long a;is >> a;p = Mod_Int<mod>(a);return is;}};using mint = Mod_Int<MOD>;int main(){ll N, M; cin >> N >> M;mint n = mint(N), tw = mint(2).inverse();mint ans = 0;for(ll i = 1; i < M; i++){mint T = tw*n*i*(i+1)*mint(i+1).pow(N-1);T -= n*i*i*mint(i).pow(N-1);T += tw*n*i*(i-1)*mint(i-1).pow(N-1);mint S = mint(i+1).pow(N)-mint(i).pow(N)*2+mint(i-1).pow(N);ans += T*(M-i)*i;ans += tw*(M-i)*(M-i+1)*i*S*n;//cout << T << ' ' << S << ' ' << ans << '\n';}cout << ans << '\n';}