QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#458389 | #8832. Daily Disinfection | ucup-team3608# | WA | 2ms | 3852kb | C++17 | 662b | 2024-06-29 16:59:46 | 2024-06-29 16:59:49 |
Judging History
answer
#include"bits/stdc++.h"
#include"bits/stdc++.h"
using lint = int64_t;
using namespace std;
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
int t; cin>>t;
while(t--){
int n; cin>>n;
string s; cin>>s;
int ones = 0;
for(char c : s)
if(c == '1')
ones++;
int pref = 0, suff =0;
for(int i = 0; i < n; i++){
if(s[i] == '0') break;
pref++;
}
for(int i = n-1; i >=0; i--){
if(s[i] == '0') break;
suff++;
}
cout<<ones + min(pref, suff)<<"\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
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: 3852kb
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 7 7 0 2 1 5 6 9 7 9 0 9 5 5 7 14 9 0 10 8 7 3 6 0 6 2 5 4 10 10 4 6 1 8 2 1 8 1 9 12 9 15 4 12 13 19 6 4 4 5 1 1 7 8 5 4 0 0 11 9 5 6 7 6 4 9 1 4 5 12 0 2 10 4 3 7 7 3 7 5 3 7 9 15 2 6 8 9 8 6 1 2 6 2 11 10 5 0 0 4 7 4 10 0 4 7 9 3 3 10 3 6 12 8 1 8 6 5 2 4 9 7 1 6 8 8 3 5 14 6 10 8 8 9 16 2 7 6 ...
result:
wrong answer 2nd numbers differ - expected: '6', found: '7'