Submission #1793781
Source Code Expand
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #define N 10010 #define ll long long #define P 998244353 using namespace std; int n,m; ll q[N],ni[N],nq[N]; int f[N][N]; char a[N],b[N]; ll C(int n,int m) { return q[n]*nq[m]%P*nq[n-m]%P; } int main() { q[0]=ni[1]=nq[0]=1; for(int i=1;i<N;i++) q[i]=q[i-1]*i%P; for(int i=2;i<N;i++) ni[i]=(P-P/i)*ni[P%i]%P; for(int i=1;i<N;i++) nq[i]=nq[i-1]*ni[i]%P; scanf("%s%s",a,b); for(int i=0;a[i];i++) if(a[i]=='1') { if(b[i]=='1') n++; else m++; } f[0][0]=1; for(int i=0;i<=n;i++) for(int j=0;j<=m;j++) if(i||j) { ll o=0; if(j) o+=(ll)j*j*f[i][j-1]; if(i) o+=(ll)i*j*f[i-1][j]; f[i][j]=o%P; } ll ans=0; for(int i=0;i<=n;i++) ans+=f[i][m]*C(n,i)%P*C(n+m,i+m)%P*q[n-i]%P*q[n-i]%P; ans%=P; cout<<ans; }
Submission Info
Submission Time | |
---|---|
Task | A - Ice Tea Store |
User | ljss |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 839 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:23:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s%s",a,b); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | WA | 1 ms | 512 KB |
sample_02.txt | WA | 1 ms | 512 KB |
sample_03.txt | WA | 1 ms | 512 KB |
sample_04.txt | WA | 1 ms | 512 KB |
subtask_1_01.txt | AC | 1 ms | 512 KB |
subtask_1_02.txt | WA | 1 ms | 512 KB |
subtask_1_03.txt | WA | 1 ms | 512 KB |
subtask_1_04.txt | WA | 1 ms | 512 KB |
subtask_1_05.txt | WA | 1 ms | 512 KB |
subtask_1_06.txt | WA | 1 ms | 512 KB |
subtask_1_07.txt | WA | 1 ms | 512 KB |
subtask_1_08.txt | WA | 1 ms | 512 KB |
subtask_1_09.txt | WA | 1 ms | 512 KB |
subtask_1_10.txt | WA | 1 ms | 512 KB |
subtask_1_11.txt | WA | 1 ms | 512 KB |
subtask_1_12.txt | WA | 1 ms | 512 KB |
subtask_1_13.txt | WA | 1 ms | 512 KB |
subtask_1_14.txt | WA | 1 ms | 512 KB |
subtask_1_15.txt | WA | 1 ms | 512 KB |