Submission #2507737


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define che
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define MP make_pair
#define PB push_back
#define fi first
#define se second
#define HALT {printf("NO\n"); exit(0);}
typedef long long LL;
typedef pair<int, int> PII;
const int N= 500 +10;


string s, tar="AKIHABARA";

bool dfs(string cur, int insa){
	if( insa==0) return cur==tar;
	bool flag= false;
	for (int i=0; i<=cur.size(); i++){
		string nx= cur;
		nx.replace(i,0,"A");
		flag |= dfs(nx, insa-1);
	}
	return flag;
}
int main(){

	cin>>s;
	int cnta=0;
	for (int i=0; i<s.size(); i++) cnta+= s[i]=='A';
	int insa=4-cnta;
	if ( insa<0) HALT;
	bool ok=dfs(s,insa);
	if ( ok) printf("YES\n");
		else printf("NO\n");
	return 0;
}

Submission Info

Submission Time
Task A - AKIBA
User jijorbq
Language C++14 (GCC 5.4.1)
Score 300
Code Size 773 Byte
Status AC
Exec Time 600 ms
Memory 256 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 24
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 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt AC 1 ms 256 KB
01-11.txt AC 1 ms 256 KB
01-12.txt AC 1 ms 256 KB
01-13.txt AC 1 ms 256 KB
01-14.txt AC 1 ms 256 KB
01-15.txt AC 2 ms 256 KB
01-16.txt AC 1 ms 256 KB
01-17.txt AC 1 ms 256 KB
01-18.txt AC 600 ms 256 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