QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#543482 | #7789. Outro: True Love Waits | warzone | WA | 4ms | 5620kb | C++14 | 1.4kb | 2024-09-01 16:58:44 | 2024-09-01 16:58:44 |
Judging History
answer
#include<stdio.h>
#include<string.h>
#include<algorithm>
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int word;
typedef unsigned short hword;
typedef unsigned char byte;
const word mod=109+7;
word f[1<<20];
struct READ{
char c,w;
inline READ(){
for(word i=1;i<(1<<20);++i)
f[i]=4ull*(f[i-1]+1)%mod;
c=getchar();}
template<typename type>
inline READ& operator>>(type &num){
for(w=1;'0'>c||c>'9';c=getchar())
w=c=='-'? -1:1;
for(num=0;'0'<=c&&c<='9';c=getchar())
num=num*10+(c-'0');
return num*=w,*this;
}
inline word operator>>(char b[]){
while('0'>c||c>'1') c=getchar();
word n=0;
for(;'0'<=c&&c<='1';c=getchar())
b[n++]=c-'0';
for(word i=0;i<n-i;++i)
std::swap(b[i],b[n-i-1]);
return n;
}
}cin;
word case_,k,n,m;
char s[1<<20],t[1<<20];
int main(){
for(cin>>case_;case_;--case_){
n=cin>>s,m=cin>>t,cin>>k,--k;
for(;n<m;++n) s[n]=0;
for(;m<n;++m) t[m]=0;
for(word i=0;i<n;++i)
s[i]^=t[i];
if(n&1) s[n++]=0;
for(m=0,n>>=1;m<n&&!(s[m<<1]||s[m<<1|1]);++m);
if(m==n) printf("%u\n",f[k]);
else if(m<k) puts("-1");
else{
ull ans=f[k];
for(;m<n;++m){
const char get=(s[m<<1|1]<<1)|s[m<<1];
if(get==1) ans+=f[m]+1;
else if(get==3) ans+=2ull*(f[m]+1);
else if(get==2) ans+=3ull*(f[m]+1);
}
printf("%llu\n",ans%mod);
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 4ms
memory: 5620kb
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: 4ms
memory: 5576kb
input:
1 0 0 1
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 4ms
memory: 5576kb
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: -100
Wrong Answer
time: 4ms
memory: 5608kb
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:
63 16 92 83 73 2 28 87 51 76 -1 73 -1 -1 86 -1 80 61 17 85 19 0 72 35 55 112 -1 88 35 115 52 21 46 58 62 50 -1 99 43 78 61 -1 -1 87 64 90 18 11 80 44 13 56 31 22 49 101 70 3 68 64 40 113 68 102 82 41 -1 100 113 21 -1 48 -1 11 102 71 61 87 61 69 66 115 88 -1 71 41 96 -1 57 97 54 47 60 19 66 -1 70 98 ...
result:
wrong answer 1st numbers differ - expected: '295', found: '63'