답안 #578583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
578583	2022-06-17T10:22:03 Z	InternetPerson10	Copy and Paste 3 (JOI22_copypaste3)	C++17	57 / 100	3000 ms	330288 KB

copypaste3

#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) {
    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;
}

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;
    for(int i = x + (y - x + 1) / 2; i < y; i++) {
        int ctApps = getCtApps(x, y, i);
        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++) {
        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:80:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for(int j = 0; j < ne.size(); j++) {
      |                    ~~^~~~~~~~~~~
copypaste3.cpp:98:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |         for(int k = 0; k < v.size(); k++) {
      |                        ~~^~~~~~~~~~
copypaste3.cpp:102:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |             for(int k = 0; k < v.size(); k++) {
      |                            ~~^~~~~~~~~~

Subtask #1
1.0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	264 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 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	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	264 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 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	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 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	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	1 ms	468 KB	Output is correct
20	Correct	0 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	2 ms	596 KB	Output is correct
24	Correct	1 ms	596 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 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	596 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	396 KB	Output is correct
39	Correct	1 ms	596 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	264 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 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	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 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	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	1 ms	468 KB	Output is correct
20	Correct	0 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	2 ms	596 KB	Output is correct
24	Correct	1 ms	596 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 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	596 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	396 KB	Output is correct
39	Correct	1 ms	596 KB	Output is correct
40	Correct	5 ms	2132 KB	Output is correct
41	Correct	20 ms	3796 KB	Output is correct
42	Correct	27 ms	9228 KB	Output is correct
43	Correct	25 ms	9324 KB	Output is correct
44	Correct	28 ms	9436 KB	Output is correct
45	Correct	23 ms	9528 KB	Output is correct
46	Correct	22 ms	9484 KB	Output is correct
47	Correct	16 ms	5148 KB	Output is correct
48	Correct	19 ms	7240 KB	Output is correct
49	Correct	27 ms	8080 KB	Output is correct
50	Correct	24 ms	8252 KB	Output is correct
51	Correct	27 ms	7052 KB	Output is correct
52	Correct	22 ms	7156 KB	Output is correct
53	Correct	25 ms	9428 KB	Output is correct

Subtask #5
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	264 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 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	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 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	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	1 ms	468 KB	Output is correct
20	Correct	0 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	2 ms	596 KB	Output is correct
24	Correct	1 ms	596 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 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	596 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	396 KB	Output is correct
39	Correct	1 ms	596 KB	Output is correct
40	Correct	5 ms	2132 KB	Output is correct
41	Correct	20 ms	3796 KB	Output is correct
42	Correct	27 ms	9228 KB	Output is correct
43	Correct	25 ms	9324 KB	Output is correct
44	Correct	28 ms	9436 KB	Output is correct
45	Correct	23 ms	9528 KB	Output is correct
46	Correct	22 ms	9484 KB	Output is correct
47	Correct	16 ms	5148 KB	Output is correct
48	Correct	19 ms	7240 KB	Output is correct
49	Correct	27 ms	8080 KB	Output is correct
50	Correct	24 ms	8252 KB	Output is correct
51	Correct	27 ms	7052 KB	Output is correct
52	Correct	22 ms	7156 KB	Output is correct
53	Correct	25 ms	9428 KB	Output is correct
54	Correct	170 ms	49484 KB	Output is correct
55	Correct	2193 ms	54812 KB	Output is correct
56	Correct	1147 ms	328916 KB	Output is correct
57	Correct	1218 ms	329632 KB	Output is correct
58	Correct	1099 ms	329992 KB	Output is correct
59	Correct	1172 ms	330172 KB	Output is correct
60	Correct	1163 ms	330288 KB	Output is correct
61	Correct	1176 ms	191512 KB	Output is correct
62	Correct	1777 ms	56476 KB	Output is correct
63	Correct	1234 ms	285292 KB	Output is correct
64	Correct	1408 ms	289672 KB	Output is correct
65	Correct	1576 ms	226564 KB	Output is correct
66	Correct	1559 ms	226332 KB	Output is correct
67	Correct	1106 ms	330288 KB	Output is correct

Subtask #6
0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	264 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 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	0 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	0 ms	340 KB	Output is correct
13	Execution timed out	3104 ms	169996 KB	Time limit exceeded
14	Halted	0 ms	0 KB	-

답안 #578583

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 0 / 5.0

Subtask #3 14.0 / 14.0

Subtask #4 10.0 / 10.0

Subtask #5 32.0 / 32.0

Subtask #6 0 / 38.0

Subtask #1
1.0 / 1.0

Subtask #2
0 / 5.0

Subtask #3
14.0 / 14.0

Subtask #4
10.0 / 10.0

Subtask #5
32.0 / 32.0

Subtask #6
0 / 38.0