Submission #2012173


Source Code Expand

#include<bits/stdc++.h>
#define L long long
#define vi vector<int>
#define pb push_back
#define pi pair<int,int>
#define pii pair<pi,int>
#define aa first
#define bb second
#define xx aa.aa
#define yy aa.bb
#define zz bb
#define mp make_pair
#define mpp(a,b,c) mp(mp(a,b),c)
using namespace std;
const int q=998244353;
int n,m,a[1000010],b[1000010],p;
inline int C(int n,int m)
{
	return (L)a[n]*b[m]%q*b[n-m]%q;
}
inline int C2(int n,int m)
{
	return (L)b[n]*a[m]%q*a[n-m]%q;
}
int main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int i;
	scanf("%d%d",&n,&m);
	if(n<m)
	  swap(n,m);
	a[0]=1;
	for(i=1;i<=n+m;i++)
	  a[i]=(L)a[i-1]*i%q;
	b[0]=b[1]=1;
	for(i=2;i<=n+m;i++)
	  b[i]=q-(L)q/i*b[q%i]%q;
	for(i=2;i<=n+m;i++)
	  b[i]=(L)b[i]*b[i-1]%q;
	p=n;
	for(i=1;i<=m;i++)
	  p=(p+(L)b[2]*C(2*i,i)%q*C(n-i+m-i,n-i)%q*C2(n+m,n))%q;
	printf("%d\n",p);
	return 0;
}

Submission Info

Submission Time
Task F - Yes or No
User fateice
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 928 Byte
Status AC
Exec Time 36 ms
Memory 8064 KiB

Compile Error

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

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 2 ms 2304 KiB
sample_02.txt AC 2 ms 2304 KiB
sample_03.txt AC 1 ms 2304 KiB
sample_04.txt AC 2 ms 2304 KiB
sample_05.txt AC 2 ms 2304 KiB
subtask_1_01.txt AC 2 ms 2304 KiB
subtask_1_02.txt AC 2 ms 2304 KiB
subtask_1_03.txt AC 2 ms 2304 KiB
subtask_1_04.txt AC 2 ms 2304 KiB
subtask_1_05.txt AC 2 ms 2304 KiB
subtask_1_06.txt AC 2 ms 2304 KiB
subtask_1_07.txt AC 2 ms 2304 KiB
subtask_1_08.txt AC 2 ms 2304 KiB
subtask_1_09.txt AC 2 ms 2304 KiB
subtask_1_10.txt AC 2 ms 2304 KiB
subtask_1_11.txt AC 2 ms 2304 KiB
subtask_1_12.txt AC 2 ms 2304 KiB
subtask_1_13.txt AC 2 ms 2432 KiB
subtask_1_14.txt AC 4 ms 4608 KiB
subtask_1_15.txt AC 9 ms 5120 KiB
subtask_1_16.txt AC 9 ms 5120 KiB
subtask_1_17.txt AC 9 ms 5120 KiB
subtask_1_18.txt AC 9 ms 5120 KiB
subtask_1_19.txt AC 9 ms 5120 KiB
subtask_1_20.txt AC 9 ms 5120 KiB
subtask_1_21.txt AC 9 ms 5120 KiB
subtask_1_22.txt AC 9 ms 5120 KiB
subtask_1_23.txt AC 9 ms 5120 KiB
subtask_1_24.txt AC 8 ms 4992 KiB
subtask_1_25.txt AC 8 ms 4992 KiB
subtask_2_01.txt AC 2 ms 2304 KiB
subtask_2_02.txt AC 2 ms 2304 KiB
subtask_2_03.txt AC 2 ms 2304 KiB
subtask_2_04.txt AC 36 ms 8064 KiB
subtask_2_05.txt AC 36 ms 8064 KiB
subtask_2_06.txt AC 36 ms 8064 KiB
subtask_2_07.txt AC 36 ms 8064 KiB
subtask_2_08.txt AC 36 ms 8064 KiB
subtask_2_09.txt AC 36 ms 8064 KiB
subtask_2_10.txt AC 36 ms 8064 KiB
subtask_2_11.txt AC 36 ms 8064 KiB
subtask_2_12.txt AC 36 ms 8064 KiB
subtask_2_13.txt AC 36 ms 8064 KiB
subtask_2_14.txt AC 36 ms 8064 KiB
subtask_2_15.txt AC 36 ms 8064 KiB
subtask_2_16.txt AC 36 ms 8064 KiB
subtask_2_17.txt AC 36 ms 8064 KiB
subtask_2_18.txt AC 33 ms 7680 KiB
subtask_2_19.txt AC 28 ms 7168 KiB
subtask_2_20.txt AC 16 ms 6272 KiB
subtask_2_21.txt AC 16 ms 6272 KiB
subtask_2_22.txt AC 16 ms 6272 KiB
subtask_2_23.txt AC 16 ms 6272 KiB
subtask_2_24.txt AC 16 ms 6272 KiB
subtask_2_25.txt AC 16 ms 6272 KiB
subtask_2_26.txt AC 16 ms 6272 KiB
subtask_2_27.txt AC 16 ms 6272 KiB
subtask_2_28.txt AC 16 ms 6272 KiB
subtask_2_29.txt AC 17 ms 6400 KiB
subtask_2_30.txt AC 20 ms 6528 KiB
subtask_2_31.txt AC 24 ms 6912 KiB
subtask_2_32.txt AC 36 ms 8064 KiB
subtask_2_33.txt AC 36 ms 8064 KiB
subtask_2_34.txt AC 36 ms 8064 KiB
subtask_2_35.txt AC 36 ms 8064 KiB
subtask_2_36.txt AC 35 ms 8064 KiB
subtask_2_37.txt AC 18 ms 6272 KiB
subtask_2_38.txt AC 14 ms 5888 KiB
subtask_2_39.txt AC 34 ms 7936 KiB
subtask_2_40.txt AC 19 ms 6400 KiB