#include <iostream> #include <vector> #include <map> #include <algorithm> #include <string.h> using namespace std; const unsigned long long mod = 1000000007; char s1[10100]; char s2[10100]; char s3[10100]; unsigned long long n; unsigned long long g=0; void gen(char *o, int idx, unsigned long long r, char *s) { if(idx==n) { int count=0; for(int i=0;i<n;i++)count += o[i]!=s[i]; g+=count<=r; return; } o[idx]='0'; gen(o,idx+1,r,s); o[idx]='1'; gen(o,idx+1,r,s); } void gen2(char *o, int idx, unsigned long long r1, char *s1, unsigned long long r2, char *s2) { if(idx==n) { long long count1=0,count2=0; for(int i=0;i<n;i++) { count1 += o[i]!=s1[i]; count2 += o[i]!=s2[i]; } g+=(count1<=r1 && count2<=r2); return; } o[idx]='0'; gen2(o,idx+1,r1,s1,r2,s2); o[idx]='1'; gen2(o,idx+1,r1,s1,r2,s2); } void gen3(char *o, int idx, unsigned long long r1, char *s1, unsigned long long r2, char *s2, unsigned long long r3, char *s3) { if(idx==n) { long long count1=0,count2=0,count3=0; for(int i=0;i<n;i++) { count1 += o[i]!=s1[i]; count2 += o[i]!=s2[i]; count3 += o[i]!=s3[i]; } g+=(count1<=r1 && count2<=r2 && count3<=r3); return; } o[idx]='0'; gen3(o,idx+1,r1,s1,r2,s2,r3,s3); o[idx]='1'; gen3(o,idx+1,r1,s1,r2,s2,r3,s3); } unsigned long long newt[10100][10100]; void initnewt() { newt[0][0]=1; for(int i=1;i<10100;i++) { for(int j=0;j<=i;j++) { if(j==0)newt[i][j]=1; else if(j==i)newt[i][j]=1; else { newt[i][j]=newt[i-1][j]+newt[i-1][j-1]; newt[i][j]%=mod; } } } } unsigned long long newton(unsigned long long n, unsigned long long k) { if(k>n)return 0; if(n<0)return 0; if(k<0)return 0; return newt[n][k]; } unsigned long long objkuli(unsigned long long r, char *s) { unsigned long long g=0; for(long long i=0;i<=r;i++) { g+=newton(n,i); g%=mod; } return g%mod; } unsigned long long przeciecie2(unsigned long long r1, char *s1, unsigned long long r2, char *s2) { //g=0; //char o[10100]; //gen2(o,0,r1,s1,r2,s2); //printf("gen2: %u\n",g); // return g%mod; long long g=0,count=0; for(int i=0;i<n;i++)count+=s1[i]!=s2[i]; //printf("n:%u, count:%u r1:%u, r2:%u s1:%s, s2:%s\n",n, count,r1,r2,s1,s2); for(long long i=max(count-(int)r2,0LL);i<=r1;i++) { // S1 |----------|++++++++++++++++++++++++| // // // p |----------++++|----|---------------| // i r1 // // // S2 |----------|------------------------| for(long long j= max(count,i) ;j<=count+i && j<= n && j<=count+r2 && j-i+j-count<=r2;j++) { // printf("i:%d j:%d newton(count,count-(j-i))*newton(n-count,j-count)=%d*%d=%d\n",i,j,newton(count,count-(j-i)),newton(n-count,j-count),newton(count,count-(j-i))*newton(n-count,j-count)); g+=newton(count,count-(j-i))*newton(n-count,j-count); g%=mod; } } //printf("g:%u\n",g); return g%mod; } unsigned long long przeciecie3(unsigned long long r1, char *s1, unsigned long long r2, char *s2, unsigned long long r3, char *s3) { g=0; char o[10100]; gen3(o,0,r1,s1,r2,s2,r3,s3); return g%mod; } int main() { // your code goes here unsigned long long r1,r2,r3; scanf("%llu",&n); scanf("%llu %s\n",&r1,s1); scanf("%llu %s\n",&r2,s2); scanf("%llu %s\n",&r3,s3); initnewt(); if((strcmp(s1,s2) || r1!=r2) && (strcmp(s3,s2) || r3!=r2) && (strcmp(s1,s3) || r1!=r3)) { unsigned long long obj1 = objkuli(r1,s1); unsigned long long obj2 = objkuli(r2,s2); unsigned long long obj3 = objkuli(r3,s3); unsigned long long obj12 = przeciecie2(r1,s1,r2,s2); unsigned long long obj23 = przeciecie2(r2,s2,r3,s3); unsigned long long obj31 = przeciecie2(r3,s3,r1,s1); unsigned long long obj123 = przeciecie3(r1,s1,r2,s2,r3,s3); printf("%llu\n",(obj1+obj2+obj3-obj12-obj23-obj31+obj123)%mod); } else { // printf("2 takie same...\n"); if(strcmp(s1,s2)== 0 && r1==r2) { strcpy(s2,s3); r2=r3; // printf("2=3\n"); } unsigned long long obj1 = objkuli(r1,s1); unsigned long long obj2 = objkuli(r2,s2); unsigned long long obj12 = przeciecie2(r1,s1,r2,s2); printf("%llu\n",(obj1+obj2-obj12)%mod); } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 | #include <iostream> #include <vector> #include <map> #include <algorithm> #include <string.h> using namespace std; const unsigned long long mod = 1000000007; char s1[10100]; char s2[10100]; char s3[10100]; unsigned long long n; unsigned long long g=0; void gen(char *o, int idx, unsigned long long r, char *s) { if(idx==n) { int count=0; for(int i=0;i<n;i++)count += o[i]!=s[i]; g+=count<=r; return; } o[idx]='0'; gen(o,idx+1,r,s); o[idx]='1'; gen(o,idx+1,r,s); } void gen2(char *o, int idx, unsigned long long r1, char *s1, unsigned long long r2, char *s2) { if(idx==n) { long long count1=0,count2=0; for(int i=0;i<n;i++) { count1 += o[i]!=s1[i]; count2 += o[i]!=s2[i]; } g+=(count1<=r1 && count2<=r2); return; } o[idx]='0'; gen2(o,idx+1,r1,s1,r2,s2); o[idx]='1'; gen2(o,idx+1,r1,s1,r2,s2); } void gen3(char *o, int idx, unsigned long long r1, char *s1, unsigned long long r2, char *s2, unsigned long long r3, char *s3) { if(idx==n) { long long count1=0,count2=0,count3=0; for(int i=0;i<n;i++) { count1 += o[i]!=s1[i]; count2 += o[i]!=s2[i]; count3 += o[i]!=s3[i]; } g+=(count1<=r1 && count2<=r2 && count3<=r3); return; } o[idx]='0'; gen3(o,idx+1,r1,s1,r2,s2,r3,s3); o[idx]='1'; gen3(o,idx+1,r1,s1,r2,s2,r3,s3); } unsigned long long newt[10100][10100]; void initnewt() { newt[0][0]=1; for(int i=1;i<10100;i++) { for(int j=0;j<=i;j++) { if(j==0)newt[i][j]=1; else if(j==i)newt[i][j]=1; else { newt[i][j]=newt[i-1][j]+newt[i-1][j-1]; newt[i][j]%=mod; } } } } unsigned long long newton(unsigned long long n, unsigned long long k) { if(k>n)return 0; if(n<0)return 0; if(k<0)return 0; return newt[n][k]; } unsigned long long objkuli(unsigned long long r, char *s) { unsigned long long g=0; for(long long i=0;i<=r;i++) { g+=newton(n,i); g%=mod; } return g%mod; } unsigned long long przeciecie2(unsigned long long r1, char *s1, unsigned long long r2, char *s2) { //g=0; //char o[10100]; //gen2(o,0,r1,s1,r2,s2); //printf("gen2: %u\n",g); // return g%mod; long long g=0,count=0; for(int i=0;i<n;i++)count+=s1[i]!=s2[i]; //printf("n:%u, count:%u r1:%u, r2:%u s1:%s, s2:%s\n",n, count,r1,r2,s1,s2); for(long long i=max(count-(int)r2,0LL);i<=r1;i++) { // S1 |----------|++++++++++++++++++++++++| // // // p |----------++++|----|---------------| // i r1 // // // S2 |----------|------------------------| for(long long j= max(count,i) ;j<=count+i && j<= n && j<=count+r2 && j-i+j-count<=r2;j++) { // printf("i:%d j:%d newton(count,count-(j-i))*newton(n-count,j-count)=%d*%d=%d\n",i,j,newton(count,count-(j-i)),newton(n-count,j-count),newton(count,count-(j-i))*newton(n-count,j-count)); g+=newton(count,count-(j-i))*newton(n-count,j-count); g%=mod; } } //printf("g:%u\n",g); return g%mod; } unsigned long long przeciecie3(unsigned long long r1, char *s1, unsigned long long r2, char *s2, unsigned long long r3, char *s3) { g=0; char o[10100]; gen3(o,0,r1,s1,r2,s2,r3,s3); return g%mod; } int main() { // your code goes here unsigned long long r1,r2,r3; scanf("%llu",&n); scanf("%llu %s\n",&r1,s1); scanf("%llu %s\n",&r2,s2); scanf("%llu %s\n",&r3,s3); initnewt(); if((strcmp(s1,s2) || r1!=r2) && (strcmp(s3,s2) || r3!=r2) && (strcmp(s1,s3) || r1!=r3)) { unsigned long long obj1 = objkuli(r1,s1); unsigned long long obj2 = objkuli(r2,s2); unsigned long long obj3 = objkuli(r3,s3); unsigned long long obj12 = przeciecie2(r1,s1,r2,s2); unsigned long long obj23 = przeciecie2(r2,s2,r3,s3); unsigned long long obj31 = przeciecie2(r3,s3,r1,s1); unsigned long long obj123 = przeciecie3(r1,s1,r2,s2,r3,s3); printf("%llu\n",(obj1+obj2+obj3-obj12-obj23-obj31+obj123)%mod); } else { // printf("2 takie same...\n"); if(strcmp(s1,s2)== 0 && r1==r2) { strcpy(s2,s3); r2=r3; // printf("2=3\n"); } unsigned long long obj1 = objkuli(r1,s1); unsigned long long obj2 = objkuli(r2,s2); unsigned long long obj12 = przeciecie2(r1,s1,r2,s2); printf("%llu\n",(obj1+obj2-obj12)%mod); } return 0; } |