結果
| 問題 | No.2606 Mirror Relay |
| ユーザー |
👑  potato167
|
| 提出日時 | 2024-01-12 22:40:20 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 729 ms / 2,000 ms |
| コード長 | 9,510 bytes |
| コンパイル時間 | 2,970 ms |
| コンパイル使用メモリ | 231,348 KB |
| 最終ジャッジ日時 | 2025-02-18 18:45:29 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 69 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}//https://snuke.hatenablog.com/entry/2014/12/02/235837vector<int> mana(string S){int i = 0, j = 0;vector<int> R(S.size());while (i < (int)S.size()) {while (i-j >= 0 && i+j < (int)S.size() && S[i-j] == S[i+j]) ++j;R[i] = j;int k = 1;while (i-k >= 0 && k+R[i-k] < j) R[i+k] = R[i-k], ++k;i += k; j -= k;}return R;}struct RollingHash {using u64 = uint64_t;static inline const u64 mod = 0x1FFF'FFFF'FFFF'FFFF, base = mt19937_64{random_device{}()}() % mod;ll n;vector<u64> hash, pow;static u64 add(u64 a, u64 b) {a += b;if(a >= mod) a -= mod;return a;}static u64 mul(u64 a, u64 b) {auto c = __uint128_t(a) * b;return add(c >> 61, c & mod);}RollingHash(const string& s): n(s.size()), hash(n + 1), pow(n + 1, 1) {for(ll i = 0; i < n; i++) {pow[i + 1] = mul(pow[i], base);hash[i + 1] = add(mul(hash[i], base), s[i]);}}u64 get(ll l, ll r) const {return add(hash[r], mod - mul(hash[l], pow[r - l]));}};std::vector<std::vector<int>> tree_in(int N){std::vector<std::vector<int>> G(N);for(int i=0;i<N-1;i++){int a;int b;cin>>a>>b;a--,b--;G[a].push_back(b);G[b].push_back(a);}return G;}std::tuple<std::vector<int>,std::vector<int>,std::vector<int>> tree_order_pare_depth(std::vector<std::vector<int>> &G,int root){int n=G.size();std::vector<int> order={root},pare(n,-1),depth(n);pare[root]=-2;for(int i=0;i<n;i++){int a=order[i];for(auto x:G[a]){if(pare[x]==-1){pare[x]=a;depth[x]=depth[a]+1;order.push_back(x);}}}return {order,pare,depth};}std::vector<int> tree_diameter_path(std::vector<std::vector<int>> &G){int n=G.size();auto r=(std::get<0>(tree_order_pare_depth(G,0))).at(n-1);std::vector<int> order,pare,depth,ans;tie(order,pare,depth)=tree_order_pare_depth(G,r);int ind=order[n-1];while(ind!=-2){ans.push_back(ind);ind=pare[ind];}return ans;}namespace atcoder {namespace internal {// @param n `0 <= n`// @return minimum non-negative `x` s.t. `n <= 2**x`int ceil_pow2(int n) {int x = 0;while ((1U << x) < (unsigned int)(n)) x++;return x;}// @param n `1 <= n`// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`int bsf(unsigned int n) {#ifdef _MSC_VERunsigned long index;_BitScanForward(&index, n);return index;#elsereturn __builtin_ctz(n);#endif}} // namespace internaltemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {public:segtree() : segtree(0) {}segtree(int n) : segtree(std::vector<S>(n, e())) {}segtree(const std::vector<S>& v) : _n(int(v.size())) {log = internal::ceil_pow2(_n);size = 1 << log;d = std::vector<S>(2 * size, e());for (int i = 0; i < _n; i++) d[size + i] = v[i];for (int i = size - 1; i >= 1; i--) {update(i);}}void set(int p, S x) {assert(0 <= p && p < _n);p += size;d[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}S get(int p) {assert(0 <= p && p < _n);return d[p + size];}void addl(int p,S x){set(p,op(get(p),x));}void addr(int p,S x){set(p,op(x,get(p)));}void inti(){for(auto *x:d) x=e();}S prod(int l, int r) {assert(0 <= l && l <= r && r <= _n);S sml = e(), smr = e();l += size;r += size;while (l < r) {if (l & 1) sml = op(sml, d[l++]);if (r & 1) smr = op(d[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}S all_prod() { return d[1]; }template <bool (*f)(S)> int max_right(int l) {return max_right(l, [](S x) { return f(x); });}template <class F> int max_right(int l, F f) {assert(0 <= l && l <= _n);assert(f(e()));if (l == _n) return _n;l += size;S sm = e();do {while (l % 2 == 0) l >>= 1;if (!f(op(sm, d[l]))) {while (l < size) {l = (2 * l);if (f(op(sm, d[l]))) {sm = op(sm, d[l]);l++;}}return l - size;}sm = op(sm, d[l]);l++;} while ((l & -l) != l);return _n;}template <bool (*f)(S)> int min_left(int r) {return min_left(r, [](S x) { return f(x); });}template <class F> int min_left(int r, F f) {assert(0 <= r && r <= _n);assert(f(e()));if (r == 0) return 0;r += size;S sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!f(op(d[r], sm))) {while (r < size) {r = (2 * r + 1);if (f(op(d[r], sm))) {sm = op(d[r], sm);r--;}}return r + 1 - size;}sm = op(d[r], sm);} while ((r & -r) != r);return 0;}private:int _n, size, log;std::vector<S> d;void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }};} // namespace atcoderusing namespace atcoder;int op(int a,int b){return min(a,b);}int e(){return INF;}int target;bool g(int a){return a>target;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){string S;cin>>S;string T;rep(i,0,S.size()){if(i) T+='$';T+=S[i];}swap(S,T);RollingHash H(S);auto M=mana(S);using u64=uint64_t;map<u64,int> m;m[0]=0;vector<int> pare={-1};int N=S.size();vector<pair<int,int>> f_order;segtree<int,op,e> seg(N);rep(i,0,N){if((i+M[i])%2==0) M[i]--;seg.set(i,i-M[i]+1);if(M[i]==0) continue;int sz=M[i];int l=i-sz+1,r=i+sz;while(true){auto tmp=H.get(l,r);if(m.count(tmp)) break;f_order.push_back({l,r});int ind=m.size();m[tmp]=ind;int n_l=l+2;int n_r=r-2;if(n_l>=n_r){pare.push_back(0);break;}auto n_tmp=H.get(n_l,n_r);if(m.count(n_tmp)){pare.push_back(m[n_tmp]);break;}else{pare.push_back(ind+1);}l=n_l,r=n_r;}}//vec_out(pare);//cout<<S<<endl;int L=pare.size();vector<vector<int>> G(L);rep(i,1,L) G[pare[i]].push_back(i);vector<ll> X(L);rep(i,0,N) if(M[i]) X[m[H.get(i+1-M[i],i+M[i])]]++;auto [order,popo,depth]=tree_order_pare_depth(G,0);for(int i=L-1;i>0;i--){int a=order[i];X[pare[a]]+=X[a];}vector<ll> ans(L,-1);ans[0]=0;auto f=[&](auto self,int l,int r) -> int {auto ind=m[H.get(l,r)];if(ans[ind]!=-1) return ind;int len=((r-l+1)/2);if(len==1){ans[ind]=X[ind];return ind;}int n_l,n_r,n_ind;int c=(r+l)/2;target=l;int n_c=seg.min_left<g>(c)-1;n_l=l,n_r=l+(n_c-l)*2+1;// cacl n_l,n_rn_ind=self(self,n_l,n_r);ans[ind]=X[ind]*((r-l+1)/2)+ans[n_ind];return ind;};for(auto tmp:f_order) f(f,tmp.first,tmp.second);cout<<vec_max(ans)<<"\n";}