QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#706840#8832. Daily DisinfectionaYi_7#WA 2ms3616kbC++231.3kb2024-11-03 13:38:352024-11-03 13:38:35

Judging History

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

  • [2024-11-03 13:38:35]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3616kb
  • [2024-11-03 13:38:35]
  • 提交

answer

#include <bits/stdc++.h>
// #define pii pair<int, int>
#define int long long

using namespace std;

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;

    int sum{};
    for(auto &i : s) sum += (i == '1');

    if (s[0] == '1' && s.back() == '1') {
        bool flag = false;
        for (int i = 1; i < n; i++) {
            if (s[i] == '0' && s[i - 1] == '0') {
                flag = true;
                break;
            }
        }
        if (!flag) {
            int min1 = 3e5, len = 0;
            for (int i = 0; i < n; i++) {
                if (s[i] == '1') {
                    len++;

                } else {
                    if (len != 0) {
                        min1 = std::min(min1, len);
                    }
                    len = 0;
                }
            }
            if (len != 0) {
                min1 = std::min(min1, len);
            }
            std::cout << sum + len << '\n';
            return ;
        }
    }

    std::cout << sum << '\n';
}

/*
5
a
sos
abba
icpc
tenet
*/

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;
    std::cin >> t;
    for (int i = 0; i < t; ++i) {
        solve();
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3568kb

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: 3616kb

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
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
5
...

result:

wrong answer 40th numbers differ - expected: '8', found: '11'