Submission #2097609
Source Code Expand
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; /* <url:https://cf17-final-open.contest.atcoder.jp/tasks/cf17_final_a> 問題文============================================================ 文字列 S が与えられます。 高橋君はこの文字列の好きな位置に好きなだけ文字 A を挿入することができます。 S を AKIHABARA に変えることはできるでしょうか? ================================================================= 解説============================================================= あらかじめ、あり得る状態の文字列の集合を用意しておき、 入力文字がその集合に含まれるか確認すれば良い ================================================================ */ set<string> s; void init(string akiba){ s.insert(akiba); for(int i = 0; i < (int)akiba.size();i++){ if(akiba[i] == 'A'){ init(akiba.substr(0,i) + akiba.substr(i+1)); } } } int main(void) { cin.tie(0); ios::sync_with_stdio(false); string S; cin >> S; init("AKIHABARA"); if(s.find(S) != s.end()){ cout << "YES" << endl; }else{ cout << "NO" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AKIBA |
User | vjudge5 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1321 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 |