AtCoder Beginner Contest 002

Submission #7132314

Source codeソースコード

#ifndef ENV_AC
    #define ENV_AC
    #include <stdio.h>
    #include <stdlib.h>
    #include <assert.h>
    #include <fstream>
    #include <iostream>
    #include <sstream>
    #include <iomanip>
    #include <algorithm>
    #include <bitset>
    #include <array>
    #include <vector>
    #include <queue>
    #include <set>
    #include <cmath> // 変数名にy1が使えなくなるかも…。
    #include <map>
    #include <unordered_map>
    #include <unordered_set>
    #include <limits>
    #include <functional>
    #include <string>
    #include <ext/rope>

    using int128_t = __int128_t;
    std::istream &operator>>(std::istream& input, int128_t& value) { // int128_tの入力。入力が64bitに収まる前提。
        int64_t tmp; input >> tmp; value = tmp;
        return input;
    }
    std::ostream &operator<<(std::ostream& output, const int128_t value) { // int128_tの出力。出力が64bitに収まる前提。
        output << (int64_t)value;
        return output;
    }

    namespace std {
        template<> class hash<int128_t>{
            public:
            size_t operator () ( const int128_t &x ) const {
                int64_t INF64 = std::numeric_limits<int64_t>::max();
                int64_t y1 = x / INF64;
                int64_t y2 = x % INF64;
                return hash<int64_t>()(y1) ^ hash<int64_t>()(y2);
            }
        };
    }

    int128_t imax(const int128_t a, const int128_t b) { return std::max(a, b); } // std::max, std::min は型が違うとエラーになるため、ラッパーを作る。
    int128_t imin(const int128_t a, const int128_t b) { return std::min(a, b); }
    int128_t iabs(const int128_t x) { return 0 <= x ? x : -x; }
    int128_t ipow(const int128_t x, const int128_t n) { int128_t ret = 1; for (int i = 0; i < n; i++) { ret *= x; } return ret; }

    #define rep(i, begin, end) for(int64_t i = ((int64_t)begin); i <= ((int64_t)end); i++) // (int64_t)end としておくと、end = v.size() - 2 みたいな入力で、v.size()が1でも正常(end = -1になる)に挙動する。
    #define rev(i, begin, end) for(int64_t i = ((int64_t)begin); ((int64_t)end) <= i; i--) // int128_tにすると、3重ループでコンパイルエラーになったのでint64_tにしておく。

    #define input1(begin, end, v1) v1.resize((end)+1); for (int i = (begin); i <= (end); i++) { std::cin >> v1[i]; }
    #define input2(begin, end, v1, v2) v1.resize((end)+1); v2.resize((end)+1); for (int i = (begin); i <= (end); i++) { std::cin >> v1[i] >> v2[i]; } 
    #define input3(begin, end, v1, v2, v3) v1.resize((end)+1); v2.resize((end)+1); v3.resize((end)+1); for (int i = (begin); i <= (end); i++) { std::cin >> v1[i] >> v2[i] >> v3[i]; }
    #define input4(begin, end, v1, v2, v3, v4) v1.resize((end)+1); v2.resize((end)+1); v3.resize((end)+1); v4.resize((end)+1); for (int i = (begin); i <= (end); i++) { std::cin >> v1[i] >> v2[i] >> v3[i] >> v4[i]; } 
    #define input5(begin, end, v1, v2, v3, v4, v5) v1.resize((end)+1); v2.resize((end)+1); v3.resize((end)+1); v4.resize((end)+1); v5.resize((end)+1); for (int i = (begin); i <= (end); i++) { std::cin >> v1[i] >> v2[i] >> v3[i] >> v4[i] >> v5[i]; }  
    // input_arrayはbegin = 0のときのみ動作確認。Aの要素の型をテンプレートにして関数にしたほうが丁寧かもしれない。
    #define input_array(begin, N, M, A) A.resize((begin)+(N)); for (int i = 0; i < (begin)+(N); i++) { A[i].resize((begin)+(M)); } for (int i = begin; i < (begin)+(N); i++) { for (int j = begin; j < (begin)+(M); j++) { std::cin >> A[i][j]; }}

    std::vector<int> irange(const int begin, const int end) {
        std::vector<int> ret; for (int i = begin; i <= end; i++) { ret.push_back(i); }
        return ret;
    }

    template <typename T>
    std::vector<T> accumulate_vec(const std::vector<T>& vec, const bool reverse = false) {
        std::vector<T> ret; ret.resize(vec.size());
        if (reverse == false) {
            ret[0] = vec[0];
            for (int i = 1; i < ret.size(); i++) {
                ret[i] = ret[i-1] + vec[i];
            }
        } else {
            ret[ret.size()-1] = vec[ret.size()-1];
            for (int i = ret.size() - 2; 0 <= i; i--) {
                ret[i] = ret[i+1] + vec[i];
            }
        }
        return ret;
    }

    template <typename T>
    void printvec(const std::vector<T>& vec) {
        for (int i = 0; i < vec.size(); i++) { std::cout << vec[i] << " "; } std::cout << std::endl;
    }
