#766498 (C++17) No.1960 Guruguru Permutation

• 問題: No.1960 Guruguru Permutation
• ユーザー: 👑 potato167
• 提出日時: 2022-05-27 22:19:35
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,412 bytes
• コンパイル時間: 2,331 ms
• コンパイル使用メモリ: 207,448 KB
• 実行使用メモリ: 7,936 KB
• 最終ジャッジ日時: 2024-09-20 16:03:40
• 合計ジャッジ時間: 3,388 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	AC	9 ms; 7,808 KB
testcase_08	AC	7 ms; 6,940 KB
testcase_09	AC	10 ms; 7,680 KB
testcase_10	AC	6 ms; 6,944 KB
testcase_11	WA	-
testcase_12	WA	-
testcase_13	AC	8 ms; 6,944 KB
testcase_14	AC	2 ms; 6,944 KB
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	10 ms; 7,808 KB
testcase_19	AC	9 ms; 7,808 KB
testcase_20	AC	10 ms; 7,936 KB
testcase_21	AC	2 ms; 6,944 KB
testcase_22	AC	10 ms; 7,936 KB
testcase_23	AC	9 ms; 7,936 KB
testcase_24	AC	9 ms; 7,936 KB

ソースコード

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;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){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<endl;}


namespace po167{
struct combination{
	int upper;
	long long 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;
	}
};
}
using po167::combination;



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll N,M,K,J=0;
	cin>>N>>M>>K;
	chmax(M,1ll),chmax(K,1ll);
	if(M+K>N){
		J=1;
		ll d=M=K-N;
		M-=d,K-=d;
	}
	ll base=0;
	combination table(N,mod);
	rep(i,K+1){
		ll tmp=(table.Comb(K,i)*table.fact[i])%mod;
		base=(base+(table.Comb(M,i)*tmp)%mod)%mod;
	}
	if(J){
		cout<<base<<"\n";
		return ;
	}
	ll ans=0;
	rep(i,N-M-K+1){
		ll tmp=(table.fact[N-M-K])%mod;
		//cout<<tmp<<" ";
		tmp=(tmp*table.Comb(i+M+K-1,i))%mod;
		//cout<<tmp<<"\n";
		ans=(ans+tmp)%mod;
	}
	cout<<(ans*base)%mod<<"\n";
}