Submission #2978511
Source Code Expand
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <set>
#include <complex>
#include <utility>
#include <numeric>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define VI vector<int>
#define VS vector<string>
#define all(a) (a).begin(),(a).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef long long int ll;
typedef string::const_iterator State;
typedef pair<int,int> P;
class ParseError {};
const ll INF=1LL<<50;
char fi[101][101];
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
double EPS = 1e-14;
const int MAX_V=100;
const int MAX_N=100;
char o[3]={'+','-','*'};
#define md 1000003
int bow[353][353]={0};
double add(double a,double b){
if(abs(a+b)<EPS*(abs(a)+abs(b)))
return 0;
return a+b;
}
/*struct P{
double x,y;
P(){}
P(double x,double y):x(x),y(y){
}
P operator + (P p){
return P(add(x,p.x),add(y,p.y));
}
P operator - (P p){
return P(add(x,-p.x),add(y,-p.y));
}
P operator *(double d){
return P(x*d,y*d);
}
double dot(P p){
return add(x*p.x,y*p.y);
}
double det(P p){
return add(x*p.y,-y*p.x);
}
};
bool cmp_x(const P& p,const P& q){
if(p.x!=q.x) return p.x<q.x;
return p.y<q.y;
}
vector<P> convex_hull(P* ps, int n){
sort(ps,ps+n,cmp_x);
int k=0;
vector<P> qs(n*2);
rep(i,n){
while(k>1&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
for(int i=n-2,t=k;i>=0;i--){
while(k>t&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
qs.resize(k-1);
return qs;
}
int n,m;
vector<double> p;
P ps[101];
*/
//char c[520][520];
long long mod=1000000007;
long long pow(ll i,ll j){
ll tmp=1;
while(j){
if(j%2) tmp=tmp*i%mod;
i=i*i%mod;
j/=2;
}
return tmp;
}
int expression(State&);
int term(State&);
int factor(State&);
int number(State&);
int expression(State &begin){
int ret = term(begin);
for(;;){
if(*begin == '+'){
begin++;
ret += term(begin);
}
else if(*begin == '-'){
begin++;
ret -= term(begin);
}
else
break;
}
return ret;
}
int term(State &begin){
int ret = factor(begin);
for(;;){
if(*begin=='*'){
begin++;
ret *= factor(begin);
}
else if(*begin=='/'){
begin++;
ret /= factor(begin);
}
else
break;
}
return ret;
}
int factor(State &begin){
int ret;
if(*begin == '('){
begin++;
ret = expression(begin);
begin++;
}
else
ret = number(begin);
return ret;
}
int number(State &begin){
int ret =0;
while(isdigit(*begin)){
ret*=10;
ret+=*begin - '0';
begin++;
}
return ret;
}
/*int inf=1e9;
struct edge{ll to;
ll cost;};
typedef pair<ll,ll> T;
int V;
vector<edge> G[100000];
bool used[100000];
ll prim(){
priority_queue<T,vector<T>, greater<T> > que;
fill(used,used+V,false);
ll res=0;
que.push(T(0,0));
while(!que.empty()){
T t = que.top();
que.pop();
int v=t.second;
if(used[v])
continue;
used[v]=true;
res+=t.first;
for(int i=0;i<G[v].size();i++){
que.push(T(G[v][i].cost,G[v][i].to));
}
}
return res;
}
*/
int gcd(int a,int b){
if(!b) return a;
return gcd(b,a%b);
}
struct edge {int from, to, cost;};
int n,m;
int s[13]={0};
int d[13][13]={0};
void warshall_floyd(){
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
}
int main(void){
string s;
cin>>s;
int count=0;
char c=s[0];
for(int i=1;i<s.size();i++){
if(c!=s[i]){
count++;
c=s[i];
}
}
cout<<count<<endl;
}
Submission Info
Submission Time |
|
Task |
C - 1D Reversi |
User |
yata |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
4112 Byte |
Status |
AC |
Exec Time |
5 ms |
Memory |
512 KB |
Judge Result
Set Name |
sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
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 |
4 ms |
512 KB |
alternate_02.txt |
AC |
4 ms |
512 KB |
random_01.txt |
AC |
5 ms |
512 KB |
random_02.txt |
AC |
5 ms |
512 KB |
random_03.txt |
AC |
5 ms |
512 KB |
random_04.txt |
AC |
5 ms |
512 KB |
random_05.txt |
AC |
4 ms |
512 KB |
same_01.txt |
AC |
4 ms |
512 KB |
same_02.txt |
AC |
4 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 |
AC |
1 ms |
256 KB |