結果
問題 | No.1856 Mex Sum 2 |
ユーザー | woodywoody |
提出日時 | 2022-07-06 21:50:35 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,302 bytes |
コンパイル時間 | 3,575 ms |
コンパイル使用メモリ | 231,760 KB |
実行使用メモリ | 81,664 KB |
最終ジャッジ日時 | 2024-06-02 10:48:08 |
合計ジャッジ時間 | 18,553 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 138 ms
81,280 KB |
testcase_01 | AC | 146 ms
81,536 KB |
testcase_02 | AC | 141 ms
81,408 KB |
testcase_03 | AC | 142 ms
81,408 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 142 ms
81,408 KB |
testcase_08 | AC | 139 ms
81,408 KB |
testcase_09 | AC | 140 ms
81,408 KB |
testcase_10 | AC | 139 ms
81,536 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 138 ms
81,408 KB |
testcase_14 | AC | 136 ms
81,280 KB |
testcase_15 | WA | - |
testcase_16 | AC | 139 ms
81,408 KB |
testcase_17 | AC | 138 ms
81,408 KB |
testcase_18 | AC | 141 ms
81,280 KB |
testcase_19 | AC | 141 ms
81,408 KB |
testcase_20 | AC | 141 ms
81,408 KB |
testcase_21 | AC | 143 ms
81,408 KB |
testcase_22 | AC | 142 ms
81,408 KB |
testcase_23 | AC | 143 ms
81,408 KB |
testcase_24 | AC | 144 ms
81,280 KB |
testcase_25 | AC | 141 ms
81,408 KB |
testcase_26 | AC | 138 ms
81,280 KB |
testcase_27 | AC | 137 ms
81,408 KB |
testcase_28 | AC | 140 ms
81,408 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 295 ms
81,408 KB |
testcase_43 | AC | 261 ms
81,536 KB |
testcase_44 | AC | 263 ms
81,408 KB |
testcase_45 | AC | 287 ms
81,408 KB |
testcase_46 | AC | 262 ms
81,408 KB |
testcase_47 | AC | 271 ms
81,280 KB |
testcase_48 | AC | 290 ms
81,408 KB |
testcase_49 | AC | 295 ms
81,536 KB |
testcase_50 | AC | 231 ms
81,280 KB |
testcase_51 | AC | 309 ms
81,408 KB |
testcase_52 | AC | 306 ms
81,408 KB |
testcase_53 | AC | 316 ms
81,408 KB |
testcase_54 | AC | 301 ms
81,280 KB |
testcase_55 | AC | 308 ms
81,536 KB |
testcase_56 | AC | 300 ms
81,280 KB |
testcase_57 | AC | 304 ms
81,536 KB |
testcase_58 | AC | 305 ms
81,280 KB |
testcase_59 | AC | 306 ms
81,536 KB |
testcase_60 | AC | 307 ms
81,280 KB |
testcase_61 | AC | 309 ms
81,280 KB |
testcase_62 | AC | 307 ms
81,280 KB |
testcase_63 | AC | 308 ms
81,408 KB |
testcase_64 | AC | 303 ms
81,408 KB |
testcase_65 | AC | 307 ms
81,408 KB |
testcase_66 | AC | 303 ms
81,408 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,b) for(int i=0;i<b;i++) #define rrep(i,b) for(int i=b-1;i>=0;i--) #define rep1(i,b) for(int i=1;i<b;i++) #define repx(i,x,b) for(int i=x;i<b;i++) #define rrepx(i,x,b) for(int i=b-1;i>=x;i--) #define fore(i,a) for(auto i:a) #define fore1(i,a) for(auto &i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second using namespace std; using namespace atcoder; using ll = long long; template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>; template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}} #define dame { cout << "No" << endl; return 0;} #define dame1 { cout << -1 << endl; return 0;} #define test(x) cout << "test" << x << endl; #define deb(x,y) cout << x << " " << y << endl; #define deb3(x,y,z) cout << x << " " << y << " " << z << endl; #define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl; #define out cout << ans << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define show(x) cerr<<#x<<" = "<<x<<endl; #define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define showv2(v) fore(vy , v) cout << vy << "\n"; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; using pii = pair<int,int>; using tp = tuple<int ,int ,int>; using vi = vector<int>; using vl = vector<ll>; using vs = vector<string>; using vb = vector<bool>; using vpii = vector<pii>; using vpli = vector<pli>; using vpll = vector<pll>; using vpil = vector<pil>; using vvi = vector<vector<int>>; using vvl = vector<vector<ll>>; using vvs = vector<vector<string>>; using vvb = vector<vector<bool>>; using vvpii = vector<vector<pii>>; using vvpli = vector<vector<pli>>; using vvpll = vector<vpll>; using vvpil = vector<vpil>; using mint = modint998244353; using vm = vector<mint>; using vvm = vector<vector<mint>>; vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; const int mod = 998244353; struct combination { vector<mint> fact, ifact; combination(int n):fact(n+1),ifact(n+1) { assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } } com(10000005); int main(){ ll n,m; cin>>n>>m; mint ans = 0; rep(i,min(n+1 , m+2)){ mint sum = 0; rep(j,i+1){ mint tmp = com(i , j) * (mint(m*2+1-j).pow(n) - mint(m+1).pow(n)); if (j%2 == 1) tmp *= -1; sum += tmp; } ans += sum * i; } cout << ans.val() << endl; return 0; }