QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#640491 | #9430. Left Shifting 2 | Nuj# | WA | 2ms | 3620kb | C++14 | 844b | 2024-10-14 13:34:28 | 2024-10-14 13:34:29 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
char s[500005];
int a[500005];
int main(){
cin.tie(0)->sync_with_stdio(0);
int t;cin>>t;
while(t--){
cin>>s;int n=strlen(s);
bool yes=1;
for(int i=1;i<n;i++) if(s[i]^s[i-1]) yes=0;
if(yes) cout<<n/2<<endl;
else{
int ans=0,l=0,r=n-1,tot=0;
if(s[0]==s[n-1]){
int cnt=1;
for(int i=1;i<n;i++){
if(s[i]^s[i-1]){
l=i;break;
}
else cnt++;
}
for(int i=n-1;~i;i--){
if(s[i]^s[i-1]){
r=i-1;break;
}
else cnt++;
}
a[++tot]=cnt;
}
int cnt=1;
for(int i=l+1;i<=r;i++) if(s[i]^s[i-1]){
a[++tot]=cnt,cnt=1;
}
else cnt++;
a[++tot]=cnt;
bool yes=0;
for(int i=1;i<=tot;i++) ans+=a[i]>>1,yes|=~a[i]&1;
cout<<ans-yes<<endl;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
input:
3 abccbbbbd abcde x
output:
2 0 0
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3620kb
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 0 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'