Submission #3426880

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int i=0;i<n;i++)
#define why(n,x) int n;while(cin >>n,n!=x)
#define iFOR(i,x,n)for(int i=x;i<n;i++)
#define unless(flg) if ( !(flg) )
#define read cin<<
#define echo cout<<
#define fin <<'\n'
#define __ <<" "<<
#define bash push_back
#define alles(x) x.begin(),x.end()
#define SWAP(a,b) ((a != b) && (a += b,b = a - b,a -= b))
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,-1,1,-1,1};
const int INF=1 << 30;
bool inside(int x,int y,int w,int h){
  return (x>=0 && y>=0 && x<w && y<h);}
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vit;
typedef map<string,int> mstit;
typedef priority_queue<int> pqit;





int main(){
  cin.tie(0), ios::sync_with_stdio(false);
  string str;
  cin >>str;
  int a=0,siz=str.length();
  int b=0,w=0,bl=0,wh=0; 
  iFOR( i,1,siz){
    if(str[i-1]!=str[i]) {
      if(str[i]=='B') b++;else w++;
      a++;
    }
    if(str[siz-i]!=str[siz-i+1]){
      if(str[i]=='B') bl++;else wh++;
      b++; 
    }
  }
  cout <<a fin;

  return 0;
}

Submission Info

Judge Result