oj.uz

답안 #578567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578567 2022-06-17T09:55:02 Z InternetPerson10 Copy and Paste 3 (JOI22_copypaste3) C++17
25 / 100
 3000 ms 151656 KB 
#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

ll ans[2501][2501];

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

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

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;
    string s_in = s.substr(x + (y - x + 1) / 2, y - (x + (y - x + 1) / 2));
    reverse(s_in.begin(), s_in.end());
    for(int i = x + (y - x + 1) / 2; i < y; i++) {
        if(a * (y - i) < c) break;
        int str_idx = revma[s_in];
        s_in.pop_back();
        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;
        }
        assert(apps[str_idx][l] == i);
        int ctApps = 1;
        // Optimize with binary lifting if this is right
        /*
        while(apps[str_idx][l] >= x) {
            ctApps++;
            l = ne[str_idx][l];
            if(l == -1) break;
        }
        */
        // Optimized
        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);
                }
            }
        }
        int indivChars = y - x - ctApps * (y - i);
        best = min(best, f(i, y) + b + a * indivChars + c * ctApps);
    }
    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++) {
        for(int j = i+1; j <= n; j++) {
            string s2 = s.substr(i, j-i);
            if(!ma.count(s2)) {
                ma[s2] = ma.size();
                apps.push_back(vector<int>());
                siz.push_back(j-i);
            }
            apps[ma[s2]].push_back(i);
        }
    }
    for(auto p : ma) {
        string s2 = p.first;
        reverse(s2.begin(), s2.end());
        revma[s2] = p.second;
    }
    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:89:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     for(int j = 0; j < ne.size(); j++) {
      |                    ~~^~~~~~~~~~~
copypaste3.cpp:107:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |         for(int k = 0; k < v.size(); k++) {
      |                        ~~^~~~~~~~~~
copypaste3.cpp:111:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |             for(int k = 0; k < v.size(); k++) {
      |                            ~~^~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 3094 ms 151656 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 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 596 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 468 KB Output is correct
28 Correct 1 ms 468 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 596 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 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 596 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 468 KB Output is correct
28 Correct 1 ms 468 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 596 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 8 ms 2132 KB Output is correct
41 Correct 28 ms 2940 KB Output is correct
42 Correct 65 ms 11416 KB Output is correct
43 Correct 39 ms 11592 KB Output is correct
44 Correct 38 ms 11668 KB Output is correct
45 Correct 58 ms 11628 KB Output is correct
46 Correct 58 ms 11740 KB Output is correct
47 Correct 19 ms 5076 KB Output is correct
48 Correct 24 ms 8336 KB Output is correct
49 Correct 30 ms 9724 KB Output is correct
50 Correct 31 ms 9872 KB Output is correct
51 Correct 23 ms 8188 KB Output is correct
52 Correct 50 ms 8148 KB Output is correct
53 Correct 58 ms 11696 KB Output is correct

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 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 596 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 468 KB Output is correct
28 Correct 1 ms 468 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 596 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 8 ms 2132 KB Output is correct
41 Correct 28 ms 2940 KB Output is correct
42 Correct 65 ms 11416 KB Output is correct
43 Correct 39 ms 11592 KB Output is correct
44 Correct 38 ms 11668 KB Output is correct
45 Correct 58 ms 11628 KB Output is correct
46 Correct 58 ms 11740 KB Output is correct
47 Correct 19 ms 5076 KB Output is correct
48 Correct 24 ms 8336 KB Output is correct
49 Correct 30 ms 9724 KB Output is correct
50 Correct 31 ms 9872 KB Output is correct
51 Correct 23 ms 8188 KB Output is correct
52 Correct 50 ms 8148 KB Output is correct
53 Correct 58 ms 11696 KB Output is correct
54 Correct 518 ms 70756 KB Output is correct
55 Execution timed out 3076 ms 47536 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Execution timed out 3094 ms 151656 KB Time limit exceeded
14 Halted 0 ms 0 KB -