結果
問題 | No.765 ukuku 2 |
ユーザー | はまやんはまやん |
提出日時 | 2019-01-03 00:37:17 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 302 ms / 3,000 ms |
コード長 | 6,171 bytes |
コンパイル時間 | 1,835 ms |
コンパイル使用メモリ | 182,888 KB |
実行使用メモリ | 12,536 KB |
最終ジャッジ日時 | 2024-05-01 22:39:52 |
合計ジャッジ時間 | 7,504 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
5,248 KB |
testcase_01 | AC | 4 ms
5,376 KB |
testcase_02 | AC | 4 ms
5,376 KB |
testcase_03 | AC | 3 ms
5,376 KB |
testcase_04 | AC | 3 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 4 ms
5,376 KB |
testcase_08 | AC | 3 ms
5,376 KB |
testcase_09 | AC | 3 ms
5,376 KB |
testcase_10 | AC | 3 ms
5,376 KB |
testcase_11 | AC | 3 ms
5,376 KB |
testcase_12 | AC | 4 ms
5,376 KB |
testcase_13 | AC | 3 ms
5,376 KB |
testcase_14 | AC | 4 ms
5,376 KB |
testcase_15 | AC | 3 ms
5,376 KB |
testcase_16 | AC | 4 ms
5,376 KB |
testcase_17 | AC | 4 ms
5,376 KB |
testcase_18 | AC | 4 ms
5,376 KB |
testcase_19 | AC | 3 ms
5,376 KB |
testcase_20 | AC | 3 ms
5,376 KB |
testcase_21 | AC | 3 ms
5,376 KB |
testcase_22 | AC | 3 ms
5,376 KB |
testcase_23 | AC | 3 ms
5,376 KB |
testcase_24 | AC | 3 ms
5,376 KB |
testcase_25 | AC | 3 ms
5,376 KB |
testcase_26 | AC | 3 ms
5,376 KB |
testcase_27 | AC | 3 ms
5,376 KB |
testcase_28 | AC | 3 ms
5,376 KB |
testcase_29 | AC | 4 ms
5,376 KB |
testcase_30 | AC | 191 ms
10,572 KB |
testcase_31 | AC | 186 ms
10,360 KB |
testcase_32 | AC | 159 ms
9,380 KB |
testcase_33 | AC | 122 ms
12,408 KB |
testcase_34 | AC | 125 ms
12,536 KB |
testcase_35 | AC | 249 ms
12,312 KB |
testcase_36 | AC | 253 ms
12,312 KB |
testcase_37 | AC | 279 ms
12,416 KB |
testcase_38 | AC | 300 ms
12,412 KB |
testcase_39 | AC | 302 ms
12,412 KB |
testcase_40 | AC | 194 ms
10,624 KB |
testcase_41 | AC | 211 ms
11,136 KB |
testcase_42 | AC | 231 ms
11,480 KB |
testcase_43 | AC | 204 ms
10,724 KB |
testcase_44 | AC | 217 ms
11,012 KB |
testcase_45 | AC | 248 ms
11,788 KB |
testcase_46 | AC | 212 ms
10,820 KB |
testcase_47 | AC | 246 ms
12,028 KB |
testcase_48 | AC | 239 ms
11,856 KB |
testcase_49 | AC | 239 ms
11,728 KB |
ソースコード
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<b;i++) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #define all(x) (x).begin(),(x).end() //#pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60; template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; } //--------------------------------------------------------------------------------------------------- template<int MOD> struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) { } ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } return ModInt(u); } bool operator==(ModInt that) const { return x == that.x; } bool operator!=(ModInt that) const { return x != that.x; } ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; } }; template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) { ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; } int getrand(int L, int R) { // [L,R] random_device rd; mt19937 mt(rd()); uniform_int_distribution<> rand(L, R); return rand(mt); } typedef ModInt<1000000007> mint1; typedef ModInt<1000000009> mint2; int primes[10] = { 10007, 10009, 10037, 10039, 10061, 10067, 10069, 10079, 10091, 10093 }; bool isShuffle = false; struct RollingHash { mint1 p1; mint2 p2; int n; vector<mint1> m1; vector<mint2> m2; vector<mint1> v1; vector<mint2> v2; RollingHash() { if (!isShuffle) { rep(i, 0, 101) { int a = getrand(0, 9); int b = getrand(0, 9); swap(primes[a], primes[b]); } isShuffle = true; } p1 = primes[0], p2 = primes[1]; } void init(string s, char o = 'a') { vector<int> v; fore(c, s) v.push_back(c - o); init(v); } void init(vector<int> s) { n = s.size(); m1.resize(n); m2.resize(n); v1.resize(n); v2.resize(n); m1[0] = 1; m2[0] = 1; v1[0] = s[0]; v2[0] = s[0]; rep(i, 1, n) { m1[i] = m1[i - 1] * p1; m2[i] = m2[i - 1] * p2; v1[i] = v1[i - 1] + m1[i] * s[i]; v2[i] = v2[i - 1] + m2[i] * s[i]; } } inline pair<mint1, mint2> hash(int l, int r) { // s[l..r] assert(l <= r); assert(r < n); mint1 a = v1[r]; if (l) a -= v1[l - 1]; a *= m1[n - 1 - r]; mint2 b = v2[r]; if (l) b -= v2[l - 1]; b *= m2[n - 1 - r]; return { a, b }; } }; struct StringMaster { string S, SR; int N; RollingHash rs, rsr; StringMaster() {} StringMaster(string s) { init(s); } void init(string s) { S = s; SR = s; reverse(all(SR)); rs.init(S); rsr.init(SR); N = S.length(); } int getMaxSame(int l, int r) { int lsz = l + 1; int rsz = N - r; int ok = 0, ng = min(lsz, rsz) + 1; while (ok + 1 != ng) { int md = (ok + ng) / 2; if (rs.hash(r, r + md - 1) == rsr.hash(N - 1 - l, N - 1 - l + md - 1)) ok = md; else ng = md; } return ok; } }; /*--------------------------------------------------------------------------------------------------- ∧_∧ ∧_∧ (´<_` ) Welcome to My Coding Space! ( ´_ゝ`) / ⌒i / \ | | / / ̄ ̄ ̄ ̄/ | __(__ニつ/ _/ .| .|____ \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ string S; int N; //--------------------------------------------------------------------------------------------------- void _main() { cin >> S; N = S.length(); StringMaster sm(S); int ans = 0; // 奇数回分 rep(c, 0, N) { int ma = sm.getMaxSame(c, c); if (c - ma < 0 and N <= c + ma) chmax(ans, N - 2); else if (c - ma < 0 or N <= c + ma) chmax(ans, ma * 2 - 1); else { // 左を消す if(0 <= c - ma - 1) chmax(ans, ma * 2 - 1 + sm.getMaxSame(c - ma - 1, c + ma)*2); // 右を消す if (c + ma + 1 < N) chmax(ans, ma * 2 - 1 + sm.getMaxSame(c - ma, c + ma + 1) * 2); } } // 偶数回分 rep(c, 0, N - 1) { int ma = sm.getMaxSame(c, c + 1); if (c - ma < 0 and N <= c + 1 + ma) chmax(ans, N - 2); else if (c - ma < 0 or N <= c + 1 + ma) chmax(ans, ma * 2); else { // 左を消す if (0 <= c - ma - 1) chmax(ans, ma * 2 + sm.getMaxSame(c - ma - 1, c + 1 + ma) * 2); // 右を消す if (c + 1 + ma + 1 < N) chmax(ans, ma * 2 + sm.getMaxSame(c - ma, c + 1 + ma + 1) * 2); } } // 真ん中を消すパターン rep(c, 0, N - 2) chmax(ans, sm.getMaxSame(c, c + 2) * 2); cout << ans << endl; }