結果
問題 | No.2668 Trees on Graph Paper |
ユーザー | 👑 potato167 |
提出日時 | 2024-03-08 21:33:48 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2,195 ms / 3,000 ms |
コード長 | 3,691 bytes |
コンパイル時間 | 2,309 ms |
コンパイル使用メモリ | 208,000 KB |
実行使用メモリ | 276,608 KB |
最終ジャッジ日時 | 2024-09-29 18:59:59 |
合計ジャッジ時間 | 26,440 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 33 |
ソースコード
#include <bits/stdc++.h>#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,T b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,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){T ans=T(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;}int m;struct mint{//static constexpr int m = 998244353;int x;mint() : x(0){}mint(long long x_):x(x_ % m){if (x < 0) x += m;}int val(){return x;}mint &operator+=(mint b){if ((x += b.x) >= m) x -= m; return *this;}mint &operator-=(mint b){if ((x -= b.x) < 0) x += m; return *this;}mint &operator*=(mint b){x= (long long)(x) * b.x % m; return *this;}mint pow(long long e) const {mint r = 1,b =*this;while (e){if (e & 1) r *= b;b *= b;e >>= 1;}return r;}mint inv(){return pow(m - 2);}mint &operator/=(mint b){return *this *= b.pow(m - 2);}friend mint operator+(mint a, mint b){return a += b;}friend mint operator-(mint a, mint b){return a -= b;}friend mint operator/(mint a, mint b){return a /= b;}friend mint operator*(mint a, mint b){return a *= b;}friend bool operator==(mint a, mint b){return a.x == b.x;}friend bool operator!=(mint a, mint b){return a.x != b.x;}};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;cin>>n>>m;vector dp(n,vector<mint>(3));dp[0][0]=1;dp[0][1]=1;dp[0][2]=1;rep(i,0,n-1){mint X=2*i+2,Y=2*i+3;rep(j,0,3) rep(k,0,4) rep(l,0,4) if(2<=j+k+l&&j+k+l<=4){mint val=dp[i][j];if(k==0) val*=X;if(l==0) val*=Y;int ind=j-1;rep(rp,0,k){ind++;if(ind<0||2<ind) val=0;}ind--;rep(rp,0,l){ind++;if(ind<0||2<ind) val=0;}dp[i+1][j+k+l-2]+=val;}}mint ans=1;rep(i,1,2*n) ans*=i;rep(i,0,n-1) ans*=dp[i][2];/*rep(i,0,n){for(auto x:dp[i]) cout<<x.x<<" ";cout<<endl;}*/cout<<ans.val()<<"\n";}