結果

問題 No.233 めぐるはめぐる (3)
ユーザー maimai
提出日時 2018-01-22 18:09:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 73 ms / 1,000 ms
コード長 4,990 bytes
コンパイル時間 3,585 ms
コンパイル使用メモリ 225,708 KB
実行使用メモリ 12,772 KB
最終ジャッジ日時 2024-06-07 17:22:27
合計ジャッジ時間 5,962 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
12,772 KB
testcase_01 AC 58 ms
12,640 KB
testcase_02 AC 46 ms
12,644 KB
testcase_03 AC 58 ms
12,768 KB
testcase_04 AC 71 ms
12,768 KB
testcase_05 AC 70 ms
12,636 KB
testcase_06 AC 71 ms
12,636 KB
testcase_07 AC 73 ms
12,768 KB
testcase_08 AC 71 ms
12,764 KB
testcase_09 AC 40 ms
12,640 KB
testcase_10 AC 38 ms
12,764 KB
testcase_11 AC 40 ms
12,640 KB
testcase_12 AC 68 ms
12,768 KB
testcase_13 AC 69 ms
12,640 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
    };
}
MaiScanner scanner;
MaiPrinter printer;




unordered_set<string> dic;

string lis_c = "bgmnr";
string lis_b = "aaeiuu";

void assign(string selector) {
    do {
        do {
            string s = selector;
            int i;
            i = 0;
            for (char b : lis_b) {
                while (s[i] != 'o') ++i;
                s[i] = b;
            }
            i = 0;
            for (char c : lis_c) {
                while (s[i] != 'x') ++i;
                s[i] = c;
            }
            dic.insert(s);
        } while (next_permutation(ALL(lis_c)));
    } while (next_permutation(ALL(lis_b)));
}

ll m, n, kei;

int main() {
    
    assign("oxoxoxoxoxo");
    assign("xooxoxoxoxo");
    assign("xoxooxoxoxo");
    assign("xoxoxooxoxo");
    assign("xoxoxoxooxo");
    assign("xoxoxoxoxoo");

    scanner >> n;

    repeat(i, n) {
        string s;
        scanner >> s;
        dic.erase(s);
    }

    if (dic.size() == 0) {
        cout << "NO" << endl;
    }
    else {
        cout << *(dic.begin()) << endl;
    }

    return 0;
}
0