oj.uz

답안 #951784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951784 2024-03-22T15:59:13 Z EJIC_B_KEDAX Copy and Paste 3 (JOI22_copypaste3) C++17
25 / 100
 364 ms 346324 KB 
#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#ifndef LOCAL
    // #pragma GCC optimize("O3")
    // #pragma GCC optimize("Ofast")
    // #pragma GCC optimize("unroll-loops")
    // #pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
using ll = long long;
using ld = long double;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

mt19937_64 mt(time(0));

void solve();
void init();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    cout << fixed << setprecision(30);
    init();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

char mem[1 << 27];
size_t curmem = 0;
void* operator new(size_t n) {
    curmem += n;
    return mem + curmem - n;
}
void operator delete(void*) {}
void operator delete(void*, size_t) {}

const int N = 2525, mod = 1000000321, p = 31;
ll dp[N][N];
int to[N][N], nw[N][N], hsh[N], pdeg[N], pinv[N];
vector<pair<int, int>> upd[N];

int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b;
}

int sub(int a, int b) {
    return a >= b ? a - b : a - b + mod;
}

int mul(int a, int b) {
    return 1ll * a * b % mod;
}

int bin_pow(int a, int x) {
    int res = 1;
    while (x) {
        if (x & 1) {
            res = mul(res, a);
        }
        a = mul(a, a);
        x >>= 1;
    }
    return res;
}

int inv(int a) {
    return bin_pow(a, mod - 2);
}

void init() {
    pdeg[0] = 1;
    pdeg[1] = p;
    pinv[0] = 1;
    pinv[1] = inv(p);
    for (int i = 2; i < N; i++) {
        pdeg[i] = mul(pdeg[i - 1], p);
        pinv[i] = mul(pinv[i - 1], pinv[1]);
    }
}

int get_hash(int l, int r) {
    return mul(sub(hsh[r + 1], hsh[l]), pinv[l]);
}

struct segment_tree {
    vector<ll> st;
    int size;
    segment_tree(int sz = N) {
        st.resize(2 * sz, 0);
        size = sz;
    }
    void add(int i, ll v) {
        i += size;
        st[i] += v;
        i >>= 1;
        while (i) {
            st[i] = min(st[2 * i], st[2 * i + 1]);
            i >>= 1;
        }
    }
    ll get_min(int l, int r) {
        l += size;
        r += size;
        ll res = INT64_MAX;
        while (l <= r) {
            if (l & 1) {
                res = min(res, st[l++]);
            }
            if (~r & 1) {
                res = min(res, st[r--]);
            }
            l >>= 1;
            r >>= 1;
        }
        return res;
    }
};

