結果

問題 No.2102 [Cherry Alpha *] Conditional Reflection
ユーザー heno239heno239
提出日時 2022-10-14 21:51:57
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 638 ms / 3,000 ms
コード長 6,621 bytes
コンパイル時間 1,996 ms
コンパイル使用メモリ 158,456 KB
実行使用メモリ 53,720 KB
最終ジャッジ日時 2023-09-08 20:54:23
合計ジャッジ時間 33,775 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 37 ms
35,400 KB
testcase_01 AC 37 ms
35,520 KB
testcase_02 AC 304 ms
45,288 KB
testcase_03 AC 391 ms
46,992 KB
testcase_04 AC 321 ms
45,540 KB
testcase_05 AC 216 ms
42,912 KB
testcase_06 AC 348 ms
46,404 KB
testcase_07 AC 385 ms
41,532 KB
testcase_08 AC 83 ms
39,036 KB
testcase_09 AC 377 ms
44,820 KB
testcase_10 AC 149 ms
40,524 KB
testcase_11 AC 147 ms
39,576 KB
testcase_12 AC 263 ms
43,800 KB
testcase_13 AC 459 ms
47,432 KB
testcase_14 AC 263 ms
44,252 KB
testcase_15 AC 377 ms
47,384 KB
testcase_16 AC 539 ms
50,804 KB
testcase_17 AC 259 ms
39,688 KB
testcase_18 AC 417 ms
42,900 KB
testcase_19 AC 195 ms
41,876 KB
testcase_20 AC 497 ms
48,268 KB
testcase_21 AC 128 ms
41,376 KB
testcase_22 AC 592 ms
51,692 KB
testcase_23 AC 594 ms
51,616 KB
testcase_24 AC 608 ms
51,588 KB
testcase_25 AC 589 ms
51,624 KB
testcase_26 AC 608 ms
51,620 KB
testcase_27 AC 598 ms
51,628 KB
testcase_28 AC 623 ms
51,664 KB
testcase_29 AC 596 ms
51,632 KB
testcase_30 AC 588 ms
51,696 KB
testcase_31 AC 628 ms
51,584 KB
testcase_32 AC 602 ms
51,588 KB
testcase_33 AC 603 ms
51,620 KB
testcase_34 AC 602 ms
51,676 KB
testcase_35 AC 593 ms
51,588 KB
testcase_36 AC 619 ms
51,616 KB
testcase_37 AC 587 ms
51,632 KB
testcase_38 AC 587 ms
51,704 KB
testcase_39 AC 592 ms
51,604 KB
testcase_40 AC 603 ms
51,616 KB
testcase_41 AC 623 ms
51,644 KB
testcase_42 AC 499 ms
45,388 KB
testcase_43 AC 507 ms
45,672 KB
testcase_44 AC 506 ms
45,568 KB
testcase_45 AC 529 ms
45,432 KB
testcase_46 AC 506 ms
45,604 KB
testcase_47 AC 451 ms
41,324 KB
testcase_48 AC 452 ms
41,444 KB
testcase_49 AC 454 ms
41,380 KB
testcase_50 AC 447 ms
41,344 KB
testcase_51 AC 445 ms
41,380 KB
testcase_52 AC 178 ms
36,148 KB
testcase_53 AC 179 ms
36,172 KB
testcase_54 AC 179 ms
36,092 KB
testcase_55 AC 258 ms
36,784 KB
testcase_56 AC 256 ms
36,496 KB
testcase_57 AC 256 ms
36,492 KB
testcase_58 AC 180 ms
36,436 KB
testcase_59 AC 638 ms
53,720 KB
testcase_60 AC 84 ms
38,668 KB
testcase_61 AC 258 ms
36,556 KB
testcase_62 AC 49 ms
35,720 KB
testcase_63 AC 250 ms
39,008 KB
testcase_64 AC 254 ms
39,172 KB
testcase_65 AC 302 ms
39,116 KB
testcase_66 AC 256 ms
36,496 KB
testcase_67 AC 200 ms
41,424 KB
testcase_68 AC 209 ms
36,508 KB
testcase_69 AC 193 ms
41,252 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#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;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.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 -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 21;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

bool isp(int x) {
	if (x == 1)return false;
	for (int i = 2; i * i <= x; i++) {
		if (x % i == 0)return false;
	}
	return true;
}
//1.1*10^9だと2.2*10^9がintでoverflowする
mt19937 mtle(time(0));
uniform_int_distribution<> udle(900000000, 1000000000);
int findmodp() {
	int le = udle(mtle);
	while (!isp(le))le++;
	return le;
}
using ar = array<ll, 2>;

ar ms;
ar ts;

ar rhs[1000005];
void init() {
	rep(i, 2) {
		ms[i] = findmodp();
		ts[i] = findmodp();
		while (ts[i] % ms[i] == 0) {
			ts[i] = findmodp();
		}
		ts[i] %= ms[i];
	}
	rhs[0] = { 1,1 };
	rep(i, 1000004) {
		rep(j, 2) {
			rhs[i + 1][j] = rhs[i][j] * ts[j] % ms[j];
		}
	}
}

ar operator*(ar a, ll v) {
	rep(j, 2) {
		ll adv = v % ms[j];
		if (adv < 0)adv += ms[j];
		a[j] *= adv; a[j] %= ms[j];
	}
	return a;
}
ar operator+(ar a, ar b) {
	rep(j, 2) {
		a[j] += b[j]; if (a[j] >= ms[j])a[j] -= ms[j];
	}
	return a;
}
void solve() {
	int n; cin >> n;
	vector<string> s(n);
	rep(i, n)cin >> s[i];
	set<ar> st;
	rep(i, n) {
		int len = s[i].size();
		ar al = { 0,0 };
		rep(j, len) {
			int v = s[i][j] - 'a' + 1;
			al = al + rhs[j] * v;
		}
		bool exi = false;
		if (st.count(al))exi = true;
		rep(j, len - 1) {
			int v1 = s[i][j] - 'a' + 1;
			int v2 = s[i][j+1] - 'a' + 1;
			ar cur = al;
			cur = cur + rhs[j] * (v2 - v1);
			cur = cur + rhs[j+1] * (v1 - v2);
			if (st.count(cur))exi = true;
		}
		if (exi) {
			cout << "Yes\n";
		}
		else {
			cout << "No\n";
		}
		st.insert(al);
	}
}




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