結果
| 問題 | No.1960 Guruguru Permutation |
| ユーザー |
 eQe
|
| 提出日時 | 2022-05-28 00:06:28 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 34 ms / 2,000 ms |
| コード長 | 5,293 bytes |
| コンパイル時間 | 4,587 ms |
| コンパイル使用メモリ | 271,452 KB |
| 最終ジャッジ日時 | 2025-01-29 16:27:02 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 22 |
ソースコード
#include<atcoder/all>#include<bits/stdc++.h>using namespace atcoder;using namespace std;#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define fin(a) return pt(a)using ll=long long;using ld=long double;using v1=vector<ll>;using v2=vector<v1>;using v3=vector<v2>;using v4=vector<v3>;using pll=pair<ll,ll>;using mll=map<ll,ll>;ll inf=1LL<<60;ld pi=acos(-1);ld eps=1e-10;template<class T>using ascending_priority_queue=std::priority_queue<T,vector<T>,greater<T>>;template<class T>using descending_priority_queue=std::priority_queue<T>;template<class T>bool chmax(T&a,const T&b){if(a<b){a=b;return 1;}return 0;}template<class T>bool chmin(T&a,const T&b){if(b<a){a=b;return 1;}return 0;}template<class V,class T>T max(vector<V>&vec,const T&id){T r=id;for(auto&v:vec)chmax(r,max(v,id));return r;}template<class V,class T>T min(vector<V>&vec,const T&id){T r=id;for(auto&v:vec)chmin(r,min(v,id));return r;}template<class T>pll mima(const T&a,const T&b){return {min(a,b),max(a,b)};}template<class T>T sum(vector<T>&a){return accumulate(all(a),T(0));}template<class T>T popcnt(T a){return __builtin_popcountll(a);}istream&operator>>(istream&is,modint1000000007&x){unsigned int t;is>>t;x=t;return is;}istream&operator>>(istream&is,modint998244353&x){unsigned int t;is>>t;x=t;return is;}istream&operator>>(istream&is,modint&x){unsigned int t;is>>t;x=t;return is;}ostream&operator<<(ostream&os,const modint1000000007&x){os<<x.val();return os;}ostream&operator<<(ostream&os,const modint998244353&x){os<<x.val();return os;}ostream&operator<<(ostream&os,const modint&x){os<<x.val();return os;}template<class T1,class T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}template<class T1,class T2>ostream&operator<<(ostream&os,const pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}template<class T>istream&operator>>(istream&is,vector<T>&v){for(T&x:v)is>>x;return is;}template<class T>ostream&operator<<(ostream&os,const vector<T>&v){for(int i=0;i<(int)v.size();i++){os<<v[i]<<(i+1==(int)v.size()?"":" ");}return os;}template<class...A>int pt_rest(){cout<<'\n';return 0;}template<class...A>int pt(){cout<<'\n';return 0;}template<class T,class...A>int pt_rest(const T&first,const A&...rest){cout<<" "<<first;pt_rest(rest...);return 0;}template<class T,class...A>int pt(const T&first,const A&...rest){cout<<first;pt_rest(rest...);return 0;}template<class V,class H>void resize(vector<V>&vec,const H head){vec.resize(head);}template<class V,class H,class...T>void resize(vector<V>&vec,const H&head,const T...tail){vec.resize(head);for(auto&v:vec)resize(v,tail...);}template<class V,class T>void fill(V&x,const T&val){x=val;}template<class V,class T>void fill(vector<V>&vec,const T&val){for(auto&v:vec)fill(v,val);}template<class H>void vin(istream&is,const int idx,vector<H>&head){is>>head[idx];}template<class H,class...T>void vin(istream&is,const int idx,vector<H>&head,T&...tail){vin(is>>head[idx],idx,tail...);}template<class H,class...T>void vin(istream&is,vector<H>&head,T&...tail){for(int i=0;i<(int)head.size();i++)vin(is,i,head,tail...);}template<class H,class...T>void vin(vector<H>&head,T&...tail){vin(cin,head,tail...);}template<class H>void sin(istream&is,H&head){is>>head;}template<class H,class...T>void sin(istream&is,H&head,T&...tail){sin(is>>head,tail...);}template<class H,class...T>void sin(H&head,T&...tail){sin(cin,head,tail...);}void divisor(ll n,mll&div){for(ll i=1;i*i<=n;i++)if(n%i==0){div[i]++;div[n/i]++;}}void factrization(ll n,mll&fact){for(ll i=2;i*i<=n;i++)while(n%i==0){fact[i]++;n/=i;}if(n>1)fact[n]++;}ll lsqrt(ll x){assert(x>=0);if(x<=1)return x;ll r=sqrt(x)-1;while((r+1)<=x/(r+1))r++;return r;};using S=ll;S op(S a,S b){return a+b;}S e(){return 0;}template<class T>struct Combination{vector<T>fa,rfa,bs;vector<vector<pair<bool,T>>>mp;ll LIM=5000;Combination(ll n){fa.resize(n+1);rfa.resize(n+1);fa[0]=rfa[0]=1;for(ll i=1;i<=n;i++)fa[i]=fa[i-1]*i;for(ll i=1;i<=n;i++)rfa[i]=rfa[i-1]/i;bs.resize(n+1);bs[0]=1;for(ll i=1;i<=n;i++)bs[i]=bs[i-1]+T(-1).pow(i&1)*rfa[i];if(n<=LIM)mp.resize(n+1,vector<pair<bool,T>>(n+1));}T C(ll n,ll k){return n<k||n<0||k<0?0:fa[n]*rfa[k]*rfa[n-k];}T P(ll n,ll k){return C(n,k)*fa[k];}T H(ll n,ll k){return C(n-1+k,k);}T S(ll n,ll k){T res=0;for(ll i=0;i<=k;i++)res+=T(-1).pow((k-i)&1)*C(k,i)*T(i).pow(n);res*=rfa[k];return res;}T B(ll n,ll k){T res=0;for(ll i=0;i<=k;i++)res+=T(i).pow(n)*rfa[i]*bs[k-i];return res;}T p(ll n,ll k){//自然数nをk個の"0"以上の整数に分割する方法if(n==0 and k==0)return 1;if(k==0)return 0;if(mp[n][k].first)return mp[n][k].second;if(n-k>=0)return (mp[n][k]={true,p(n,k-1)+p(n-k,k)}).second;return (mp[n][k]={true,p(n,k-1)}).second;}};int main(void){cin.tie(nullptr);ios::sync_with_stdio(false);ll N,A,B;sin(N,A,B);using mint=modint998244353;Combination<mint>com(N);mint ans=0;if(A<N-B+1){for(ll k=0;k<=min(A,B);k++)ans+=com.C(A,k)*com.P(B,k);ans*=com.fa[N]*com.rfa[A+B];}else{ll D=A+B-N;A-=D;B-=D;for(ll k=0;k<=min(A,B);k++)ans+=com.C(A,k)*com.P(B,k);}pt(ans);}