oj.uz

Submission #578601

# Submission time Handle Problem Language Result Execution time Memory
578601 2022-06-17T10:59:49 Z InternetPerson10 Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 3000 ms 330284 KB 
#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

ll ans[2501][2501];
ll num_ma[2501][2501];

int n;
string s;
ll a, b, c;

map<string, int> ma;
vector<vector<int>> apps;
vector<vector<int>> ne;
vector<vector<vector<int>>> lift;
vector<int> siz;

int getCtApps(int x, int y, int i) {
    if(i < x + ((y - x + 1) / 2)) return 0;
    if(i >= y) return 1e6;
    int str_idx = num_ma[i][y];
    int l = 0, r = apps[str_idx].size();
    while(l != r - 1) {
        int mid = (l + r) / 2;
        if(apps[str_idx][mid] <= i) l = mid;
        else r = mid;
    }
    int ctApps = 1;
    for(int z = lift[str_idx][l].size() - 1; z >= 0; z--) {
        int tent = lift[str_idx][l][z];
        if(tent != -1) {
            if(apps[str_idx][tent] >= x) {
                l = tent;
                ctApps += (1 << z);
            }
        }
    }
    return ctApps;
}

int tot = 0;

ll f(int x, int y) {
    if(ans[x][y] != -1) return ans[x][y];
    if(y - x == 1) {
        return ans[x][y] = a;
    }
    ll best = f(x, y-1) + a;
    auto tryI = [&](int i, int ctApps = -1) {
        if(ctApps == -1) ctApps = getCtApps(x, y, i);
        if(ctApps == 1e6) return ctApps;
        int indivChars = y - x - ctApps * (y - i);
        best = min(best, f(i, y) + b + a * indivChars + c * ctApps);
        return ctApps;
    };
    int prevCtApps = tryI(y-1);
    int i = y-1;
    int lim = x + ((y - x + 1) / 2);
    while(i >= lim) {
        int j = 0;
        int nex = getCtApps(x, y, i-1);
        if(nex != prevCtApps) {
            i--;
            if(i >= lim) {
                tryI(i, nex);
                prevCtApps = nex;
            }
            continue;
        }
        while(nex == prevCtApps) {
            j++;
            nex = getCtApps(x, y, i - (1 << j));
        }
        j--;
        i -= (1 << j);
        while(j) {
            j--;
            if(prevCtApps == getCtApps(x, y, i - (1 << j))) {
                i -= (1 << j);
            }
        }
        tryI(i, prevCtApps);
        i--;
        if(i >= lim) prevCtApps = tryI(i);
    }
    return ans[x][y] = best;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> s >> a >> b >> c;
    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= n; j++) {
            ans[i][j] = -1;
        }
    }
    for(int i = 0; i < n; i++) {
        string s2 = s.substr(i, 1);
        for(int j = i+1; j <= n; j++) {
            int x;
            if(!ma.count(s2)) {
                x = ma[s2] = ma.size();
                apps.push_back(vector<int>());
                siz.push_back(j-i);
            }
            else x = ma[s2];
            apps[x].push_back(i);
            num_ma[i][j] = x;
            if(j != n) s2.push_back(s[j]);
        }
    }
    ne = apps;
    lift.resize(ne.size());
    for(int j = 0; j < ne.size(); j++) {
        lift[j].resize(ne[j].size());
        vector<int> v = ne[j];
        queue<int> q;
        for(int i = v.size() - 1; i >= 0; i--) {
            q.push(i);
            int g = q.front();
            while(v[g] - v[i] >= siz[j]) {
                q.pop();
                ne[j][g] = i;
                g = q.front();
            }
        }
        while(q.size()) {
            int g = q.front();
            q.pop();
            ne[j][g] = -1;
        }
        for(int k = 0; k < v.size(); k++) {
            lift[j][k].push_back(ne[j][k]);
        }
        for(int l = 1; l < 13; l++) {
            for(int k = 0; k < v.size(); k++) {
                lift[j][k].push_back(-1);
                if(lift[j][k][l-1] == -1) lift[j][k][l] = -1;
                else lift[j][k][l] = lift[j][lift[j][k][l-1]][l-1];
            }
            if(lift[j].back()[l] == -1) break;
        }
    }
    cout << (ll)f(0, n) << '\n';
}

Compilation message

copypaste3.cpp: In function 'int main()':
copypaste3.cpp:116:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |     for(int j = 0; j < ne.size(); j++) {
      |                    ~~^~~~~~~~~~~
copypaste3.cpp:134:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |         for(int k = 0; k < v.size(); k++) {
      |                        ~~^~~~~~~~~~
copypaste3.cpp:138:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |             for(int k = 0; k < v.size(); k++) {
      |                            ~~^~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Execution timed out 3073 ms 170188 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 636 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 724 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 596 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 636 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 724 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 4 ms 2132 KB Output is correct
41 Correct 20 ms 3864 KB Output is correct
42 Correct 26 ms 9292 KB Output is correct
43 Correct 27 ms 9460 KB Output is correct
44 Correct 24 ms 9524 KB Output is correct
45 Correct 22 ms 9524 KB Output is correct
46 Correct 22 ms 9476 KB Output is correct
47 Correct 15 ms 5076 KB Output is correct
48 Correct 19 ms 7316 KB Output is correct
49 Correct 22 ms 8088 KB Output is correct
50 Correct 20 ms 8304 KB Output is correct
51 Correct 22 ms 7056 KB Output is correct
52 Correct 23 ms 7180 KB Output is correct
53 Correct 22 ms 9480 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 636 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 724 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 4 ms 2132 KB Output is correct
41 Correct 20 ms 3864 KB Output is correct
42 Correct 26 ms 9292 KB Output is correct
43 Correct 27 ms 9460 KB Output is correct
44 Correct 24 ms 9524 KB Output is correct
45 Correct 22 ms 9524 KB Output is correct
46 Correct 22 ms 9476 KB Output is correct
47 Correct 15 ms 5076 KB Output is correct
48 Correct 19 ms 7316 KB Output is correct
49 Correct 22 ms 8088 KB Output is correct
50 Correct 20 ms 8304 KB Output is correct
51 Correct 22 ms 7056 KB Output is correct
52 Correct 23 ms 7180 KB Output is correct
53 Correct 22 ms 9480 KB Output is correct
54 Correct 165 ms 49608 KB Output is correct
55 Correct 1622 ms 54844 KB Output is correct
56 Correct 989 ms 328844 KB Output is correct
57 Correct 956 ms 329464 KB Output is correct
58 Correct 858 ms 329988 KB Output is correct
59 Correct 954 ms 330148 KB Output is correct
60 Correct 848 ms 330280 KB Output is correct
61 Correct 719 ms 191472 KB Output is correct
62 Correct 1864 ms 56560 KB Output is correct
63 Correct 778 ms 285236 KB Output is correct
64 Correct 891 ms 289796 KB Output is correct
65 Correct 1462 ms 226392 KB Output is correct
66 Correct 1440 ms 226396 KB Output is correct
67 Correct 823 ms 330284 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Execution timed out 3073 ms 170188 KB Time limit exceeded
14 Halted 0 ms 0 KB -