結果

問題 No.2162 Copy and Paste 2
ユーザー snukesnuke
提出日時 2022-12-13 00:20:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,009 ms / 7,000 ms
コード長 4,869 bytes
コンパイル時間 2,370 ms
コンパイル使用メモリ 217,492 KB
実行使用メモリ 26,624 KB
最終ジャッジ日時 2024-11-06 21:49:05
合計ジャッジ時間 14,462 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 91 ms
16,372 KB
testcase_07 AC 130 ms
18,280 KB
testcase_08 AC 333 ms
21,100 KB
testcase_09 AC 164 ms
16,156 KB
testcase_10 AC 166 ms
16,056 KB
testcase_11 AC 289 ms
19,712 KB
testcase_12 AC 270 ms
18,176 KB
testcase_13 AC 514 ms
21,156 KB
testcase_14 AC 183 ms
16,468 KB
testcase_15 AC 188 ms
16,208 KB
testcase_16 AC 198 ms
16,468 KB
testcase_17 AC 702 ms
21,308 KB
testcase_18 AC 838 ms
22,496 KB
testcase_19 AC 855 ms
21,580 KB
testcase_20 AC 745 ms
21,280 KB
testcase_21 AC 413 ms
21,256 KB
testcase_22 AC 408 ms
21,240 KB
testcase_23 AC 129 ms
21,108 KB
testcase_24 AC 986 ms
26,624 KB
testcase_25 AC 975 ms
26,616 KB
testcase_26 AC 923 ms
23,424 KB
testcase_27 AC 1,009 ms
26,624 KB
testcase_28 AC 647 ms
19,312 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

// Z algorithm
struct Z {
  vi a;
  Z(){}
  Z(const string& s):a(sz(s)) {
    int n = sz(s); a[0] = n;
    for (int i=1,j=0;i<n;) {
      while (i+j<n && s[j]==s[i+j]) ++j;
      a[i] = j;
      int k = !!j;
      while (i+k<n && k+a[k]<j) a[i+k] = a[k], ++k;
      i += k+!j; j -= k;
    }
  }
  inline int operator[](int i) { return a[i];}
};
//

// Segment tree (range add)
struct F { // min func
  using TT = int;
  TT d;
  F(TT d=INF):d(d) {}
  F& operator+=(const F& f) {
    mins(d, f.d);
    return *this;
  }
  F operator+(const F& f) const { return F(*this) += f;}
};
struct seg {
  vector<F> d; int n;
  seg(){}
  seg(int mx) {
    n = 1; while (n < mx) n <<= 1;
    d = vector<F>(n<<1);
  }
  void upd(int i) { d[i] = d[i<<1]+d[i<<1|1];}
  F& operator[](int i) { return d[n+i];}
  void init() { for(int i=n-1;i;--i) upd(i);}
  F get(int i) {
    F x;
    for (i+=n;i;i>>=1) x += d[i];
    return x;
  }
  void add(int l, int r, F f) {
    if (l >= r) return;
    // cerr<<l<<" "<<r<<" "<<f.d<<endl;
    l += n; r += n;
    while (l < r) {
      if (l&1) d[l] += f, ++l;
      if (r&1) --r, d[r] += f;
      l >>= 1; r >>= 1;
    }
  }
};
//

struct Solver {
  void solve() {
    string s;
    cin>>s;
    int n = sz(s);
    Z z(s);
    vvi is(n+1);
    srep(i,1,n) is[z[i]].pb(i);

    seg t(n+5);
    t.add(0,n+1,F(0));
    
    set<int> st;
    srep(i,1,n) if (z[i]) st.insert(i);
    // cerr<<z.a<<endl;

    int ans = INF;
    rep1(i,n) {
      int now = t.get(i).d+i;
      // cerr<<now<<endl;
      ans = now;
      int j = i; now++;
      while (1) {
        auto it = st.lower_bound(j);
        if (it == st.end()) break;
        j = *it+i;
        now -= i-1;
        t.add(j,n+1,F(now-i));
      }
      for (int j : is[i]) st.erase(j);
    }
    cout<<ans<<endl;
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0