結果

問題 No.233 めぐるはめぐる (3)
ユーザー heno239heno239
提出日時 2020-08-18 21:05:48
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 194 ms / 1,000 ms
コード長 4,057 bytes
コンパイル時間 1,869 ms
コンパイル使用メモリ 126,812 KB
実行使用メモリ 77,836 KB
最終ジャッジ日時 2023-08-02 08:16:52
合計ジャッジ時間 6,365 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 190 ms
77,316 KB
testcase_01 AC 174 ms
76,456 KB
testcase_02 AC 158 ms
74,492 KB
testcase_03 AC 177 ms
75,844 KB
testcase_04 AC 193 ms
77,292 KB
testcase_05 AC 194 ms
77,728 KB
testcase_06 AC 193 ms
77,804 KB
testcase_07 AC 110 ms
77,028 KB
testcase_08 AC 110 ms
77,836 KB
testcase_09 AC 141 ms
74,116 KB
testcase_10 AC 141 ms
72,980 KB
testcase_11 AC 141 ms
73,256 KB
testcase_12 AC 172 ms
76,232 KB
testcase_13 AC 192 ms
77,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod/300;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 22;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

bool isb(char c) {
	return c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o';
}

void solve() {
	int n; cin >> n;
	vector<string> s(n);
	vector<string> al;
	string t = "inabameguru";
	vector<int> alf(26,0);
	for (char c : t)alf[c - 'a']++;
	
	string cur;
	function<void(vector<int>,bool)>dfs = [&](vector<int>c,bool f) {
		//cout << cur << "\n";
		if (cur.size()==11) {
			reverse(all(cur));
			al.push_back(cur);
			reverse(all(cur));
			return;
		}
		if (f) {
			rep(i, c.size()) {
				if (!isb('a' + i))continue;
				if (c[i] > 0) {
					cur.push_back('a' + i);
					c[i]--;
					dfs(c, false);
					cur.pop_back();
					c[i]++;
				}
			}
		}
		else {
			bool b = isb(cur.back());
			rep(i, c.size()) {
				if (c[i] > 0) {
					bool nb = isb(i + 'a');
					if (!b && !nb)continue;
					cur.push_back('a' + i);
					c[i]--;
					dfs(c, false);
					cur.pop_back();
					c[i]++;
				}
			}
		}
	};
	dfs(alf, true);
	//cout << "? " << al.size() << "\n";
	rep(i, n)cin >> s[i];
	if (s.size() == al.size()) {
		cout << "NO\n";
	}
	else {
		sort(all(s));
		sort(all(al));
		rep(i, s.size()) {
			if (s[i] != al[i]) {
				cout << al[i] << "\n"; return;
			}
		}
		cout << al[s.size()] << "\n";
	}
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	//while (cin >> n >> m>>s1>>s2>>t, n)
		solve();
	return 0;
}
0