Submission #1383570

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N;
string S;

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> S;
  rep(i, 2*N) S[i] -= '0';
  int ctr = 0;
  rep(i, 2*N) {
    if (i+1<2*N && S[i] != S[i+1]) {
      i++;
      ctr++;
    }
  }
  cout<<N-ctr<<"\n";
  return 0;
}

Submission Info

Judge Result