QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#736024 | #7789. Outro: True Love Waits | Suhy | WA | 5ms | 10044kb | C++17 | 1.5kb | 2024-11-11 23:38:26 | 2024-11-11 23:38:27 |
Judging History
answer
#include<cstdio>
typedef long long d64;
const d64 M=1000000007;
int T,n,m,i,k;
d64 x[1000086];
bool A[1000086],B[1000086],*a,*b;
int read(bool *s){
char c;
while(c=getchar(),c!='0'&&c!='1');
int r=0;
while(c=='0'||c=='1')s[r++]=c-'0',c=getchar();
return r;
}
void swap(bool &a,bool &b){
bool c=a;a=b;b=c;
}
int main(){
x[0]=1;
for(i=0;i<=1000000;++i)x[i+1]=(4*x[i]+1)%M;
scanf("%d",&T);
while(T--){
a=A;b=B;
n=read(a);
m=read(b);
for(i=0;i+i<n;++i)swap(a[i],a[n-i-1]);
for(i=0;i+i<m;++i)swap(b[i],b[m-i-1]);
if(n<m){
bool *c=a;a=b;b=c;
i=n;n=m;m=i;
}
for(i=0;i<m;++i)a[i]^=b[i];
scanf("%d",&k);
int cnt=0;
for(i=0;i<n;++i)if(a[i])++cnt;
if(!cnt)printf("%d\n",(x[k-1]+M-1)%M);
else{
if(k>2)puts("-1");
else{
d64 ans=0;
if(n&1)a[n++]=0;
for(i=0;i+i<n;++i){
int d=0;
if(a[i+i+1]){
if(!a[i+i])++d;
d+=2;
}else if(a[i+i])++d;
ans+=d*x[i];
}
if(k==2){
if(a[0]||a[1])ans=-1;
else (ans+=4)%M;
}else ans%=M;
printf("%d\n",ans);
}
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 5ms
memory: 9712kb
input:
4 1 10 1 1 10 2 100 0 2 11 11 3
output:
2 -1 9 20
result:
ok 4 number(s): "2 -1 9 20"
Test #2:
score: 0
Accepted
time: 5ms
memory: 9768kb
input:
1 0 0 1
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 5ms
memory: 10044kb
input:
100 110111 11111 1 10110 101101 1 11010 111111 1 100110 1 1 10010 11010 1 1100 10111 1 100100 111110 1 101110 101100 1 1011 10110 1 110100 1110 1 11010 11000 1 11110 1000 1 111000 11101 1 110 1001 1 101010 11000 1 10 111110 1 110001 101000 1 1010 1000 1 10101 11 1 111011 11010 1 110001 100000 1 1100...
output:
78 59 69 70 15 38 39 3 32 60 3 29 69 12 45 52 37 3 29 64 22 39 54 69 65 27 33 76 34 18 57 13 81 15 23 70 69 36 18 23 29 42 69 54 6 0 63 3 29 15 10 16 80 24 37 59 71 13 23 31 21 34 23 48 21 47 7 44 42 3 37 75 59 29 55 39 29 28 29 70 55 16 54 47 24 18 79 60 8 26 64 58 32 6 8 37 2 68 42 44
result:
ok 100 numbers
Test #4:
score: 0
Accepted
time: 0ms
memory: 9508kb
input:
100 10011111 111 2 1011101100 1000000100 1 100011111 1001001111 1 1001100101 1100100001 1 10101000 10000100 1 1011110101 100011101 1 110100001 111011010 1 1101001100 1111101101 1 1001101 11011010 1 1101110110 1101011000 1 110011001 1100001111 2 1001111001 1011001111 1 1001110 1101110100 2 1110110100...
output:
295 248 788 431 73 930 144 319 283 76 -1 305 -1 -1 86 -1 312 293 1293 433 1179 0 884 963 1215 576 -1 1132 499 811 864 949 1322 406 526 862 -1 447 1203 1238 873 -1 -1 1131 1108 438 134 359 80 740 1057 752 31 950 1093 1261 650 235 996 876 504 925 1344 450 1010 273 -1 1144 1041 717 -1 164 -1 11 798 419...
result:
ok 100 numbers
Test #5:
score: -100
Wrong Answer
time: 0ms
memory: 10032kb
input:
1000 1010011001 1100000000 1 1111001110 100100011 1 10000001 1110100110 1 1001000010 1111011110 1 11110001 101101110 1 10110001 110010 1 110111100 1111011111 1 1010101010 1111110000 1 11010110 11000110 1 1101101100 10001101 1 1101000110 111100110 3 1101100 10110 1 1001101001 10010001 1 1000110100 11...
output:
633 1267 752 627 629 257 1173 465 21 916 -1 145 1250 1006 155 783 412 684 400 1126 1204 185 298 932 535 246 1094 325 272 -1 -1 389 164 -1 -1 644 436 1271 261 741 351 212 985 426 236 1356 952 1256 1039 911 709 547 1349 142 229 1077 538 48 1089 378 1152 524 218 1161 485 884 751 299 206 268 95 933 769 ...
result:
wrong answer 11th numbers differ - expected: '1361', found: '-1'