/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 536.0 KiB
#2 Wrong Answer 23ms 344.0 KiB

Code

#include <iostream>
#include <string>
using namespace std;

int maxConsecutiveOnes(string s) {
    int count = 0;
    int maxCount = 0;
    
    for (char c : s) {
        if (c == '1') {
            count++;
        } else {
            maxCount = max(maxCount, count);
            count = 0;
        }
    }
    maxCount = max(maxCount, count);
    
    return maxCount;
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        string S;
        cin >> S;
        
        int totalOnes = 0;
        for (char c : S) {
            if (c == '1') totalOnes++;
        }

        if (totalOnes == 0) {
            cout << 0 << endl;
            continue;
        }

        int totalFlips = N - totalOnes;

        if (totalFlips >= 1) {
            cout << totalOnes + min(totalFlips, totalOnes) << endl;
        } else {
            cout << totalOnes << endl;
        }
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1113 Fliping Game
Contest
Brain Booster #7
Language
C++11 (G++ 13.2.0)
Submit At
2024-11-05 15:05:50
Judged At
2024-11-05 15:05:50
Judged By
Score
0
Total Time
23ms
Peak Memory
536.0 KiB