Submission #582904

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for(int (i) = 0; (i) < (int)(n); ++(i))
#define rep1(i, n) for(int (i) = 1; (i) <= (int)(n); ++(i))
#define rrep(i, n) for(int (i) = (n) - 1; (i) >= 0; --(i))
#define all(a) (a).begin(),(a).end()
#define PB push_back
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<double>> vvd;
// typedef pair<int, int> P;
const int INF = 0x7fffffff;
const ll divisor = 1000000007;

int main(){
  int N;
  string S;
  cin >> N >> S;
  int shari = 0;
  int neta = 0;
  int ans = 0;
  rep(i, 2 * N - 1){
    if(S[i] != S[i + 1]){
      i++; continue;
    }
    
    if(S[i] == '0' && shari > 0) shari--;
    else if(S[i] == '1' && neta > 0) neta--;
    else{
      (S[i] == '0' ? neta : shari)++;
      ans++;
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result