Submission #1540833


Source Code Expand

#include <bits/stdc++.h>
#define MOD 998244353
#define MAXT 1100000
using namespace std;
typedef long long LL;
LL powmod(LL a, LL n){
	if(n == 0) return 1;
	if(n % 2) return (a * powmod(a,n-1)) % MOD;
	return powmod((a*a) % MOD,n/2);
}

LL inv(LL a){
	return powmod(a,MOD-2);
}

LL fact[MAXT];
LL invfact[MAXT];
int main(){
	for(int i = 0; i < MAXT; i++){
		if(i == 0){
			fact[i] = 1;
			continue;
		}
		fact[i] = (i*fact[i-1]) % MOD;
	}
	invfact[MAXT-1] = inv(fact[MAXT-1]);
	for(LL j = MAXT-2; j >= 0; j--){
		invfact[j] = ((j+1) * invfact[j+1]) % MOD;
	}

	LL n, m;
	cin >> n >> m;
	if(n < m) swap(n,m);
	LL ans = n;
	LL sum = 0;
	LL cur = 0;
	for(LL i = 2; i <= n + m; i += 2){
		LL k = i/2;
		if(n < k || m < k) continue;
		LL v = 1;
		v = (v * fact[2*k]) % MOD;
		v = (v * invfact[k]) % MOD;
		v = (v * invfact[k]) % MOD;
		v = (v * fact[m+n-2*k]) % MOD;
		v = (v * invfact[n-k]) % MOD;
		v = (v * invfact[m-k]) % MOD;
		sum += v;
		sum %= MOD;
	}
	sum = (sum * invfact[2]) % MOD;
	sum = (sum * invfact[m+n]) % MOD;
	sum = (sum * fact[m]) % MOD;
	sum = (sum * fact[n]) % MOD;
	ans += sum;
	ans %= MOD;
	while(ans < 0) ans += MOD;
	cout << ans << endl;
}

Submission Info

Submission Time
Task F - Yes or No
User ksun48
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 1219 Byte
Status AC
Exec Time 26 ms
Memory 17408 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 18 ms 17408 KB
sample_02.txt AC 18 ms 17408 KB
sample_03.txt AC 18 ms 17408 KB
sample_04.txt AC 18 ms 17408 KB
sample_05.txt AC 18 ms 17408 KB
subtask_1_01.txt AC 18 ms 17408 KB
subtask_1_02.txt AC 18 ms 17408 KB
subtask_1_03.txt AC 18 ms 17408 KB
subtask_1_04.txt AC 18 ms 17408 KB
subtask_1_05.txt AC 18 ms 17408 KB
subtask_1_06.txt AC 18 ms 17408 KB
subtask_1_07.txt AC 18 ms 17408 KB
subtask_1_08.txt AC 18 ms 17408 KB
subtask_1_09.txt AC 18 ms 17408 KB
subtask_1_10.txt AC 18 ms 17408 KB
subtask_1_11.txt AC 18 ms 17408 KB
subtask_1_12.txt AC 18 ms 17408 KB
subtask_1_13.txt AC 18 ms 17408 KB
subtask_1_14.txt AC 19 ms 17408 KB
subtask_1_15.txt AC 20 ms 17408 KB
subtask_1_16.txt AC 20 ms 17408 KB
subtask_1_17.txt AC 20 ms 17408 KB
subtask_1_18.txt AC 20 ms 17408 KB
subtask_1_19.txt AC 20 ms 17408 KB
subtask_1_20.txt AC 20 ms 17408 KB
subtask_1_21.txt AC 20 ms 17408 KB
subtask_1_22.txt AC 20 ms 17408 KB
subtask_1_23.txt AC 20 ms 17408 KB
subtask_1_24.txt AC 20 ms 17408 KB
subtask_1_25.txt AC 19 ms 17408 KB
subtask_2_01.txt AC 18 ms 17408 KB
subtask_2_02.txt AC 18 ms 17408 KB
subtask_2_03.txt AC 18 ms 17408 KB
subtask_2_04.txt AC 26 ms 17408 KB
subtask_2_05.txt AC 26 ms 17408 KB
subtask_2_06.txt AC 26 ms 17408 KB
subtask_2_07.txt AC 26 ms 17408 KB
subtask_2_08.txt AC 26 ms 17408 KB
subtask_2_09.txt AC 26 ms 17408 KB
subtask_2_10.txt AC 26 ms 17408 KB
subtask_2_11.txt AC 26 ms 17408 KB
subtask_2_12.txt AC 26 ms 17408 KB
subtask_2_13.txt AC 26 ms 17408 KB
subtask_2_14.txt AC 26 ms 17408 KB
subtask_2_15.txt AC 26 ms 17408 KB
subtask_2_16.txt AC 26 ms 17408 KB
subtask_2_17.txt AC 26 ms 17408 KB
subtask_2_18.txt AC 25 ms 17408 KB
subtask_2_19.txt AC 24 ms 17408 KB
subtask_2_20.txt AC 18 ms 17408 KB
subtask_2_21.txt AC 18 ms 17408 KB
subtask_2_22.txt AC 18 ms 17408 KB
subtask_2_23.txt AC 18 ms 17408 KB
subtask_2_24.txt AC 18 ms 17408 KB
subtask_2_25.txt AC 18 ms 17408 KB
subtask_2_26.txt AC 18 ms 17408 KB
subtask_2_27.txt AC 18 ms 17408 KB
subtask_2_28.txt AC 18 ms 17408 KB
subtask_2_29.txt AC 19 ms 17408 KB
subtask_2_30.txt AC 20 ms 17408 KB
subtask_2_31.txt AC 21 ms 17408 KB
subtask_2_32.txt AC 26 ms 17408 KB
subtask_2_33.txt AC 26 ms 17408 KB
subtask_2_34.txt AC 26 ms 17408 KB
subtask_2_35.txt AC 26 ms 17408 KB
subtask_2_36.txt AC 26 ms 17408 KB
subtask_2_37.txt AC 21 ms 17408 KB
subtask_2_38.txt AC 19 ms 17408 KB
subtask_2_39.txt AC 26 ms 17408 KB
subtask_2_40.txt AC 20 ms 17408 KB