#endif




//--code begin--

//int128_t N, K;
//std::vector<int128_t> A;
std::string W, X;
//std::vector<std::string> ;
//double ;
//std::vector<double> ;

//const int128_t MAX_N = 2010;
//const int128_t MOD = 1e9 + 7;
//const int128_t INF = std::numeric_limits<int64_t>::max(); const int128_t NEG_INF = std::numeric_limits<int64_t>::min();
//using pair = std::pair<int64_t, int>;

int main(int argc, char **argv) {
    std::cin.tie(0);
   	std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(15);
    std::cin >> W;

    __gnu_cxx::rope<char> Y;

    rep (i, 0, W.size() - 1) {
        if (W[i] == 'a' || W[i] == 'i' || W[i] == 'u' || W[i] == 'e' || W[i] == 'o') { continue; }
        X.push_back(W[i]);
    }

    std::cout << X << std::endl;

    return 0;
}

Submission

Task問題 B - 罠
User nameユーザ名 moku
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 5432 Byte
File nameファイル名
Exec time実行時間 1 ms
Memory usageメモリ使用量 256 KB

Test case

Set

Set name Score得点 / Max score Cases
all 100 / 100 00_sample_01.txt,00_sample_02.txt,00_sample_03.txt,00_sample_04.txt,test_aaaaaaaaaaaaaaaaaaaaaaaaaapaaa.txt,test_abcdefghijklmnopqrstuvwxyz.txt,test_aeuuoeuuooaoikuaouoo.txt,test_aieeuoaoaeioeierrtwmmdkjylcbbj.txt,test_aioeunu.txt,test_aqahahuqugironiyog.txt,test_ay.txt,test_c.txt,test_cizuci.txt,test_clrhrnbnxmhvvrykgpvsjpylvns.txt,test_clwxebedrzlfbey.txt,test_dfiousakzbw.txt,test_di.txt,test_eeeeeleeeeeeeeeeeeeeeeeeeeeeee.txt,test_eugfblf.txt,test_faumfxzsfpgz.txt,test_glpfsryzkcgbkmytzz.txt,test_hzkx.txt,test_iiiiiiiiiiiiiiiiiiiitiiiiiiiii.txt,test_iyenewigoronadomeni.txt,test_joda.txt,test_k.txt,test_kjjxmvpdpcbthjhqqqnsvmvxbtz.txt,test_klaimqrlgrxzgsqkenng.txt,test_mgjpfrkthffctppiueeeouiioeieoa.txt,test_mhfrnzpxkmxjzvmqhwxg.txt,test_mm.txt,test_mvgvrpyghdszgfvznv.txt,test_nu.txt,test_oaiiioieoeiieiuooiueaouuuiw.txt,test_oaqii.txt,test_oit.txt,test_omimujomevadimadom.txt,test_oooooooooolooooooooooooooooooo.txt,test_ooqo.txt,test_ouioiaeiuaoaeiieuuiooeeqo.txt,test_ow.txt,test_pifofawezojisasotuj.txt,test_pn.txt,test_qgqsghgjczftdmvdtrztjdwhcds.txt,test_rxifvbybdsqasoyjdskqwhlstx.txt,test_s.txt,test_taroakpyzmgkbhtklwfbk.txt,test_tkttwgnpjlrkcmwkkcfkjtyb.txt,test_uauoyouaaeoaoeooa.txt,test_uphtuhurtdkmcidxfjtgqtdujblvht.txt,test_uqzghmkf.txt,test_usetumukiwukugekidefupalumimec.txt,test_uueeuoeuviuiieuioeeauuuieeuiee.txt,test_uuueueouaouuiuniaoaaeuaoaa.txt,test_uuuuuuuujuuuuuuuuuuuuuuuuuuuuu.txt,test_vokicozoyatekebagajiceb.txt,test_xlsphqfmqrtrtvmpvbgnkr.txt,test_yepelilemapakonarugupabepisoha.txt,test_zkkyzwjgzmddvqtvvrcqhsrqlmqmkr.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
test_aaaaaaaaaaaaaaaaaaaaaaaaaapaaa.txt AC 1 ms 256 KB
test_abcdefghijklmnopqrstuvwxyz.txt AC 1 ms 256 KB
test_aeuuoeuuooaoikuaouoo.txt AC 1 ms 256 KB
test_aieeuoaoaeioeierrtwmmdkjylcbbj.txt AC 1 ms 256 KB
test_aioeunu.txt AC 1 ms 256 KB
test_aqahahuqugironiyog.txt AC 1 ms 256 KB
test_ay.txt AC 1 ms 256 KB
test_c.txt AC 1 ms 256 KB
test_cizuci.txt AC 1 ms 256 KB
test_clrhrnbnxmhvvrykgpvsjpylvns.txt AC 1 ms 256 KB
test_clwxebedrzlfbey.txt AC 1 ms 256 KB
test_dfiousakzbw.txt AC 1 ms 256 KB
test_di.txt AC 1 ms 256 KB
test_eeeeeleeeeeeeeeeeeeeeeeeeeeeee.txt AC 1 ms 256 KB
test_eugfblf.txt AC 1 ms 256 KB
test_faumfxzsfpgz.txt AC 1 ms 256 KB
test_glpfsryzkcgbkmytzz.txt AC 1 ms 256 KB
test_hzkx.txt AC 1 ms 256 KB
test_iiiiiiiiiiiiiiiiiiiitiiiiiiiii.txt AC 1 ms 256 KB
test_iyenewigoronadomeni.txt AC 1 ms 256 KB
test_joda.txt AC 1 ms 256 KB
test_k.txt AC 1 ms 256 KB
test_kjjxmvpdpcbthjhqqqnsvmvxbtz.txt AC 1 ms 256 KB
test_klaimqrlgrxzgsqkenng.txt AC 1 ms 256 KB
test_mgjpfrkthffctppiueeeouiioeieoa.txt AC 1 ms 256 KB
test_mhfrnzpxkmxjzvmqhwxg.txt AC 1 ms 256 KB
test_mm.txt AC 1 ms 256 KB
test_mvgvrpyghdszgfvznv.txt AC 1 ms 256 KB
test_nu.txt AC 1 ms 256 KB
test_oaiiioieoeiieiuooiueaouuuiw.txt AC 1 ms 256 KB
test_oaqii.txt AC 1 ms 256 KB
test_oit.txt AC 1 ms 256 KB
test_omimujomevadimadom.txt AC 1 ms 256 KB
test_oooooooooolooooooooooooooooooo.txt AC 1 ms 256 KB
test_ooqo.txt AC 1 ms 256 KB
test_ouioiaeiuaoaeiieuuiooeeqo.txt AC 1 ms 256 KB
test_ow.txt AC 1 ms 256 KB
test_pifofawezojisasotuj.txt AC 1 ms 256 KB
test_pn.txt AC 1 ms 256 KB
test_qgqsghgjczftdmvdtrztjdwhcds.txt AC 1 ms 256 KB
test_rxifvbybdsqasoyjdskqwhlstx.txt AC 1 ms 256 KB
test_s.txt AC 1 ms 256 KB
test_taroakpyzmgkbhtklwfbk.txt AC 1 ms 256 KB
test_tkttwgnpjlrkcmwkkcfkjtyb.txt AC 1 ms 256 KB
test_uauoyouaaeoaoeooa.txt AC 1 ms 256 KB
test_uphtuhurtdkmcidxfjtgqtdujblvht.txt AC 1 ms 256 KB
test_uqzghmkf.txt AC 1 ms 256 KB
test_usetumukiwukugekidefupalumimec.txt AC 1 ms 256 KB
test_uueeuoeuviuiieuioeeauuuieeuiee.txt AC 1 ms 256 KB
test_uuueueouaouuiuniaoaaeuaoaa.txt AC 1 ms 256 KB
test_uuuuuuuujuuuuuuuuuuuuuuuuuuuuu.txt AC 1 ms 256 KB
test_vokicozoyatekebagajiceb.txt AC 1 ms 256 KB
test_xlsphqfmqrtrtvmpvbgnkr.txt AC 1 ms 256 KB
test_yepelilemapakonarugupabepisoha.txt AC 1 ms 256 KB
test_zkkyzwjgzmddvqtvvrcqhsrqlmqmkr.txt AC 1 ms 256 KB