Submission #5989341


Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";else cout<<endl;}
#define ECHO(x) cout<<x<<endl;
#define MEMSET(a, n, x) REP(i, n) a[i]=x;
#define ARRIN(a, n) REP(i, n) cin>>a[i];
#define LL long long
int INF = 2147483647;
LL LINF = 9223372036854775807;
LL MOD = 1000000007;
typedef pair<int, int>P;
typedef pair<LL, LL>PL;
typedef vector<int> vi;
typedef vector<LL> vl;


int main(){
  string s;
  cin>>s;
  string t="";
  REP(i, s.size()){
    if(s[i]!='A') t+=s[i];
  }
  if(t!="KIHBR") {
    cout<<"NO"<<endl;
    return 0;
  }
  else {
    REP(i, s.size()){
      if(s[i]=='K'){
        if(s[i+1]!='I'&&s[i+2]!='H'){
          cout<<"NO"<<endl;
          return 0;
        }

      }
      if(s[i]=='H'){
        if(s[i+1]!='B'&&s[i+2]!='B'){
          cout<<"NO"<<endl;
          return 0;
        }
      }
      if(s[i]=='B'){
        if(s[i+1]!='R'&&s[i+2]!='R'){
          cout<<"NO"<<endl;
          return 0;
        }
      }
    }
    ECHO("YES");
  }

  return 0;
}

Submission Info

Submission Time
Task A - AKIBA
User howahowa
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1323 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 21
WA × 3
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 2 ms 256 KB
01-02.txt AC 2 ms 256 KB
01-03.txt AC 2 ms 256 KB
01-04.txt WA 2 ms 256 KB
01-05.txt AC 2 ms 256 KB
01-06.txt AC 2 ms 256 KB
01-07.txt AC 2 ms 256 KB
01-08.txt WA 2 ms 256 KB
01-09.txt AC 2 ms 256 KB
01-10.txt AC 2 ms 256 KB
01-11.txt WA 2 ms 256 KB
01-12.txt AC 2 ms 256 KB
01-13.txt AC 1 ms 256 KB
01-14.txt AC 1 ms 256 KB
01-15.txt AC 1 ms 256 KB
01-16.txt AC 1 ms 256 KB
01-17.txt AC 1 ms 256 KB
01-18.txt AC 1 ms 256 KB
sample-01.txt AC 2 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB