結果
問題 | No.2529 Treasure Hunter |
ユーザー |
👑 ![]() |
提出日時 | 2023-11-03 21:40:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 106 ms / 2,000 ms |
コード長 | 3,229 bytes |
コンパイル時間 | 2,114 ms |
コンパイル使用メモリ | 201,524 KB |
最終ジャッジ日時 | 2025-02-17 17:55:05 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 22 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}namespace po167{struct combination{int upper;int MOD;std::vector<long long> fact;std::vector<long long> rev;std::vector<long long> fact_rev;combination(int max,long long mod):upper(max),MOD(mod),fact(max+1),rev(max+1),fact_rev(max+1){for(long long i=0;i<=max;i++){if(i<2){fact[i]=1;fact_rev[i]=1;rev[i]=1;continue;}fact[i]=(fact[i-1]*i)%mod;rev[i]=mod-((mod/i)*rev[mod%i])%mod;fact_rev[i]=(fact_rev[i-1]*rev[i])%mod;}}long long Comb(int x,int y){assert(upper>=x);if (x<y||y<0||x<0) return 0;return (((fact_rev[y]*fact_rev[x-y])%MOD)*fact[x])%MOD;}long long P(int x,int y){assert(upper>=x);if (x<y||y<0||x<0) return 0;return (fact_rev[x-y]*fact[x])%MOD;}};}using po167::combination;combination table(400400,mod);void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;cin>>t;rep(i,0,t) solve();}void solve(){ll N,M;cin>>N>>M;vector<ll> dp={1,0,0};rep(rprp,0,M){vector<ll> n_dp(3);rep(i,0,3) n_dp[0]=(n_dp[0]+dp[i])%mod;rep(i,0,3) n_dp[1]=(n_dp[1]+dp[i]*(N-i))%mod;n_dp[2]+=dp[0]*(((N*(N-3))/2)%mod)%mod;n_dp[2]+=dp[1]*table.Comb(N-2,2)%mod;n_dp[2]+=dp[2]*table.Comb(N-3,2)%mod;if(N>=4) n_dp[2]+=dp[2];if(N==2) n_dp[2]=0;n_dp[2]%=mod;swap(n_dp,dp);}ll ans=vec_sum(dp);cout<<ans%mod<<"\n";}