結果
問題 | No.1725 [Cherry 3rd Tune D] 無言の言葉 |
ユーザー |
![]() |
提出日時 | 2021-11-03 17:07:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 6,852 bytes |
コンパイル時間 | 2,877 ms |
コンパイル使用メモリ | 213,608 KB |
最終ジャッジ日時 | 2025-01-25 11:05:33 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 37 TLE * 5 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define incII(i, l, r) for(decltype(r) i = (l) ; i <= (r); i++) #define incIX(i, l, r) for(decltype(r) i = (l) ; i < (r); i++) #define incXI(i, l, r) for(decltype(r) i = (l) + 1; i <= (r); i++) #define incXX(i, l, r) for(decltype(r) i = (l) + 1; i < (r); i++) #define decII(i, l, r) for(auto i = (r) ; i >= (l); i--) #define decIX(i, l, r) for(auto i = (r) - 1; i >= (l); i--) #define decXI(i, l, r) for(auto i = (r) ; i > (l); i--) #define decXX(i, l, r) for(auto 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(e) while(not(e)) #define if_not(e) if(not(e)) #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 = [](array<string, 3> const & s, auto const & ... a) { * OS << s[0]; out_(s[1], a ...); * OS << s[2] << 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 outD = [](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; } // ---- ---- int main() { string IN(x, y); auto sx = make_v(0LL, 26, SI(x) + 1); auto sy = make_v(0LL, 26, SI(y) + 1); inc(i, SI(x)) { sx[x[i] - 'a'][i + 1]++; } inc(i, SI(y)) { sy[y[i] - 'a'][i + 1]++; } RF(v, sx) { inc(i, SI(v) - 1) { v[i + 1] += v[i]; } } RF(v, sy) { inc(i, SI(v) - 1) { v[i + 1] += v[i]; } } vector<LL> len = { SI(x) }; until(len.BA >= 1'000'000'000) { LL l = len.BA; len.PB(2 * l + SI(y)); } map<tuple<int, LL, LL, int>, LL> memo; function<LL(int, LL, LL, int)> f = [&] (int t, LL l, LL r, int c) -> LL { if_not(l < r) { return 0; } tuple tup = { t, l, r, c }; if(memo.count(tup) == 1) { return memo[tup]; } assert(0 <= l && l < r && r <= len[t]); if(t == 0) { return sx[c][r] - sx[c][l]; } else { LL ans = 0, p0 = 0, p1 = len[t - 1], p2 = p1 + SI(y), p3 = len[t]; { LL ll = max(l, p0) - p0, rr = min(r, p1) - p0; ans += f(t - 1, ll, rr, c); } { LL ll = max(l, p1) - p1, rr = min(r, p2) - p1; if(ll < rr) { ans += sy[c][rr] - sy[c][ll]; } } { LL ll = max(l, p2) - p2, rr = min(r, p3) - p2; ans += f(t - 1, p1 - rr, p1 - ll, c); } return (memo[tup] = ans); } }; int IN(q); inc(qq, q) { int IN(l, r); string IN(s); l--; out(f(SI(len) - 1, l, r, s[0] - 'a')); } }