Submission #1545902


Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}

template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll v):v(normS(v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll u[]={a,1,0},v[]={b,0,1};
		while(*v){
			ll t=*u/ *v;
			rep(i,3) swap(u[i]-=t*v[i],v[i]);
		}
		if(u[0]<0) rep(i,3) u[i]=-u[i];
		x=u[1],y=u[2];
		return u[0];
	}
	ModInt inv() const{
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<998244353>;

const int MX = 2000010;
mint f[MX+1],g[MX+1];
mint C(int x,int y){
	return f[x]*g[y]*g[x-y];
}
void precalc(){
	f[0] = 1;
	rep1(i,MX) f[i] = f[i-1]*i;
	g[0] = 1;
	rep1(i,MX) g[i] = g[i-1]/i;
}

int main(){
	precalc();
	int A,B;
	cin>>A>>B;
	if(A>B) swap(A,B);
	mint ans = mint(A+B)*C(A+B-1,A-1);
	rep1(i,A){
		mint tmp = C(2*i,i) * C(A+B-2*i,A-i) / 2;
		ans += tmp;
	}
	ans /= C(A+B,A);
	ans += B-A;
	cout<<ans<<endl;
}

Submission Info

Submission Time
Task F - Yes or No
User sigma425
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 2748 Byte
Status AC
Exec Time 506 ms
Memory 16000 KB

Judge Result

Set Name Sample Partial All
Score / Max Score 0 / 0 1500 / 1500 500 / 500
Status
AC × 5
AC × 28
AC × 75
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt
Partial sample_01.txt, sample_02.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_2_01.txt, subtask_2_02.txt, subtask_2_03.txt, subtask_2_04.txt, subtask_2_05.txt, subtask_2_06.txt, subtask_2_07.txt, subtask_2_08.txt, subtask_2_09.txt, subtask_2_10.txt, subtask_2_11.txt, subtask_2_12.txt, subtask_2_13.txt, subtask_2_14.txt, subtask_2_15.txt, subtask_2_16.txt, subtask_2_17.txt, subtask_2_18.txt, subtask_2_19.txt, subtask_2_20.txt, subtask_2_21.txt, subtask_2_22.txt, subtask_2_23.txt, subtask_2_24.txt, subtask_2_25.txt, subtask_2_26.txt, subtask_2_27.txt, subtask_2_28.txt, subtask_2_29.txt, subtask_2_30.txt, subtask_2_31.txt, subtask_2_32.txt, subtask_2_33.txt, subtask_2_34.txt, subtask_2_35.txt, subtask_2_36.txt, subtask_2_37.txt, subtask_2_38.txt, subtask_2_39.txt, subtask_2_40.txt
Case Name Status Exec Time Memory
sample_01.txt AC 479 ms 15872 KB
sample_02.txt AC 480 ms 15872 KB
sample_03.txt AC 480 ms 15872 KB
sample_04.txt AC 480 ms 15872 KB
sample_05.txt AC 480 ms 15872 KB
subtask_1_01.txt AC 483 ms 15872 KB
subtask_1_02.txt AC 480 ms 15872 KB
subtask_1_03.txt AC 480 ms 15872 KB
subtask_1_04.txt AC 479 ms 15872 KB
subtask_1_05.txt AC 480 ms 15872 KB
subtask_1_06.txt AC 480 ms 15872 KB
subtask_1_07.txt AC 480 ms 15872 KB
subtask_1_08.txt AC 480 ms 15872 KB
subtask_1_09.txt AC 480 ms 15872 KB
subtask_1_10.txt AC 480 ms 15872 KB
subtask_1_11.txt AC 480 ms 15872 KB
subtask_1_12.txt AC 480 ms 15872 KB
subtask_1_13.txt AC 480 ms 15872 KB
subtask_1_14.txt AC 481 ms 15872 KB
subtask_1_15.txt AC 485 ms 15872 KB
subtask_1_16.txt AC 485 ms 15872 KB
subtask_1_17.txt AC 485 ms 15872 KB
subtask_1_18.txt AC 484 ms 15872 KB
subtask_1_19.txt AC 485 ms 15872 KB
subtask_1_20.txt AC 485 ms 15872 KB
subtask_1_21.txt AC 485 ms 15872 KB
subtask_1_22.txt AC 486 ms 15872 KB
subtask_1_23.txt AC 485 ms 15872 KB
subtask_1_24.txt AC 484 ms 15872 KB
subtask_1_25.txt AC 484 ms 15872 KB
subtask_2_01.txt AC 480 ms 15872 KB
subtask_2_02.txt AC 479 ms 15872 KB
subtask_2_03.txt AC 480 ms 15872 KB
subtask_2_04.txt AC 506 ms 15872 KB
subtask_2_05.txt AC 506 ms 15872 KB
subtask_2_06.txt AC 506 ms 15872 KB
subtask_2_07.txt AC 506 ms 15872 KB
subtask_2_08.txt AC 506 ms 15872 KB
subtask_2_09.txt AC 506 ms 16000 KB
subtask_2_10.txt AC 506 ms 15872 KB
subtask_2_11.txt AC 506 ms 15872 KB
subtask_2_12.txt AC 506 ms 15872 KB
subtask_2_13.txt AC 506 ms 15872 KB
subtask_2_14.txt AC 506 ms 15872 KB
subtask_2_15.txt AC 506 ms 15872 KB
subtask_2_16.txt AC 506 ms 15872 KB
subtask_2_17.txt AC 506 ms 15872 KB
subtask_2_18.txt AC 503 ms 15872 KB
subtask_2_19.txt AC 500 ms 15872 KB
subtask_2_20.txt AC 480 ms 15872 KB
subtask_2_21.txt AC 480 ms 15872 KB
subtask_2_22.txt AC 480 ms 15872 KB
subtask_2_23.txt AC 480 ms 15872 KB
subtask_2_24.txt AC 480 ms 15872 KB
subtask_2_25.txt AC 480 ms 15872 KB
subtask_2_26.txt AC 480 ms 15872 KB
subtask_2_27.txt AC 480 ms 15872 KB
subtask_2_28.txt AC 480 ms 15872 KB
subtask_2_29.txt AC 481 ms 15872 KB
subtask_2_30.txt AC 485 ms 15872 KB
subtask_2_31.txt AC 490 ms 15872 KB
subtask_2_32.txt AC 506 ms 15872 KB
subtask_2_33.txt AC 506 ms 15872 KB
subtask_2_34.txt AC 506 ms 15872 KB
subtask_2_35.txt AC 506 ms 15872 KB
subtask_2_36.txt AC 505 ms 15872 KB
subtask_2_37.txt AC 490 ms 15872 KB
subtask_2_38.txt AC 483 ms 15872 KB
subtask_2_39.txt AC 504 ms 15872 KB
subtask_2_40.txt AC 485 ms 15872 KB