Submission #1833115


Source Code Expand

#include <bits/stdc++.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)

typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,P> PP;

struct edge {
	int to,cost;
	edge(int t,ll c):to(t),cost(c) {}
};

int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int ddx[]={1,1,1,0,-1,-1,-1,0},ddy[]={1,0,-1,-1,-1,0,1,1};

ll mypow(ll x,ll n,ll m) {
	if(n==0) return 1;
	if(n%2==0) return mypow(x*x%m,n/2,m);
	else return x*mypow(x,n-1,m)%m;
}

//-----------------------------------------------------------------------------

string s;
deque<int> dq;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>s;
	int last=-1;
	REP(i,s.size()) {
		int now=(s[i]=='W'?0:1);
		if(now==last) continue;
		last=now;
		dq.pb(now);
	}
	int sz=dq.size();
	if(dq.front()==0) sz--;
	if(dq.back()==0) sz--;
	cout<<(sz>0?sz:0)<<endl;

	return 0;
}

Submission Info

Submission Time
Task C - 1D Reversi
User moko_freedom
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1181 Byte
Status WA
Exec Time 2 ms
Memory 720 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 9
WA × 6
Set Name Test Cases
sample sample_01.txt, sample_02.txt, sample_03.txt
All alternate_01.txt, alternate_02.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, same_01.txt, same_02.txt, sample_01.txt, sample_02.txt, sample_03.txt, small_01.txt, small_02.txt, small_03.txt
Case Name Status Exec Time Memory
alternate_01.txt AC 2 ms 720 KB
alternate_02.txt AC 2 ms 720 KB
random_01.txt AC 2 ms 592 KB
random_02.txt WA 2 ms 592 KB
random_03.txt WA 2 ms 592 KB
random_04.txt WA 2 ms 512 KB
random_05.txt WA 2 ms 512 KB
same_01.txt WA 2 ms 512 KB
same_02.txt AC 2 ms 512 KB
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
small_01.txt AC 1 ms 256 KB
small_02.txt AC 1 ms 256 KB
small_03.txt WA 1 ms 256 KB