algorithms

Algorithm implementations
git clone git://git.laack.co/algorithms.git
Log | Files | Refs | README

main.cpp (1049B)


      1 #include <iostream>
      2 #include <vector>
      3 #include <unordered_set>
      4 #include <cmath>
      5 #include <unordered_map>
      6 #include <algorithm>
      7 #include <queue>
      8 
      9 #define ll long long
     10 
     11 using namespace std;
     12 
     13 int main() {
     14 
     15     int testCases;
     16     string  s;
     17     cin >> testCases;
     18 
     19     for(int z = 0; z < testCases; ++z) {
     20         cin >> s;
     21         int zeroes = 0;
     22         for(int i = 0; i < s.size(); ++i) {
     23             if(s[i] == '0') {
     24                 zeroes += 1;
     25             }
     26         }
     27         
     28         int ones = (int)(s.size() - zeroes);
     29 
     30         ll sum = 0;
     31 
     32         for(int i = 0; i < s.size(); ++i) {
     33             if(s[i] == '1') {
     34                 if(zeroes >= 1) {
     35                     zeroes -= 1;
     36                     sum += 1;
     37                 } else {
     38                     break;
     39                 }
     40             } else {
     41                 if(ones >= 1) {
     42                     ones -= 1;
     43                     sum += 1;
     44                 } else {
     45                     break;
     46                 }
     47             }
     48         }
     49     
     50         cout << s.size()  -  sum << endl;
     51     }
     52 }