QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#457720 | #8832. Daily Disinfection | ucup-team4074# | WA | 2ms | 3476kb | C++20 | 680b | 2024-06-29 13:46:13 | 2024-06-29 13:46:15 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
void solve();
using pii = pair<int, int>;
using db = double;
signed main(){
fast
int t = 1;
cin >> t;
for(int i = 1; i <= t; i++){
solve();
}
}
const int N = 3e5 + 10, M = N * 2, P = 998244353;
int n;
string s;
void solve(){
cin >> n >> s;
int cnt = count(s.begin(), s.end(), '1');
if(s.front() == '0' || s.back() == '0' || s.find("00") != -1){
cout << cnt << '\n';
}
else{
int k = 0, l = 0;
for(auto e : s){
if(e == '1') l = max(l, ++k);
else k = 0;
}
cout << cnt + l << '\n';
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3476kb
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: 3432kb
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 11 11 9 13 4 11 13 22 6 5 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 5 3 7 7 3 7 4 3 7 9 15 2 6 6 9 8 6 1 2 6 2 11 10 5 0 0 4 7 4 7 0 4 7 9 3 3 10 3 6 11 8 1 13 6 5 2 4 9 7 1 5 7 8 3 5 11 6 10 8 8 9 16 2 7 6 5...
result:
wrong answer 40th numbers differ - expected: '8', found: '11'