QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#747200	#9229. Juliet Unifies Ones	xh_team^#	AC ✓	0ms	3776kb	C++20	744b	2024-11-14 16:34:10	2024-11-14 16:34:10

Judging History

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

[2024-11-14 16:34:10]
评测

测评结果：AC
用时：0ms
内存：3776kb

查看

[2024-11-14 16:34:10]
提交

answer

#include <bits/stdc++.h>
using namespace std;


int main() {
    ios_base::sync_with_stdio(false);

    string s;
    cin >> s;

    int n = s.size();
    int res = n + 1;
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            if (s[i] == '1' && s[j] == '1') {
                int sum = 0;
                for (int k = 0; k < n; k++) {
                    if (k < i || k > j) {
                        sum += s[k] == '1';
                    } else {
                        sum += s[k] == '0';
                    }
                }
                res = min(res, sum);
            }
        }
    }
    if (res == n + 1) {
        res = 0;
    }
    cout << res;

    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3532kb

input:

00011011001

output:

result:

ok 1 number(s): "2"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3564kb

input:

11101111111111111101001011110111111110011101010110

output:

result:

ok 1 number(s): "11"

Test #3:

score: 0

Accepted

time: 0ms

memory: 3540kb

input:

00000000100000000000100000010001000

output:

result:

ok 1 number(s): "3"

Test #4:

score: 0

Accepted

time: 0ms

memory: 3752kb

input:

00000000000000000000000000000000000000000000000000

output:

result:

ok 1 number(s): "0"

Test #5:

score: 0

Accepted

time: 0ms

memory: 3772kb

input:

00000000100000000000100000011000

output:

result:

ok 1 number(s): "2"

Test #6:

score: 0

Accepted

time: 0ms

memory: 3628kb

input:

11000010100100000011101100000001000100000000000000

output:

result:

ok 1 number(s): "8"

Test #7:

score: 0

Accepted

time: 0ms

memory: 3500kb

input:

01100100111011110101010110000100001111110001110001

output:

result:

ok 1 number(s): "19"

Test #8:

score: 0

Accepted

time: 0ms

memory: 3496kb

input:

1110101111001

output:

result:

ok 1 number(s): "3"

Test #9:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

output:

result:

ok 1 number(s): "0"

Test #10:

score: 0

Accepted

time: 0ms

memory: 3500kb

input:

output:

result:

ok 1 number(s): "1"

Test #11:

score: 0

Accepted

time: 0ms

memory: 3744kb

input:

11111111111111111111111111111111111111111111111111

output:

result:

ok 1 number(s): "0"

Test #12:

score: 0

Accepted

time: 0ms

memory: 3484kb

input:

11111100000000001101010101100011

output:

result:

ok 1 number(s): "9"

Test #13:

score: 0

Accepted

time: 0ms

memory: 3568kb

input:

00011011001

output:

result:

ok 1 number(s): "2"

Test #14:

score: 0

Accepted

time: 0ms

memory: 3496kb

input:

output:

result:

ok 1 number(s): "1"

Test #15:

score: 0

Accepted

time: 0ms

memory: 3748kb

input:

100011011

output:

result:

ok 1 number(s): "2"

Test #16:

score: 0

Accepted

time: 0ms

memory: 3748kb

input:

output:

result:

ok 1 number(s): "0"

Test #17:

score: 0

Accepted

time: 0ms

memory: 3496kb

input:

1010101010011011001101100110011101101011100110110

output:

result:

ok 1 number(s): "19"

Test #18:

score: 0

Accepted

time: 0ms

memory: 3752kb

input:

01110100000000111100000011000000000110010001110101

output:

result:

ok 1 number(s): "14"

Test #19:

score: 0

Accepted

time: 0ms

memory: 3608kb

input:

01100001000000010000000000010010000100100101001000

output:

result:

ok 1 number(s): "9"

Test #20:

score: 0

Accepted

time: 0ms

memory: 3560kb

input:

1101010101010101010101010101010101010101010101011

output:

result:

ok 1 number(s): "23"

Extra Test:

score: 0

Extra Test Passed