QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#787589#9229. Juliet Unifies Onesucup-team2179#WA 0ms3780kbC++23902b2024-11-27 13:17:422024-11-27 13:17:43

Judging History

This is the latest submission verdict.

  • [2024-11-27 13:17:43]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3780kb
  • [2024-11-27 13:17:42]
  • Submitted

answer

#include<bits/stdc++.h>
#define int long long
#define db double
#define ll long long
#define pii pair<int, int>
using namespace std;
void solve() {
    string str;
    cin >> str;
    int n = str.length();
    str = '#' + str;
    int ans = 1e9;
    for (int i = 1; i <= n; i++)
        for (int j = i; j <= n; j++) {
            if (i == 4 && j == 8)
                int debug = 0;
            int tem = 0;
            for (int k = i; k <= j; k++)
                tem += str[k] == '0';
            for (int k = 1; k < i; k++)
                tem += str[k] == '1';
            for (int k = j + 1; k <= n; k++)
                tem += str[k] == '1';
            ans = min(ans, tem);
        }
    cout << ans << "\n";
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

00011011001

output:

2

result:

ok 1 number(s): "2"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3780kb

input:

11101111111111111101001011110111111110011101010110

output:

11

result:

ok 1 number(s): "11"

Test #3:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

00000000100000000000100000010001000

output:

3

result:

ok 1 number(s): "3"

Test #4:

score: -100
Wrong Answer
time: 0ms
memory: 3524kb

input:

00000000000000000000000000000000000000000000000000

output:

1

result:

wrong answer 1st numbers differ - expected: '0', found: '1'