QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#789050 | #9430. Left Shifting 2 | snow_mikumiku | WA | 0ms | 3584kb | C++14 | 782b | 2024-11-27 19:10:16 | 2024-11-27 19:10:16 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
void solve()
{
string S;
cin >> S;
if(S.size() == 2 && S[1] == S[0]) {
cout << 1 << '\n';
return;
}
int f = 0, ans = 0, cnt = 1, up = 0;
for(int i = 1; i < S.size(); i++) {
if(S[i] == S[i - 1]) cnt++;
else {
if(!up) up = cnt;
ans += cnt / 2;
if(cnt % 2 == 0) f = 1;
cnt = 1;
}
}
ans += cnt / 2;
if(S.back() == S[0]) {
if(cnt % 2 == 0 && up % 2 == 0) f = 1;
else f = 0;
}
cout << ans - f << '\n';
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while(t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
3 abccbbbbd abcde x
output:
2 0 0
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3556kb
input:
5000 lfpbavjsmppdppkfwnyfmbdhptdswsoulrbhyjh cfliuqnynejgnxolzbdoztclzbozqomvioszk eiivcoqoymonrqgrjdtkts mdcvservaxcbioopfungsgkiftchwlmtbzqgaraovjknsgiegkvdbolmeunvrxrpscnf ujeqtidwtoikkqtygo llma qjfvgwrdhaazejsfgilnpmmhkefndzvyon kzwwpdpbrudqmwmjscllnnjyoepxophcoopvfepikouinuxx vftculoorxskpkxoz...
output:
1 0 0 0 0 0 1 4 0 0 1 1 1 1 1 3 1 0 5 6 0 0 5 2 0 1 3 2 0 3 0 1 0 1 1 0 1 4 1 3 1 0 1 5 3 0 3 0 0 1 8 1 0 6 1 2 0 1 0 0 4 1 2 4 3 1 3 2 3 1 2 1 0 0 2 0 2 2 0 4 0 5 5 0 3 0 4 1 0 2 1 0 2 0 1 6 1 2 1 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 3 3 3 1 2 0 1 1 4 3 1 3 1 1 1 2 0 1 2 0 4 0 1 1 ...
result:
wrong answer 124th lines differ - expected: '0', found: '1'