結果

問題 No.380 悪の台本
ユーザー kei
提出日時 2018-11-30 17:06:24
言語 C++14
(gcc 8.3.0)
結果
AC  
実行時間 131 ms
コード長 3,073 Byte
コンパイル時間 1,302 ms
使用メモリ 1,680 KB
最終ジャッジ日時 2019-10-19 11:35:02

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
challenge01.txt AC 3 ms
1,512 KB
hand AC 3 ms
1,528 KB
sample1 AC 3 ms
1,524 KB
sample2 AC 3 ms
1,524 KB
test1 AC 7 ms
1,536 KB
test2 AC 16 ms
1,520 KB
test3 AC 15 ms
1,524 KB
test4 AC 131 ms
1,516 KB
test5 AC 4 ms
1,680 KB
test6 AC 9 ms
1,536 KB
テストケース一括ダウンロード

ソースコード

diff #
#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;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:https://yukicoder.me/problems/no/380>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    string str;
    while(getline(cin,str)){
        for(int i = 0; i < 3;i++){
            if(str.empty() || isalnum(str.back())) break;
            str = str.substr(0,str.length()-1);
        }
        bool ok = false;
        [&](){
            if(str.find("digi") == 0){
                str = str.substr(4);
                if(str.empty() || str.front() != ' ') return;
                for(auto& c:str) c = tolower(c);
                ok = str.rfind("nyo") == str.length()-3;
            }else if(str.find("petit") == 0){
                str = str.substr(5);
                if(str.empty() || str.front() != ' ') return;
                for(auto& c:str) c = tolower(c);
                ok = str.rfind("nyu") == str.length()-3;
            }else if(str.find("rabi") == 0){
                str = str.substr(4);
                if(str.empty() || str.front() != ' ') return;
                for(auto& c:str) c = tolower(c);
                for(auto c:str) ok |= isalnum(c);
            }else if(str.find("gema") == 0){
                str = str.substr(4);
                if(str.empty() || str.front() != ' ') return;
                for(auto& c:str) c = tolower(c);
                ok = str.rfind("gema") == str.length()-4;
            }else if(str.find("piyo") == 0){
                str = str.substr(4);
                if(str.empty() || str.front() != ' ') return;
                for(auto& c:str) c = tolower(c);
                ok = str.rfind("pyo") == str.length()-3;
            }
        }();
        if(ok){
            cout << "CORRECT (maybe)" << endl;
        }else{
            cout << "WRONG!" << endl;
        }
    }
    return 0;
}
0