QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#779679#9430. Left Shifting 2syhhh1WA 7ms3792kbC++17773b2024-11-24 21:08:202024-11-24 21:08:22

Judging History

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

  • [2024-11-24 21:08:22]
  • 评测
  • 测评结果:WA
  • 用时:7ms
  • 内存:3792kb
  • [2024-11-24 21:08:20]
  • 提交

answer

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

#define int long long 
const int N=5e5+10;
char a[N];
signed main()
{
	int t;
	cin>>t;
	while(t--)
	{
	    string s;	
		cin>>s;
		int n=s.length();
		int ans=0;
		vector<pair<char,int>>v;
		int k=0;
		for(int i=0;i<n;)
		{
			int j=i;
			while(s[j]==s[i])j++;
			v.push_back({s[i],j-i});
			if((j-i)%2==0)k++;
			ans+=(j-i)/2;
			i=j;
		}
		bool fg=false;
		int sz=v[v.size()-1].second;
	     for(int i=0;i<v.size();i++)
		 {
			 if(v[i].first!=s[n-1]&&v[i].second%2==0)fg=true;
			 if(v[i].first==s[n-1])
			 {
				 if(k>=2&&(v[i].second+sz)%2)fg=true;
				 if(k>=2&&(v[i].second+sz)%2==0)fg=true;
			 }
		 }
		if(fg)cout<<ans-1<<endl;
	     else cout<<ans<<endl;
	}
	
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
abccbbbbd
abcde
x

output:

2
0
0

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 7ms
memory: 3592kb

input:

5000
lfpbavjsmppdppkfwnyfmbdhptdswsoulrbhyjh
cfliuqnynejgnxolzbdoztclzbozqomvioszk
eiivcoqoymonrqgrjdtkts
mdcvservaxcbioopfungsgkiftchwlmtbzqgaraovjknsgiegkvdbolmeunvrxrpscnf
ujeqtidwtoikkqtygo
llma
qjfvgwrdhaazejsfgilnpmmhkefndzvyon
kzwwpdpbrudqmwmjscllnnjyoepxophcoopvfepikouinuxx
vftculoorxskpkxoz...

output:

1
0
0
0
0
0
1
4
0
0
1
1
0
1
1
3
0
0
5
6
0
0
5
2
0
1
3
1
0
3
0
1
0
1
1
0
1
4
1
3
1
0
1
5
3
0
3
0
0
1
7
1
0
6
1
2
0
1
0
0
4
1
2
4
3
1
3
2
3
1
2
0
0
0
2
0
2
2
0
4
0
5
5
0
3
0
4
0
0
2
1
0
2
0
1
6
1
2
0
3
3
3
5
2
3
0
3
5
1
3
0
0
3
0
4
5
3
2
1
1
0
0
2
1
1
1
2
3
3
1
2
0
1
1
4
2
1
3
0
1
1
2
0
1
2
0
4
0
1
1
...

result:

wrong answer 13th lines differ - expected: '1', found: '0'