結果

問題 No.2162 Copy and Paste 2
ユーザー siganaisiganai
提出日時 2022-12-21 08:35:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,322 ms / 7,000 ms
コード長 5,421 bytes
コンパイル時間 2,299 ms
コンパイル使用メモリ 213,844 KB
実行使用メモリ 25,344 KB
最終ジャッジ日時 2024-04-29 03:12:18
合計ジャッジ時間 14,467 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 41 ms
12,160 KB
testcase_07 AC 40 ms
11,904 KB
testcase_08 AC 236 ms
19,832 KB
testcase_09 AC 64 ms
12,160 KB
testcase_10 AC 57 ms
11,520 KB
testcase_11 AC 156 ms
16,640 KB
testcase_12 AC 129 ms
13,952 KB
testcase_13 AC 369 ms
19,820 KB
testcase_14 AC 114 ms
13,184 KB
testcase_15 AC 122 ms
13,056 KB
testcase_16 AC 118 ms
13,184 KB
testcase_17 AC 824 ms
19,804 KB
testcase_18 AC 875 ms
21,120 KB
testcase_19 AC 881 ms
20,728 KB
testcase_20 AC 717 ms
20,304 KB
testcase_21 AC 349 ms
19,920 KB
testcase_22 AC 313 ms
19,860 KB
testcase_23 AC 9 ms
9,856 KB
testcase_24 AC 1,297 ms
25,344 KB
testcase_25 AC 1,278 ms
25,344 KB
testcase_26 AC 1,056 ms
22,144 KB
testcase_27 AC 1,322 ms
25,344 KB
testcase_28 AC 823 ms
17,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#line 1 "test.cpp"
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return a + b; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr int mod = 1000000007;
//constexpr int mod = 998244353;
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

#line 2 "library/string/z_algorithm.hpp"
template<typename Container>
vector<int> z_algorithm(Container s) {
    int n = s.size();
    if(n == 0) return {};
    vector<int> a(n);
    a[0] = n;
    int i = 1, j = 0;
    while (i < n) {
        while (i + j < n && s[j] == s[i + j]) ++j;
        a[i] = j;
        if (j == 0) {
            ++i;
            continue;
        }
        int k = 1;
        while (i + k < n && k + a[k] < j) a[i + k] = a[k], ++k;
        i += k;
        j -= k;
    }
    return a;
}
#line 87 "test.cpp"

int main() {
    STR(s);
    int n = s.size();
    auto ret = z_algorithm(s);
    vi dp(n+1,1e9);
    set<int> se;
    vvi len(n);
    rep(i,1,n) {
        if(ret[i] >= 2) {
            se.insert(i+1);
            len[ret[i]].emplace_back(i+1);
        }
    }
    dp[0] = 0;
    rep(i,1,n+1) {
        chmin(dp[i],dp[i-1]+1);
        if(i >= 2 && (!se.empty())) {
            int cnt = dp[i] + 1;
            int cur = i + 1;
            while(se.lower_bound(cur) != se.end()) {
                auto it = se.lower_bound(cur);
                cnt += *it - cur + 1;
                chmin(dp[*it + i - 1],cnt);
                cur = *it + i;
            }
            if(se.find(i) != se.end()) se.erase(i);
            for(auto &x:len[i]) se.erase(x);
        }
        debug(dp);
    }
    cout << dp[n] << '\n';
}
0