Submission #2247314


Source Code Expand

#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef pair <int,ll> pii;
typedef vector<int> vi;
ll ans;
set<string> cand;
string s,s2="AKIHABARA";
int main(void)
{
  cin >> s;
  cand.insert("AKIHABARA");
  for(int i=0;i<(1<<9);i++)
    {
      for(int k=0;k<9;k++)
	{
	  if(((i >> k) & 1) && s2[k]=='A')
	    {
	      s2.erase(s2.begin()+k);
	      cand.insert(s2);
	    }
	}
      s2="AKIHABARA";
    }
  for(auto i=cand.begin();i!=cand.end();i++)
    {
      if(s==*i)
	{
	  cout << "YES" << endl;
	  return 0;
	}
    }
  cout << "NO" << endl;
  return 0;
}


Submission Info

Submission Time
Task A - AKIBA
User Tendaysago
Language C++14 (GCC 5.4.1)
Score 300
Code Size 770 Byte
Status AC
Exec Time 1 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 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 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB