Submission #2038316


Source Code Expand

#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
ll mod = 998244353;
#define SIZE 1100000
ll inv[SIZE + 1];
ll kai[SIZE + 1];
ll invkai[SIZE + 1];
void invinit()
{
	inv[1] = 1;
	for (int i = 2; i <= SIZE; i++)
	{
		inv[i] = mod - (mod / i)*inv[mod%i] % mod;
	}
	kai[0] = invkai[0] = 1;
	for (int i = 1; i <= SIZE; i++)
	{
		kai[i] = kai[i - 1] * i%mod;
		invkai[i] = invkai[i - 1] * inv[i] % mod;
	}
}
ll com(ll a, ll b)
{
	if (b < 0 || a < b)return 0;
	return (invkai[b] * invkai[a - b]) % mod*kai[a] % mod;
}
int main()
{
	invinit();
	int x, y;
	scanf("%d%d", &x, &y);
	ll sum = 0;
	ll now = com(x + y, x);
	for (int i = 1; i <= x + y; i++)
	{
		//printf("%lld\n", now);
		sum += now;
		if (i & 1)
		{
			int a = i / 2, b = a + 1;
			ll t = com(a + b, a)*com(x + y - a - b - 1, y - b) % mod*b%mod*inv[a + b] % mod;
			ll s = com(b + b, b)*com(x + y - b - b, y - b) % mod*inv[2] % mod;
			now = (now + mod + s - t * 2 % mod) % mod;
		}
	}
	printf("%lld\n", sum % mod*kai[x] % mod*kai[y] % mod*invkai[x + y] % mod);
}

Submission Info

Submission Time
Task F - Yes or No
User DEGwer
Language C++ (GCC 5.4.1)
Score 2000
Code Size 1115 Byte
Status AC
Exec Time 157 ms
Memory 25984 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &x, &y);
                       ^

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 58 ms 25984 KB
sample_02.txt AC 59 ms 25984 KB
sample_03.txt AC 59 ms 25984 KB
sample_04.txt AC 59 ms 25984 KB
sample_05.txt AC 59 ms 25984 KB
subtask_1_01.txt AC 59 ms 25984 KB
subtask_1_02.txt AC 59 ms 25984 KB
subtask_1_03.txt AC 59 ms 25984 KB
subtask_1_04.txt AC 59 ms 25984 KB
subtask_1_05.txt AC 59 ms 25984 KB
subtask_1_06.txt AC 59 ms 25984 KB
subtask_1_07.txt AC 58 ms 25984 KB
subtask_1_08.txt AC 58 ms 25984 KB
subtask_1_09.txt AC 59 ms 25984 KB
subtask_1_10.txt AC 59 ms 25984 KB
subtask_1_11.txt AC 59 ms 25984 KB
subtask_1_12.txt AC 59 ms 25984 KB
subtask_1_13.txt AC 61 ms 25984 KB
subtask_1_14.txt AC 64 ms 25984 KB
subtask_1_15.txt AC 78 ms 25984 KB
subtask_1_16.txt AC 78 ms 25984 KB
subtask_1_17.txt AC 78 ms 25984 KB
subtask_1_18.txt AC 78 ms 25984 KB
subtask_1_19.txt AC 80 ms 25984 KB
subtask_1_20.txt AC 78 ms 25984 KB
subtask_1_21.txt AC 81 ms 25984 KB
subtask_1_22.txt AC 78 ms 25984 KB
subtask_1_23.txt AC 78 ms 25984 KB
subtask_1_24.txt AC 76 ms 25984 KB
subtask_1_25.txt AC 76 ms 25984 KB
subtask_2_01.txt AC 59 ms 25984 KB
subtask_2_02.txt AC 59 ms 25984 KB
subtask_2_03.txt AC 58 ms 25984 KB
subtask_2_04.txt AC 156 ms 25984 KB
subtask_2_05.txt AC 156 ms 25984 KB
subtask_2_06.txt AC 156 ms 25984 KB
subtask_2_07.txt AC 156 ms 25984 KB
subtask_2_08.txt AC 156 ms 25984 KB
subtask_2_09.txt AC 156 ms 25984 KB
subtask_2_10.txt AC 156 ms 25984 KB
subtask_2_11.txt AC 156 ms 25984 KB
subtask_2_12.txt AC 156 ms 25984 KB
subtask_2_13.txt AC 156 ms 25984 KB
subtask_2_14.txt AC 157 ms 25984 KB
subtask_2_15.txt AC 156 ms 25984 KB
subtask_2_16.txt AC 157 ms 25984 KB
subtask_2_17.txt AC 156 ms 25984 KB
subtask_2_18.txt AC 149 ms 25984 KB
subtask_2_19.txt AC 136 ms 25984 KB
subtask_2_20.txt AC 82 ms 25984 KB
subtask_2_21.txt AC 83 ms 25984 KB
subtask_2_22.txt AC 82 ms 25984 KB
subtask_2_23.txt AC 82 ms 25984 KB
subtask_2_24.txt AC 82 ms 25984 KB
subtask_2_25.txt AC 82 ms 25984 KB
subtask_2_26.txt AC 82 ms 25984 KB
subtask_2_27.txt AC 82 ms 25984 KB
subtask_2_28.txt AC 83 ms 25984 KB
subtask_2_29.txt AC 88 ms 25984 KB
subtask_2_30.txt AC 97 ms 25984 KB
subtask_2_31.txt AC 112 ms 25984 KB
subtask_2_32.txt AC 156 ms 25984 KB
subtask_2_33.txt AC 156 ms 25984 KB
subtask_2_34.txt AC 156 ms 25984 KB
subtask_2_35.txt AC 155 ms 25984 KB
subtask_2_36.txt AC 154 ms 25984 KB
subtask_2_37.txt AC 102 ms 25984 KB
subtask_2_38.txt AC 83 ms 25984 KB
subtask_2_39.txt AC 151 ms 25984 KB
subtask_2_40.txt AC 95 ms 25984 KB