QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#457597#8832. Daily Disinfectionucup-team3678#WA 6ms3832kbC++14711b2024-06-29 13:23:222024-06-29 13:23:23

Judging History

你现在查看的是最新测评结果

  • [2024-06-29 13:23:23]
  • 评测
  • 测评结果：WA
  • 用时：6ms
  • 内存：3832kb
查看
  • [2024-06-29 13:23:22]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        string s; cin >> s;
        int res = count(s.begin(), s.end(), '1'), flg = 0;
        for (int i = 0; i + 1 < n; ++i) {
            if (s[i] == '0' && s[i + 1] == '0') {
                flg = 1;
                break;
            }
        }
        if (flg || s[0] == '0' || s[n - 1] == '0') {
            printf("%d\n", res);
            continue;
        }
        int l0 = 0, l1 = n - 1;
        while (s[l0] == '1') ++l0;
        while (s[l1] == '1') --l1;
        printf("%d\n", res + min(l0, n - 1 - l1));
    }
    return 0;
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3648kb

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: 6ms
memory: 3832kb

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
9
11
9
13
4
11
13
19
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
6
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 40th numbers differ - expected: '8', found: '9'
English 繁體中文 简体中文

Server Time: 2025-01-21 09:29:00 | OpenSource Project