QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#677457#7789. Outro: True Love WaitsQzongTL 84ms3696kbC++142.8kb2024-10-26 12:10:082024-10-26 12:10:08

Judging History

你现在查看的是最新测评结果

  • [2024-10-26 12:10:08]
  • 评测
  • 测评结果:TL
  • 用时:84ms
  • 内存:3696kb
  • [2024-10-26 12:10:08]
  • 提交

answer

#include<cstdio>
#include<cstring>
const int N=1000010;
const int mod=1e9+7;
char s[N],t[N],tmp[N];
int max(int x,int y){
	return x>y?x:y;
}
void work(){
	scanf("%s",s),scanf("%s",t);
    int lens=strlen(s),lent=strlen(t);
	int len=max(lens,lent);
    if(len&1)len++;
    for(int i=lens;i<len;i++)s[i]='0';
    for(int i=lent;i<len;i++)t[i]='0';
    for(int i=0;i<lens-i-1;i++){
        char ch=s[i];
        s[i]=s[lens-i-1];
        s[lens-i-1]=ch;
    }
    for(int i=0;i<lent-i-1;i++){
        char ch=t[i];
        t[i]=t[lent-i-1];
        t[lent-i-1]=ch;
    }
    // for(int i=0;i<len;i++)putchar(s[i]);
        // puts("");
	for(int i=0;i<len;i++){
        // tmp[i]=s[len-i-1];
        // putchar(s[i]),putchar(t[i]),puts("");
        if(s[i]==t[i])s[i]='0';
        else s[i]='1';
		// if(s[i]==t[i])t[i]='0';
		// else t[i]='1';
	}
    // for(int i=0;i<len;i++)s[i]=tmp[i];
    // for(int i=0;i<len;i++)putchar(s[i]);
    // puts("");
    int k;
    scanf("%d",&k);
    int ans=0;
    int flag=1;
    for(int i=0;i<len;i++)if(s[i]!='0')flag=0;
	if(k==1){
		for(int i=0,now=1,now1=0;i+1<len;i+=2){
            int x;
            if(s[i]=='0'&&s[i+1]=='0')x=0;
            else if(s[i]=='1'&&s[i+1]=='0')x=1;
            else if(s[i]=='1'&&s[i+1]=='1')x=2;
            else if(s[i]=='0'&&s[i+1]=='1')x=3;
            ans=(ans+1ll*now1*x+x)%mod;
            now=1ll*now*4%mod;
            now1=(now+now1)%mod;
            // printf("%d %d %d %d %d\n",i,now,now1,ans,x);
        }
        printf("%d\n",ans);
	}
    else if(flag){
        k--;
        int now=0,now1=1;
        for(int i=1;i<=k;i++){
            now1=1ll*now1*4%mod;
            now=(now+now1)%mod;
        }
        printf("%d\n",now);
    }
    else {
        int cnt=0;
        for(int i=0,now=1,now1=0;i+1<len;i+=2){
            int x;
            if(s[i]=='0'&&s[i+1]=='0')x=0;
            else if(s[i]=='1'&&s[i+1]=='0')x=1;
            else if(s[i]=='1'&&s[i+1]=='1')x=2;
            else if(s[i]=='0'&&s[i+1]=='1')x=3;
            ans=(ans+1ll*now1*x+x)%mod;
            now=1ll*now*4%mod;
            now1=(now+now1)%mod;
        }
        int ggg=0;
        for(int i=0;i<len;i+=2){
            if(s[i]=='0'&&s[i+1]=='0')ggg++;
            else break;
        }
        k--;
        if(k>ggg)puts("-1");
        else {
            int now=0,now1=1;
            for(int i=1;i<=k;i++){
                now1=1ll*now1*4%mod;
                now=(now+now1)%mod;
            }
            ans=(ans+now)%mod;
            printf("%d\n",ans);
        }
        // printf("%d %d %d %d %d\n",i,now,now1,ans,x);
    }
    for(int i=0;i<len+5;i++)s[i]=t[i]=0;
}
int main(){
    // freopen("a.in","r",stdin);
    int t;
    scanf("%d",&t);
    while(t--)work();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3652kb

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: 0ms
memory: 3652kb

input:

1
0 0 1

output:

0

result:

ok 1 number(s): "0"

Test #3:

score: 0
Accepted
time: 0ms
memory: 1612kb

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: 3696kb

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: 0
Accepted
time: 0ms
memory: 1600kb

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
1361
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
76...

result:

ok 1000 numbers

Test #6:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

1000
100110100101100101010111110010101010110011100011111101110010010001011001100100000001101110101111101 1110001111001100110000111010010101001111100010101010110110101001000001001000011101000011001110101011 1
11101111001001100011000010001010001011001101011110011011100111011111000000010000110100101001...

output:

218980472
-1
-1
517518581
-1
-1
85094150
666890546
885064041
-1
-1
189310507
730304733
-1
659799430
794266104
-1
-1
-1
760479713
644678967
837810902
535065049
-1
-1
-1
186342775
939519657
-1
257634724
172396207
442878387
-1
495325667
951414912
-1
-1
-1
714507638
-1
525066268
-1
-1
-1
920213221
-1
-1...

result:

ok 1000 numbers

Test #7:

score: 0
Accepted
time: 10ms
memory: 1548kb

input:

1000
1101010010111010000111000000000101000000111101010010010101110011000000111011010000110111000101001101010101110100000111000110110101100001111100010010001000011100100111100100000100101100001111010010000010111101010000000110011100011100100000010111110100000111010010110111000111010000101011011111011...

output:

392697873
-1
-1
-1
337638914
150474497
812988479
14301059
242433325
207160298
-1
345593651
-1
649843860
-1
-1
904010827
-1
505608125
898864826
772130764
5160799
234942297
-1
84958267
-1
-1
-1
-1
732394003
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
522542096
-1
349811717
-1
-1
-1
52557246
-1
850414...

result:

ok 1000 numbers

Test #8:

score: 0
Accepted
time: 45ms
memory: 3680kb

input:

1000
1101111111110110100111000010100010011111010100000100100110011010110111110100000100101100110011111011101001001001000000010111010001111100101101111000010011010010111110111000111111100010100011100001010010110011001101110010110011010010110000101010001000101000011001111101001100011011011100011010101...

output:

800723017
736241483
-1
214103223
-1
560328139
-1
-1
-1
-1
-1
-1
627204069
-1
-1
-1
59957998
527911577
364243222
640552596
40541566
561771248
863747051
147600304
-1
-1
665706424
905996351
683049809
136472343
387837991
-1
-1
728303101
-1
579656230
916322837
745095574
-1
-1
999380075
-1
-1
-1
-1
-1
-1
...

result:

ok 1000 numbers

Test #9:

score: 0
Accepted
time: 79ms
memory: 1632kb

input:

1000
0 10000010011110111011010111111011001101110001001001100001110011100100011111000001001111000010110101100001101111111110110100010000100001001101001111100000111100001101110101100001101111110001001101100000001010110110101100111110100010010111101011000111111010011110001111001111001111001101011000000...

output:

58376942
300766824
414156121
-1
-1
-1
-1
88479909
720713306
306938941
-1
423848104
440743683
478829933
-1
462661101
889252617
-1
-1
-1
964856420
-1
-1
-1
-1
-1
82855520
-1
-1
3110379
686092492
931632750
-1
-1
-1
-1
940831778
488427141
-1
-1
661417338
116153160
-1
425604704
458005044
-1
159078900
921...

result:

ok 1000 numbers

Test #10:

score: 0
Accepted
time: 79ms
memory: 1832kb

input:

100
11110010010001000100010111001111000100110100101010111000100000110110111001101100000101101000111011101010011111011011101000100000101111010011011100101111001010101010000110000100100010010011011100110101100110000001010011110011010010000110001010001111100110101101110011000111101010010111110101001000...

output:

462011783
521025699
287271357
570655586
456767304
329006899
238484791
947067110
-1
321339742
892341001
341864209
957855854
921186081
566465880
771098276
874776895
342528323
614989005
253849992
494496838
786564559
531120498
191845391
-1
848544140
442763668
154392835
320194212
-1
942226479
835067908
7...

result:

ok 100 numbers

Test #11:

score: 0
Accepted
time: 72ms
memory: 3532kb

input:

10
100010011010101111000101100000111000000010001111111000000100000001001011110011100000001010101110010001111100111000001110011001000110000101001100110100100001000001010001001111001100100001001000001001101000001100010001011111011111111011111111011000100100001000011111000100000001000111000111110001100...

output:

-1
-1
274714929
384784303
207381248
-1
928083397
-1
651865477
38209655

result:

ok 10 numbers

Test #12:

score: 0
Accepted
time: 84ms
memory: 1588kb

input:

100000
101001001101010000011110011 110100000001100000000011001010100111000010010000001100011100000010010 1
1001111000001110111010001011001110001011010000110000011100000100110000 111001011001001110101000010100 1
1111000100101000001011111100010100010101010100110100010110010110000 110101000010011100001...

output:

632145185
400205347
234734936
-1
843239926
943197772
-1
33248281
343066805
879147467
113127988
872252209
801735279
-1
-1
-1
375307518
-1
-1
-1
723430324
599663758
72686015
625897124
600699345
876415884
-1
185570509
296533591
183514003
-1
223858775
842750716
294113333
889586630
-1
36491106
725331632
...

result:

ok 100000 numbers

Test #13:

score: -100
Time Limit Exceeded

input:

100000
10011001111000111101010100011110000010100001011111 10011001111000111101010100011110000010100001011111 1000000000
10101010000110001000111000000110011001011111111000 10101010000110001000111000000110011001011111111000 1000000000
1111101101110001000000111111001011011110010011100 11111011011100010...

output:


result: