Submission #1566382
Source Code Expand
#include <cstdio> #include <cstring> #include <cstdlib> #include <cmath> #include <ctime> #include <cassert> #include <string> #include <algorithm> #include <vector> #include <queue> #include <stack> #include <functional> #include <iostream> #include <map> #include <set> #include <cassert> #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> P; typedef pair<int,P> P1; typedef pair<P,P> P2; #define pu push #define pb push_back #define mp make_pair #define eps 1e-7 #define INF 1000000000 #define mod 998244353 #define fi first #define sc second #define rep(i,x) for(int i=0;i<x;i++) #define repn(i,x) for(int i=1;i<=x;i++) #define SORT(x) sort(x.begin(),x.end()) #define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end()) #define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) #define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) string s,t; int A,B; ll modpow(ll x,ll n) { ll res=1; while(n>0) { if(n&1) res=res*x%mod; x=x*x%mod; n>>=1; } return res; } ll F[50005],R[50005]; void make(){ F[0] = 1; for(int i=1;i<50005;i++) F[i] = F[i-1]*i%mod; for(int i=0;i<50005;i++) R[i] = modpow(F[i],mod-2); } ll C(int a,int b){return F[a]*R[b]%mod*R[a-b]%mod;} int main(){ cin>>s>>t;make(); rep(i,s.size()){ if(s[i]==t[i]&&s[i]=='1') A++; else if(s[i]=='1') B++; } ll ans = 0; for(int i=0;i<=A;i++){ ll ret = F[i]*F[A-i]%mod*F[A-i]%mod; ll add = 0; //B個,sum=i int sum = i+B; for(int i=0;i<=B;i++){ ll x = C(B,i); x = x*modpow(B-i,sum)%mod; if(i%2==0) add=(add+x)%mod; else add=(add+mod-x)%mod; } ans += ret*add%mod*F[B]%mod*C(A+B,i+B)%mod*C(A,i)%mod; } cout<<ans%mod<<endl; }
Submission Info
Submission Time | |
---|---|
Task | E - Shuffle and Swap |
User | IH19980412 |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 1754 Byte |
Status | AC |
Exec Time | 803 ms |
Memory | 1152 KB |
Judge Result
Set Name | Sample | Partial | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1200 / 1200 | 500 / 500 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
Partial | 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, 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_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.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, 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_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 9 ms | 1024 KB |
sample_02.txt | AC | 9 ms | 1024 KB |
sample_03.txt | AC | 9 ms | 1024 KB |
sample_04.txt | AC | 9 ms | 1024 KB |
subtask_1_01.txt | AC | 9 ms | 1024 KB |
subtask_1_02.txt | AC | 9 ms | 1024 KB |
subtask_1_03.txt | AC | 9 ms | 1024 KB |
subtask_1_04.txt | AC | 10 ms | 1024 KB |
subtask_1_05.txt | AC | 9 ms | 1024 KB |
subtask_1_06.txt | AC | 9 ms | 1024 KB |
subtask_1_07.txt | AC | 9 ms | 1024 KB |
subtask_1_08.txt | AC | 9 ms | 1024 KB |
subtask_1_09.txt | AC | 9 ms | 1024 KB |
subtask_1_10.txt | AC | 9 ms | 1024 KB |
subtask_1_11.txt | AC | 9 ms | 1024 KB |
subtask_1_12.txt | AC | 9 ms | 1024 KB |
subtask_1_13.txt | AC | 10 ms | 1024 KB |
subtask_1_14.txt | AC | 9 ms | 1024 KB |
subtask_1_15.txt | AC | 9 ms | 1024 KB |
subtask_1_16.txt | AC | 9 ms | 1024 KB |
subtask_1_17.txt | AC | 10 ms | 1024 KB |
subtask_1_18.txt | AC | 10 ms | 1024 KB |
subtask_1_19.txt | AC | 11 ms | 1024 KB |
subtask_1_20.txt | AC | 11 ms | 1024 KB |
subtask_1_21.txt | AC | 11 ms | 1024 KB |
subtask_1_22.txt | AC | 11 ms | 1024 KB |
subtask_1_23.txt | AC | 11 ms | 1024 KB |
subtask_1_24.txt | AC | 9 ms | 1024 KB |
subtask_1_25.txt | AC | 9 ms | 1024 KB |
subtask_1_26.txt | AC | 9 ms | 1024 KB |
subtask_1_27.txt | AC | 11 ms | 1024 KB |
subtask_1_28.txt | AC | 11 ms | 1024 KB |
subtask_1_29.txt | AC | 11 ms | 1024 KB |
subtask_1_30.txt | AC | 11 ms | 1024 KB |
subtask_1_31.txt | AC | 11 ms | 1024 KB |
subtask_1_32.txt | AC | 11 ms | 1024 KB |
subtask_1_33.txt | AC | 9 ms | 1024 KB |
subtask_1_34.txt | AC | 10 ms | 1024 KB |
subtask_1_35.txt | AC | 11 ms | 1024 KB |
subtask_1_36.txt | AC | 11 ms | 1024 KB |
subtask_1_37.txt | AC | 11 ms | 1024 KB |
subtask_1_38.txt | AC | 11 ms | 1024 KB |
subtask_1_39.txt | AC | 10 ms | 1024 KB |
subtask_1_40.txt | AC | 10 ms | 1024 KB |
subtask_1_41.txt | AC | 10 ms | 1024 KB |
subtask_1_42.txt | AC | 10 ms | 1024 KB |
subtask_2_01.txt | AC | 10 ms | 1024 KB |
subtask_2_02.txt | AC | 10 ms | 1024 KB |
subtask_2_03.txt | AC | 18 ms | 1024 KB |
subtask_2_04.txt | AC | 590 ms | 1024 KB |
subtask_2_05.txt | AC | 530 ms | 1024 KB |
subtask_2_06.txt | AC | 11 ms | 1024 KB |
subtask_2_07.txt | AC | 12 ms | 1024 KB |
subtask_2_08.txt | AC | 12 ms | 1024 KB |
subtask_2_09.txt | AC | 37 ms | 1024 KB |
subtask_2_10.txt | AC | 712 ms | 1024 KB |
subtask_2_11.txt | AC | 709 ms | 1024 KB |
subtask_2_12.txt | AC | 714 ms | 1024 KB |
subtask_2_13.txt | AC | 803 ms | 1024 KB |
subtask_2_14.txt | AC | 803 ms | 1024 KB |
subtask_2_15.txt | AC | 802 ms | 1024 KB |
subtask_2_16.txt | AC | 717 ms | 1024 KB |
subtask_2_17.txt | AC | 719 ms | 1024 KB |
subtask_2_18.txt | AC | 716 ms | 1024 KB |
subtask_2_19.txt | AC | 12 ms | 1024 KB |
subtask_2_20.txt | AC | 11 ms | 1024 KB |
subtask_2_21.txt | AC | 10 ms | 1152 KB |
subtask_2_22.txt | AC | 297 ms | 1024 KB |
subtask_2_23.txt | AC | 298 ms | 1024 KB |
subtask_2_24.txt | AC | 298 ms | 1024 KB |
subtask_2_25.txt | AC | 298 ms | 1024 KB |
subtask_2_26.txt | AC | 418 ms | 1024 KB |
subtask_2_27.txt | AC | 415 ms | 1024 KB |
subtask_2_28.txt | AC | 24 ms | 1024 KB |
subtask_2_29.txt | AC | 85 ms | 1024 KB |
subtask_2_30.txt | AC | 355 ms | 1024 KB |
subtask_2_31.txt | AC | 779 ms | 1024 KB |
subtask_2_32.txt | AC | 778 ms | 1024 KB |
subtask_2_33.txt | AC | 778 ms | 1152 KB |
subtask_2_34.txt | AC | 779 ms | 1024 KB |
subtask_2_35.txt | AC | 476 ms | 1024 KB |
subtask_2_36.txt | AC | 475 ms | 1024 KB |
subtask_2_37.txt | AC | 476 ms | 1024 KB |
subtask_2_38.txt | AC | 475 ms | 1024 KB |