QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#480314 | #8832. Daily Disinfection | ucup-team4361# | WA | 2ms | 3884kb | C++14 | 745b | 2024-07-16 13:25:16 | 2024-07-16 13:25:17 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-') f=-1;
c=getchar();
}
while(c>='0' && c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
const int N=2e5+5;
int n;
char c[N];
inline bool check()
{
for(int i=1;i<=n;i++)
{
if(c[i]=='1') continue;
int now=i;
while(now<=n && c[now]=='0') now++;
if(now-i>1) return false;
i=now-1;
}
return true;
}
int main()
{
int T=read();
while(T--)
{
n=read();
scanf("%s",c+1);
int ans=0;
for(int i=1;i<=n;i++)
if(c[i]=='1')
ans++;
if(c[1]=='1' && c[n]=='1' && check())
ans++;
printf("%d\n",ans);
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3884kb
input:
3 2 01 5 00110 9 101010101
output:
1 2 6
result:
ok 3 number(s): "1 2 6"
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3820kb
input:
10000 15 010111111011011 10 1000101111 10 0011111101 1 0 3 110 4 1000 8 10000111 20 00000101000100001110 13 1101110110110 13 0111100011010 17 00001001111110101 1 0 20 10001010011000111100 11 00100110101 11 10110101000 15 001011110011000 16 1110111110000111 15 011110110110010 1 0 20 10110001101100010...
output:
11 6 7 0 2 1 4 6 9 7 9 0 9 5 5 7 11 9 0 9 8 7 3 6 0 6 2 5 4 8 10 4 6 1 7 2 1 8 1 8 11 9 13 4 11 13 16 6 4 4 5 1 1 7 7 5 3 0 0 11 8 5 6 7 6 4 9 1 4 5 12 0 2 10 4 3 7 7 3 7 4 3 7 9 15 2 6 6 9 8 6 1 2 5 2 11 10 5 0 0 4 7 4 7 0 4 7 9 3 3 10 3 6 11 8 1 8 6 5 2 4 9 7 1 5 7 8 3 5 11 6 10 8 8 9 16 2 7 6 4 3...
result:
wrong answer 94th numbers differ - expected: '6', found: '5'