#807269 (C++17) No.2102 [Cherry Alpha *] Conditional Reflection

提出ソース

結果

問題	No.2102 [Cherry Alpha *] Conditional Reflection
ユーザー	FF256grhy
提出日時	2022-10-14 22:59:40
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,263 ms / 3,000 ms
コード長	8,304 bytes
コンパイル時間	3,524 ms
コンパイル使用メモリ	214,608 KB
実行使用メモリ	68,404 KB
最終ジャッジ日時	2023-09-08 23:23:33
合計ジャッジ時間	49,030 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	19 ms 49,600 KB
testcase_01	AC	18 ms 49,628 KB
testcase_02	AC	484 ms 58,244 KB
testcase_03	AC	573 ms 61,012 KB
testcase_04	AC	523 ms 58,084 KB
testcase_05	AC	380 ms 54,324 KB
testcase_06	AC	543 ms 58,580 KB
testcase_07	AC	395 ms 54,960 KB
testcase_08	AC	210 ms 50,388 KB
testcase_09	AC	507 ms 59,740 KB
testcase_10	AC	265 ms 52,956 KB
testcase_11	AC	194 ms 54,332 KB
testcase_12	AC	421 ms 57,504 KB
testcase_13	AC	712 ms 62,012 KB
testcase_14	AC	433 ms 55,992 KB
testcase_15	AC	620 ms 58,940 KB
testcase_16	AC	807 ms 64,052 KB
testcase_17	AC	280 ms 53,772 KB
testcase_18	AC	521 ms 57,492 KB
testcase_19	AC	316 ms 54,852 KB
testcase_20	AC	842 ms 62,692 KB
testcase_21	AC	349 ms 50,956 KB
testcase_22	AC	949 ms 65,412 KB
testcase_23	AC	919 ms 65,424 KB
testcase_24	AC	952 ms 65,480 KB
testcase_25	AC	912 ms 65,448 KB
testcase_26	AC	945 ms 65,328 KB
testcase_27	AC	1,003 ms 65,536 KB
testcase_28	AC	918 ms 65,520 KB
testcase_29	AC	942 ms 65,292 KB
testcase_30	AC	945 ms 65,292 KB
testcase_31	AC	968 ms 65,420 KB
testcase_32	AC	964 ms 65,292 KB
testcase_33	AC	973 ms 65,352 KB
testcase_34	AC	956 ms 65,400 KB
testcase_35	AC	961 ms 65,356 KB
testcase_36	AC	951 ms 65,540 KB
testcase_37	AC	980 ms 65,408 KB
testcase_38	AC	975 ms 65,424 KB
testcase_39	AC	978 ms 65,408 KB
testcase_40	AC	993 ms 65,328 KB
testcase_41	AC	1,114 ms 65,412 KB
testcase_42	AC	911 ms 60,352 KB
testcase_43	AC	813 ms 60,260 KB
testcase_44	AC	850 ms 60,408 KB
testcase_45	AC	817 ms 60,312 KB
testcase_46	AC	819 ms 60,404 KB
testcase_47	AC	599 ms 56,080 KB
testcase_48	AC	653 ms 56,184 KB
testcase_49	AC	647 ms 56,176 KB
testcase_50	AC	631 ms 56,188 KB
testcase_51	AC	622 ms 56,108 KB
testcase_52	AC	47 ms 51,824 KB
testcase_53	AC	48 ms 51,828 KB
testcase_54	AC	47 ms 52,032 KB
testcase_55	AC	299 ms 49,984 KB
testcase_56	AC	299 ms 50,008 KB
testcase_57	AC	300 ms 50,020 KB
testcase_58	AC	160 ms 51,472 KB
testcase_59	AC	1,263 ms 68,404 KB
testcase_60	AC	190 ms 49,732 KB
testcase_61	AC	302 ms 50,016 KB
testcase_62	AC	34 ms 50,392 KB
testcase_63	AC	134 ms 49,732 KB
testcase_64	AC	131 ms 49,628 KB
testcase_65	AC	140 ms 50,108 KB
testcase_66	AC	281 ms 50,164 KB
testcase_67	AC	348 ms 49,516 KB
testcase_68	AC	228 ms 50,132 KB
testcase_69	AC	346 ms 49,728 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define incII(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };
auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a <  r); };
auto inXI = [](auto a, auto l, auto r) -> bool { return (l <  a && a <= r); };
auto inXX = [](auto a, auto l, auto r) -> bool { return (l <  a && a <  r); };
auto setmin   = [](auto & a, auto b) -> bool { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) -> bool { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };
using LL = long long int;
using LD = long double;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define RV(a) reverse(ALL(a))
#define ST(a) sort(ALL(a))
#define RST(a) sort(RALL(a))
#define SC static_cast
#define SI(a) SC<int>(a.size())
#define SL(a) SC<LL>(a.size())
#define RF(e, ...) for(auto && e: __VA_ARGS__)
#define SF(a, ...) for(auto && [__VA_ARGS__]: a)
#define until(...) while(not(__VA_ARGS__))
#define if_not(...) if(not(__VA_ARGS__))
#define ef else if
#define UR assert(false)
auto * IS = & cin;
auto * OS = & cout;
template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }
#define IN(...) __VA_ARGS__; in(__VA_ARGS__)
struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;
void                                      out_([[maybe_unused]] string const & s) { }
template<typename A                > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }
template<typename A, typename ... B> void out_(                 string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }
auto outF  = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; };
auto outN  = [](auto const & ... a) { outF(""  , ""  , a ...); };
auto outS  = [](auto const & ... a) { outF(" " , " " , a ...); };
auto outL  = [](auto const & ... a) { outF("\n", "\n", a ...); };
auto outSN = [](auto const & ... a) { outF(" " , ""  , a ...); };
auto outNL = [](auto const & ... a) { outF(""  , "\n", a ...); };
auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); };
auto out   = outSL;
template<typename A                > void disp_(A const & a) { * OS << a; }
template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } }
auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };
auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };
auto dispL = [](auto const & a,                 auto const & ... t) { dispT(a, "\n", t ...); };
template<typename A> istream & operator>>(istream & is, vector<A>       & v) { for(auto && e: v) { is >> e; } return is; }
template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }
template<typename A                > auto make_v(A a) { return a; }
template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }
template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }
template<typename A, size_t N> istream & operator>>(istream & is, array<A, N>       & a) { for(auto && e: a) { is >> e; } return is; }
template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; }
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>       & p) { return is >> p.first >> p.second; }
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; }
template<int I = 0, typename T> void tin_ (istream & is, T       & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } }
template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }
template<typename ... A> istream & operator>>(istream & is, tuple<A ...>       & t) { tin_ (is, t); return is; }
template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }

