Submission #4567454


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2000010,ha=998244353;
int n,m,inv[N],fac[N],invfac[N];
int qpow(int a,int b)
{
    int re=1;
    while(b)
    {
        if(b&1)re=re*a%ha;
        a=a*a%ha,b>>=1;
    }
    return re;
}

int C(int x,int y)
{
    return fac[x]*invfac[y]%ha*invfac[x-y]%ha;
}
signed main()
{
    invfac[0]=fac[0]=1;
    for(int i=1;i<=2000000;i++)inv[i]=qpow(i,ha-2),fac[i]=fac[i-1]*i%ha,invfac[i]=invfac[i-1]*inv[i]%ha;
    scanf("%lld%lld",&n,&m);
    if(n>m)swap(n,m);
    int ans=n*C(n+m,n)%ha;
    for(int i=1;i<=n;i++)
        ans=(ans-C(i+i-1,i)*C(m-i+n-i,m-i)%ha+ha)%ha;
    printf("%lld",(n+m-ans*qpow(C(m+n,m),ha-2)%ha+ha)%ha);
    return 0;
}

Submission Info

Submission Time
Task F - Yes or No
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 2000
Code Size 715 Byte
Status AC
Exec Time 320 ms
Memory 47104 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld",&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 313 ms 47104 KB
sample_02.txt AC 313 ms 47104 KB
sample_03.txt AC 313 ms 47104 KB
sample_04.txt AC 313 ms 47104 KB
sample_05.txt AC 313 ms 47104 KB
subtask_1_01.txt AC 313 ms 47104 KB
subtask_1_02.txt AC 313 ms 47104 KB
subtask_1_03.txt AC 313 ms 47104 KB
subtask_1_04.txt AC 313 ms 47104 KB
subtask_1_05.txt AC 313 ms 47104 KB
subtask_1_06.txt AC 313 ms 47104 KB
subtask_1_07.txt AC 313 ms 47104 KB
subtask_1_08.txt AC 313 ms 47104 KB
subtask_1_09.txt AC 313 ms 47104 KB
subtask_1_10.txt AC 313 ms 47104 KB
subtask_1_11.txt AC 313 ms 47104 KB
subtask_1_12.txt AC 313 ms 47104 KB
subtask_1_13.txt AC 315 ms 47104 KB
subtask_1_14.txt AC 314 ms 47104 KB
subtask_1_15.txt AC 314 ms 47104 KB
subtask_1_16.txt AC 314 ms 47104 KB
subtask_1_17.txt AC 314 ms 47104 KB
subtask_1_18.txt AC 314 ms 47104 KB
subtask_1_19.txt AC 314 ms 47104 KB
subtask_1_20.txt AC 314 ms 47104 KB
subtask_1_21.txt AC 314 ms 47104 KB
subtask_1_22.txt AC 314 ms 47104 KB
subtask_1_23.txt AC 314 ms 47104 KB
subtask_1_24.txt AC 314 ms 47104 KB
subtask_1_25.txt AC 314 ms 47104 KB
subtask_2_01.txt AC 313 ms 47104 KB
subtask_2_02.txt AC 313 ms 47104 KB
subtask_2_03.txt AC 313 ms 47104 KB
subtask_2_04.txt AC 317 ms 47104 KB
subtask_2_05.txt AC 318 ms 47104 KB
subtask_2_06.txt AC 318 ms 47104 KB
subtask_2_07.txt AC 317 ms 47104 KB
subtask_2_08.txt AC 318 ms 47104 KB
subtask_2_09.txt AC 317 ms 47104 KB
subtask_2_10.txt AC 318 ms 47104 KB
subtask_2_11.txt AC 318 ms 47104 KB
subtask_2_12.txt AC 320 ms 47104 KB
subtask_2_13.txt AC 317 ms 47104 KB
subtask_2_14.txt AC 318 ms 47104 KB
subtask_2_15.txt AC 318 ms 47104 KB
subtask_2_16.txt AC 318 ms 47104 KB
subtask_2_17.txt AC 318 ms 47104 KB
subtask_2_18.txt AC 317 ms 47104 KB
subtask_2_19.txt AC 317 ms 47104 KB
subtask_2_20.txt AC 313 ms 47104 KB
subtask_2_21.txt AC 313 ms 47104 KB
subtask_2_22.txt AC 313 ms 47104 KB
subtask_2_23.txt AC 313 ms 47104 KB
subtask_2_24.txt AC 313 ms 47104 KB
subtask_2_25.txt AC 313 ms 47104 KB
subtask_2_26.txt AC 313 ms 47104 KB
subtask_2_27.txt AC 313 ms 47104 KB
subtask_2_28.txt AC 313 ms 47104 KB
subtask_2_29.txt AC 313 ms 47104 KB
subtask_2_30.txt AC 314 ms 47104 KB
subtask_2_31.txt AC 315 ms 47104 KB
subtask_2_32.txt AC 318 ms 47104 KB
subtask_2_33.txt AC 318 ms 47104 KB
subtask_2_34.txt AC 318 ms 47104 KB
subtask_2_35.txt AC 318 ms 47104 KB
subtask_2_36.txt AC 317 ms 47104 KB
subtask_2_37.txt AC 315 ms 47104 KB
subtask_2_38.txt AC 314 ms 47104 KB
subtask_2_39.txt AC 317 ms 47104 KB
subtask_2_40.txt AC 314 ms 47104 KB