Submission #5861889

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <algorithm>
#include <sstream>
#include <istream>

using namespace std;

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

int main(){
	string s;
	cin >> s;
	bool ok = true;
	for(int i=0;i<s.length();i++){
		if(s[i]!='A'&&s[i]!='K'&&s[i]!='I'&&s[i]!='H'&&s[i]!='B'&&s[i]!='R'){
			ok = false;
		} 
	}
	int K = -1;
	int I = -1;
	int H = -1;
	int B = -1;
	int R = -1;
	if(ok){
		
	for(int i=0;i<s.length();i++){
		if(s[i]=='K') K = i;
		if(s[i]=='I') I = i;
		if(s[i]=='H') H = i;
		if(s[i]=='B') B = i;
		if(s[i]=='R') R = i;
	}
	if(K<I&&I<H&&H<B&&B<R){
		if(K>1) ok = false;
		if(I>2) ok = false;
		if(H>3) ok = false;
		if(B>5) ok = false;
		if(R>7) ok = false;
	}else{
		ok = false;
	}
	}
	if(ok){
		cout << "YES" << endl;
	}else{
		cout << "NO" << endl;
	}
	return 0;
}

Submission Info

Judge Result