segment_tree st[N];

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    int a, b, c;
    cin >> a >> b >> c;
    hsh[0] = 0;
    for (int i = 0; i < n; i++) {
        hsh[i + 1] = add(hsh[i], mul(s[i] - 'a' + 1, pdeg[i]));
    }
    for (int l = 0; l < n; l++) {
        unordered_map<int, int> mp;
        for (int i = 0; i < n - l; i++) {
            int j = i + l;
            int nw = get_hash(i, j);
            if (mp.find(nw) == mp.end()) {
                to[i][j] = -1;
            } else {
                to[i][j] = mp[nw];
            }
            if (i >= l) {
                mp[get_hash(i - l, i)] = i - l;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        dp[i][i] = a;
        // save[i][i] = b + c;
        st[i].add(i, b + c);
        nw[i][i] = to[i][i];
        if (to[i][i] != -1) {
            upd[i - to[i][i]].emplace_back(i, i);
        }
    }
    for (int l = 1; l < n; l++) {
        for (auto [i, j] : upd[l]) {
            int nxt = to[nw[i][j]][nw[i][j] + j - i];
            nw[i][j] = nxt;
            if (nxt >= 0) {
                upd[j - nxt].emplace_back(i, j);
            }
            // save[j][i] += b - 1ll * (j - i + 1) * a;
            st[j].add(i, c - 1ll * (j - i + 1) * a);
        }
        for (int i = 0; i < n - l; i++) {
            int j = i + l;
            dp[i][j] = min(1ll * (j - i + 1) * a + min(0ll, st[j].get_min(i + 1, j)), dp[i][j - 1] + a);
            st[j].add(i, dp[i][j] + b + c - 1ll * (j - i + 1) * a);
            nw[i][j] = to[i][j];
            if (nw[i][j] != -1) {
                upd[j - nw[i][j]].emplace_back(i, j);
            }
        }
    }
    // cout << to[3][3] << '\n';
    // for (int i = 0; i < n; i++) {
    //     for (int j = i; j < n; j++) {
    //         cout << dp[i][j] << ' ';
    //     }
    //     cout << '\n';
    // }
    cout << dp[0][n - 1] << '\n';
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 107920 KB Output is correct
2 Correct 17 ms 107868 KB Output is correct
3 Correct 17 ms 107768 KB Output is correct
4 Correct 16 ms 107920 KB Output is correct
5 Correct 16 ms 107864 KB Output is correct
6 Correct 17 ms 107868 KB Output is correct
7 Correct 16 ms 107968 KB Output is correct
8 Correct 16 ms 107868 KB Output is correct
9 Correct 16 ms 107912 KB Output is correct
10 Correct 16 ms 107868 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 107868 KB Output is correct
2 Correct 16 ms 107888 KB Output is correct
3 Runtime error 364 ms 346324 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 107920 KB Output is correct
2 Correct 17 ms 107868 KB Output is correct
3 Correct 17 ms 107768 KB Output is correct
4 Correct 16 ms 107920 KB Output is correct
5 Correct 16 ms 107864 KB Output is correct
6 Correct 17 ms 107868 KB Output is correct
7 Correct 16 ms 107968 KB Output is correct
8 Correct 16 ms 107868 KB Output is correct
9 Correct 16 ms 107912 KB Output is correct
10 Correct 16 ms 107868 KB Output is correct
11 Correct 16 ms 107880 KB Output is correct
12 Correct 16 ms 107880 KB Output is correct
13 Correct 16 ms 107880 KB Output is correct
14 Correct 16 ms 108000 KB Output is correct
15 Correct 16 ms 107880 KB Output is correct
16 Correct 16 ms 107980 KB Output is correct
17 Correct 18 ms 107896 KB Output is correct
18 Correct 19 ms 106080 KB Output is correct
19 Correct 16 ms 107880 KB Output is correct
20 Correct 16 ms 107880 KB Output is correct
21 Correct 16 ms 108132 KB Output is correct
22 Correct 16 ms 107880 KB Output is correct
23 Correct 16 ms 107864 KB Output is correct
24 Correct 16 ms 107868 KB Output is correct
25 Correct 16 ms 107992 KB Output is correct
26 Correct 17 ms 107868 KB Output is correct
27 Correct 16 ms 107868 KB Output is correct
28 Correct 16 ms 107868 KB Output is correct
29 Correct 17 ms 107856 KB Output is correct
30 Correct 19 ms 108124 KB Output is correct
31 Correct 16 ms 107868 KB Output is correct
32 Correct 16 ms 108048 KB Output is correct
33 Correct 16 ms 108120 KB Output is correct
34 Correct 16 ms 105816 KB Output is correct
35 Correct 16 ms 108024 KB Output is correct
36 Correct 16 ms 107896 KB Output is correct
37 Correct 16 ms 107868 KB Output is correct
38 Correct 16 ms 107868 KB Output is correct
39 Correct 16 ms 107916 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 107920 KB Output is correct
2 Correct 17 ms 107868 KB Output is correct
3 Correct 17 ms 107768 KB Output is correct
4 Correct 16 ms 107920 KB Output is correct
5 Correct 16 ms 107864 KB Output is correct
6 Correct 17 ms 107868 KB Output is correct
7 Correct 16 ms 107968 KB Output is correct
8 Correct 16 ms 107868 KB Output is correct
9 Correct 16 ms 107912 KB Output is correct
10 Correct 16 ms 107868 KB Output is correct
11 Correct 16 ms 107880 KB Output is correct
12 Correct 16 ms 107880 KB Output is correct
13 Correct 16 ms 107880 KB Output is correct
14 Correct 16 ms 108000 KB Output is correct
15 Correct 16 ms 107880 KB Output is correct
16 Correct 16 ms 107980 KB Output is correct
17 Correct 18 ms 107896 KB Output is correct
18 Correct 19 ms 106080 KB Output is correct
19 Correct 16 ms 107880 KB Output is correct
20 Correct 16 ms 107880 KB Output is correct
21 Correct 16 ms 108132 KB Output is correct
22 Correct 16 ms 107880 KB Output is correct
23 Correct 16 ms 107864 KB Output is correct
24 Correct 16 ms 107868 KB Output is correct
25 Correct 16 ms 107992 KB Output is correct
26 Correct 17 ms 107868 KB Output is correct
27 Correct 16 ms 107868 KB Output is correct
28 Correct 16 ms 107868 KB Output is correct
29 Correct 17 ms 107856 KB Output is correct
30 Correct 19 ms 108124 KB Output is correct
31 Correct 16 ms 107868 KB Output is correct
32 Correct 16 ms 108048 KB Output is correct
33 Correct 16 ms 108120 KB Output is correct
34 Correct 16 ms 105816 KB Output is correct
35 Correct 16 ms 108024 KB Output is correct
36 Correct 16 ms 107896 KB Output is correct
37 Correct 16 ms 107868 KB Output is correct
38 Correct 16 ms 107868 KB Output is correct
39 Correct 16 ms 107916 KB Output is correct
40 Correct 17 ms 109912 KB Output is correct
41 Correct 22 ms 116052 KB Output is correct
42 Correct 19 ms 114012 KB Output is correct
43 Correct 19 ms 113996 KB Output is correct
44 Correct 19 ms 114008 KB Output is correct
45 Correct 19 ms 114012 KB Output is correct
46 Correct 19 ms 113924 KB Output is correct
47 Correct 20 ms 114012 KB Output is correct
48 Correct 20 ms 114012 KB Output is correct
49 Correct 19 ms 114180 KB Output is correct
50 Correct 23 ms 114480 KB Output is correct
51 Correct 20 ms 114012 KB Output is correct
52 Correct 20 ms 114012 KB Output is correct
53 Correct 19 ms 114008 KB Output is correct

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 107920 KB Output is correct
2 Correct 17 ms 107868 KB Output is correct
3 Correct 17 ms 107768 KB Output is correct
4 Correct 16 ms 107920 KB Output is correct
5 Correct 16 ms 107864 KB Output is correct
6 Correct 17 ms 107868 KB Output is correct
7 Correct 16 ms 107968 KB Output is correct
8 Correct 16 ms 107868 KB Output is correct
9 Correct 16 ms 107912 KB Output is correct
10 Correct 16 ms 107868 KB Output is correct
11 Correct 16 ms 107880 KB Output is correct
12 Correct 16 ms 107880 KB Output is correct
13 Correct 16 ms 107880 KB Output is correct
14 Correct 16 ms 108000 KB Output is correct
15 Correct 16 ms 107880 KB Output is correct
16 Correct 16 ms 107980 KB Output is correct
17 Correct 18 ms 107896 KB Output is correct
18 Correct 19 ms 106080 KB Output is correct
19 Correct 16 ms 107880 KB Output is correct
20 Correct 16 ms 107880 KB Output is correct
21 Correct 16 ms 108132 KB Output is correct
22 Correct 16 ms 107880 KB Output is correct
23 Correct 16 ms 107864 KB Output is correct
24 Correct 16 ms 107868 KB Output is correct
25 Correct 16 ms 107992 KB Output is correct
26 Correct 17 ms 107868 KB Output is correct
27 Correct 16 ms 107868 KB Output is correct
28 Correct 16 ms 107868 KB Output is correct
29 Correct 17 ms 107856 KB Output is correct
30 Correct 19 ms 108124 KB Output is correct
31 Correct 16 ms 107868 KB Output is correct
32 Correct 16 ms 108048 KB Output is correct
33 Correct 16 ms 108120 KB Output is correct
34 Correct 16 ms 105816 KB Output is correct
35 Correct 16 ms 108024 KB Output is correct
36 Correct 16 ms 107896 KB Output is correct
37 Correct 16 ms 107868 KB Output is correct
38 Correct 16 ms 107868 KB Output is correct
39 Correct 16 ms 107916 KB Output is correct
40 Correct 17 ms 109912 KB Output is correct
41 Correct 22 ms 116052 KB Output is correct
42 Correct 19 ms 114012 KB Output is correct
43 Correct 19 ms 113996 KB Output is correct
44 Correct 19 ms 114008 KB Output is correct
45 Correct 19 ms 114012 KB Output is correct
46 Correct 19 ms 113924 KB Output is correct
47 Correct 20 ms 114012 KB Output is correct
48 Correct 20 ms 114012 KB Output is correct
49 Correct 19 ms 114180 KB Output is correct
50 Correct 23 ms 114480 KB Output is correct
51 Correct 20 ms 114012 KB Output is correct
52 Correct 20 ms 114012 KB Output is correct
53 Correct 19 ms 114008 KB Output is correct
54 Correct 35 ms 128344 KB Output is correct
55 Runtime error 303 ms 330976 KB Execution killed with signal 11
56 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 107920 KB Output is correct
2 Correct 17 ms 107868 KB Output is correct
3 Correct 17 ms 107768 KB Output is correct
4 Correct 16 ms 107920 KB Output is correct
5 Correct 16 ms 107864 KB Output is correct
6 Correct 17 ms 107868 KB Output is correct
7 Correct 16 ms 107968 KB Output is correct
8 Correct 16 ms 107868 KB Output is correct
9 Correct 16 ms 107912 KB Output is correct
10 Correct 16 ms 107868 KB Output is correct
11 Correct 16 ms 107868 KB Output is correct
12 Correct 16 ms 107888 KB Output is correct
13 Runtime error 364 ms 346324 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -