QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#180889#6128. Flippy Sequenceorganput#TL 1ms3444kbC++14737b2023-09-16 14:05:362023-09-16 14:05:36

Judging History

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

  • [2023-09-16 14:05:36]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3444kb
  • [2023-09-16 14:05:36]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define enld "\n"
using namespace std;
const int N=1e5+5;

void sol()
{
	int n;
	cin>>n;
	string a,b;
	cin>>a>>b;
	a=" "+a;b=" "+b;
	int cnt=0;
	int num=0;
	
	for(int i=1;i<=n;i++)
	{
		if(a[i]!=b[i])
		{
			int j=i;
			while(j+1<=n&&a[j+1]!=b[j+1])j++;
			cnt++;
			num=max(num,j-i+1);
//			cout<<"*"<<i<<" "<<j<<endl;
			i=j;
		}
	}
	if(cnt==1)
	{
		cout<<(num-1)*2+(n-num)*2<<endl;
	}
	else if(cnt==2)
	{
		cout<<6<<endl;
	}
	else if(cnt==0)
	{
		cout<<n*(n+1)/2<<endl;
	}
	else
	{
		cout<<0<<endl;
	}

}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
    int t=1;
	cin>>t;
	while(t--)
	{
	sol();
	}
	
	
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: -100
Time Limit Exceeded

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: