QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#533828#6128. Flippy SequenceTomato_Fish#AC ✓64ms9716kbC++14708b2024-08-26 15:16:042024-08-26 15:16:05

Judging History

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

  • [2024-08-26 15:16:05]
  • 评测
  • 测评结果:AC
  • 用时:64ms
  • 内存:9716kb
  • [2024-08-26 15:16:04]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N=1e6+100;
char s1[N],s2[N];int a[N];

int main()
{

    int T;scanf("%d",&T);
    while(T--){
        int n;scanf("%d",&n);
        scanf("%s",s1+1);
        scanf("%s",s2+1);
        for(int i=1;i<=n;i++)
            a[i]=(s1[i]!=s2[i]);
        a[n+1]=0;
        for(int i=n+1;i>=1;i--) a[i]=(a[i]^a[i-1]);
        int Sum=0;
        for(int i=1;i<=n+1;i++)
            if(a[i]) Sum++;
        if(Sum>4) printf("0\n");
        else if(Sum==4) printf("6\n");
        else if(Sum==2) printf("%d\n",2*(n-1));
        else{
            printf("%lld\n",(ll)n*(n+1)/2);
        }
    }

    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 5996kb

input:

3
1
1
0
2
00
11
5
01010
00111

output:

0
2
6

result:

ok 3 number(s): "0 2 6"

Test #2:

score: 0
Accepted
time: 64ms
memory: 9716kb

input:

126648
1
0
0
1
1
0
2
01
01
2
01
11
2
10
11
2
11
00
3
011
011
3
010
110
3
011
001
3
111
001
3
001
000
3
101
000
3
011
000
3
111
000
4
1111
1111
4
1110
0110
4
0010
0110
4
1011
0111
4
1001
1011
4
0100
1110
4
0000
0110
4
0111
1001
4
1001
1000
4
1011
0010
4
0001
0100
4
1000
0101
4
0100
0111
4
1101
0110
4...

output:

1
0
3
2
2
2
6
4
4
4
4
6
4
4
10
6
6
6
6
6
6
6
6
6
6
6
6
6
6
6
15
8
8
8
8
6
8
8
8
6
6
6
8
6
8
8
8
6
6
6
6
0
6
6
8
6
6
6
8
6
8
8
21
10
10
10
10
6
10
10
10
6
6
6
10
6
10
10
10
6
6
6
6
0
6
6
10
6
6
6
10
6
10
10
10
6
6
6
6
0
6
6
6
0
0
0
6
0
6
6
10
6
6
6
6
0
6
6
10
6
6
6
10
6
10
10
28
12
12
12
12
6
12
12
1...

result:

ok 126648 numbers