// ---- ----

template<LL M> class ModInt {
private:
	LL v;
	pair<LL, LL> ext_gcd(LL a, LL b) {
		if(b == 0) { assert(a == 1); return { 1, 0 }; }
		auto p = ext_gcd(b, a % b);
		return { p.SE, p.FI - (a / b) * p.SE };
	}
public:
	ModInt(LL vv = 0) { v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } }
	LL val() { return v; }
	static LL mod() { return M; }
	ModInt inv() { return ext_gcd(M, v).SE; }
	ModInt exp(LL b) {
		ModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; }
		while(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; }
		return p;
	}
	friend bool      operator< (ModInt    a, ModInt   b) { return (a.v <  b.v); }
	friend bool      operator> (ModInt    a, ModInt   b) { return (a.v >  b.v); }
	friend bool      operator<=(ModInt    a, ModInt   b) { return (a.v <= b.v); }
	friend bool      operator>=(ModInt    a, ModInt   b) { return (a.v >= b.v); }
	friend bool      operator==(ModInt    a, ModInt   b) { return (a.v == b.v); }
	friend bool      operator!=(ModInt    a, ModInt   b) { return (a.v != b.v); }
	friend ModInt    operator+ (ModInt    a            ) { return ModInt(+a.v); }
	friend ModInt    operator- (ModInt    a            ) { return ModInt(-a.v); }
	friend ModInt    operator+ (ModInt    a, ModInt   b) { return ModInt(a.v + b.v); }
	friend ModInt    operator- (ModInt    a, ModInt   b) { return ModInt(a.v - b.v); }
	friend ModInt    operator* (ModInt    a, ModInt   b) { return ModInt(a.v * b.v); }
	friend ModInt    operator/ (ModInt    a, ModInt   b) { return a * b.inv(); }
	friend ModInt    operator^ (ModInt    a, LL       b) { return a.exp(b); }
	friend ModInt  & operator+=(ModInt  & a, ModInt   b) { return (a = a + b); }
	friend ModInt  & operator-=(ModInt  & a, ModInt   b) { return (a = a - b); }
	friend ModInt  & operator*=(ModInt  & a, ModInt   b) { return (a = a * b); }
	friend ModInt  & operator/=(ModInt  & a, ModInt   b) { return (a = a / b); }
	friend ModInt  & operator^=(ModInt  & a, LL       b) { return (a = a ^ b); }
	friend istream & operator>>(istream & s, ModInt & b) { s >> b.v; b = ModInt(b.v); return s; }
	friend ostream & operator<<(ostream & s, ModInt   b) { return (s << b.v); }
};
using MI = ModInt<1'000'000'007>;

// ----

int main() {
	vector<MI> B = { 256, 777 };
	const int L = SI(B);
	vector<set<vector<MI>>> se(1'000'000 + 1);
	
	int IN(n);
	inc(i, n) {
		string IN(s);
		vector<MI> h(L);
		dec(j, SI(s)) {
		inc(k, L) {
			h[k] = h[k] * B[k] + s[j];
		}
		}
		bool f = se[SI(s)].count(h);
		if(SI(se[SI(s)]) != 0) {
			vector<MI> e(L, 1);
			inc(j, SI(s) - 1) {
				if(f) { break; }
				auto hh = h;
				inc(k, L) { hh[k] += (B[k] - 1) * (B[k] ^ j) * (s[j] - s[j + 1]); }
				f |= se[SI(s)].count(hh);
				inc(k, L) { e[k] *= B[k]; }
			}
		}
		out(f ? "Yes" : "No");
		se[SI(s)].insert(h);
	}
}

yukicoder

結果

テストケース

ソースコード