Submission #2637014

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

int solve(string& s){
    int N = s.size();
    int ch = 0;
    for (int i=1; i<N; ++i) {
        if (s[i] != s[i-1]) ++ch;
    }
    return ch;
}

int main() {
    string s; cin >> s;
    cout << solve(s) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 一次元リバーシ / 1D Reversi
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1320 Byte
Status
Exec Time 4 ms
Memory 512 KB

Test Cases

Set Name Score / Max Score Test Cases
sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 300 / 300 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 4 ms 512 KB
alternate_02.txt 4 ms 512 KB
random_01.txt 4 ms 512 KB
random_02.txt 4 ms 512 KB
random_03.txt 4 ms 512 KB
random_04.txt 4 ms 512 KB
random_05.txt 4 ms 512 KB
same_01.txt 4 ms 512 KB
same_02.txt 4 ms 512 KB
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB
small_01.txt 1 ms 256 KB
small_02.txt 1 ms 256 KB
small_03.txt 1 ms 256 KB