oj.uz

Submission #549378

# Submission time Handle Problem Language Result Execution time Memory
549378 2022-04-15T17:36:59 Z toloraia Copy and Paste 3 (JOI22_copypaste3) C++14
62 / 100
 3000 ms 209220 KB 
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
 
const int NMAX = 2501;
const int inf = 1e9 + 1;
const ll linf = 1e18 + 1;
ll mod[] ={1000000007, 1000000009, 998244353};
ll pr[] = {29, 31, 37};
 
ll po[NMAX][3];
ll h[NMAX][3];
 
void hashing(string s){
    h[0][0] = 0;
    h[0][1] = 0;
    h[0][2] = 0;
    int n = s.size();
    for(int i = 1; i <= n; i++){
        ll x = s[i - 1] - 'a' + 1;
        for(int j = 0; j < 3; j++){
            h[i][j] = h[i - 1][j] * pr[j] + x;
            h[i][j] %= mod[j];
        }
    }
}
 
int get(int l, int r, int ind){
    ll x = h[r][ind] - h[l - 1][ind] * po[r - l + 1][ind];
    x %= mod[ind];
    x += mod[ind];
    x %= mod[ind];
    return x;
}
 
ll dp[NMAX][NMAX];
short adj[NMAX][NMAX];
 
map<pii, int> mp;
vector <pii> vec[NMAX];
 
    vector <int> v[NMAX];
int main(){
    po[0][0] = po[0][1] = po[0][2] = 1;
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    for(int k = 0; k < 3; k++){
    for(int i = 1; i <=n; i++){
        po[i][k] = po[i - 1][k] * pr[k];
        po[i][k] %= mod[k];
    }
    }
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= n; j++){
            dp[i][j] = linf;
        }
    }
    string s; cin >> s;
    ll a, b, c;
    cin >> a >> b >> c;
    hashing(s);
    for(int i = 1; i <= n; i++){
        for(pii to : vec[i - 1]) mp[to] = i - 1;
        for(int x,x1,v,j = i; j <= n; j++){
             x = get(i, j, 0);
             x1 = get(i, j, 1);
             v = mp[{x, x1}];
            if(v != 0)
            adj[i][j - i + 1] = v - (j - i);
            vec[j].pb({x, x1});
        }
    }
    /*for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            cout << adj[i][j] << ' ';
        }
        cout << "\n";
    }*/
    ll cnt[n + 1];
    for(ll r = 1; r <= n; r++){
        for(int i = 1; i <= n; i++)v[i].clear();
        for(int i = 0; i <= n; i++)cnt[i] = 0;
        for(int cur,i = 1; i <= r; i++){
            cur = r - i + 1;
            while(cur){
                v[cur].pb(i);
                cur = adj[cur][i];
            }
        }
        ll mn = 0;
        dp[r][r] = a;
        for(int l = r; l >= 1; l--){
            for(int ind = 0; ind < v[l].size(); ind++){
                int to = v[l][ind];
                cnt[to]++;
                ll val = dp[r - to + 1][r] + b;
                val += (c - (ll)to * a) * cnt[to];
                mn = min(mn, val);
            }
            dp[l][r] = mn + (ll)(r - l + 1) * a;
            dp[l][r] = min(dp[l][r], dp[l][r - 1] + a);
        }
    }
    /*for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(dp[i][j] == linf) cout << "-1 ";
            else cout << dp[i][j] << " ";
        }
        cout << "\n";
    }*/
    cout << dp[1][n];
    return 0;
}

Compilation message

copypaste3.cpp: In function 'int main()':
copypaste3.cpp:100:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |             for(int ind = 0; ind < v[l].size(); ind++){
      |                              ~~~~^~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 616 ms 60868 KB Output is correct
4 Correct 768 ms 69244 KB Output is correct
5 Correct 917 ms 76884 KB Output is correct
6 Correct 1087 ms 85748 KB Output is correct
7 Correct 1316 ms 95724 KB Output is correct
8 Correct 1277 ms 95664 KB Output is correct
9 Correct 1287 ms 95636 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 392 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 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 596 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 468 KB Output is correct
37 Correct 0 ms 468 KB Output is correct
38 Correct 1 ms 468 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 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 392 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 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 596 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 468 KB Output is correct
37 Correct 0 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 2 ms 1364 KB Output is correct
41 Correct 4 ms 2632 KB Output is correct
42 Correct 11 ms 3796 KB Output is correct
43 Correct 13 ms 3792 KB Output is correct
44 Correct 10 ms 3796 KB Output is correct
45 Correct 11 ms 3796 KB Output is correct
46 Correct 14 ms 3744 KB Output is correct
47 Correct 7 ms 2900 KB Output is correct
48 Correct 9 ms 3308 KB Output is correct
49 Correct 10 ms 3472 KB Output is correct
50 Correct 9 ms 3412 KB Output is correct
51 Correct 10 ms 3300 KB Output is correct
52 Correct 9 ms 3300 KB Output is correct
53 Correct 11 ms 3796 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 392 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 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 596 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 468 KB Output is correct
37 Correct 0 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 2 ms 1364 KB Output is correct
41 Correct 4 ms 2632 KB Output is correct
42 Correct 11 ms 3796 KB Output is correct
43 Correct 13 ms 3792 KB Output is correct
44 Correct 10 ms 3796 KB Output is correct
45 Correct 11 ms 3796 KB Output is correct
46 Correct 14 ms 3744 KB Output is correct
47 Correct 7 ms 2900 KB Output is correct
48 Correct 9 ms 3308 KB Output is correct
49 Correct 10 ms 3472 KB Output is correct
50 Correct 9 ms 3412 KB Output is correct
51 Correct 10 ms 3300 KB Output is correct
52 Correct 9 ms 3300 KB Output is correct
53 Correct 11 ms 3796 KB Output is correct
54 Correct 70 ms 12748 KB Output is correct
55 Correct 146 ms 22368 KB Output is correct
56 Correct 784 ms 52632 KB Output is correct
57 Correct 811 ms 52752 KB Output is correct
58 Correct 819 ms 52916 KB Output is correct
59 Correct 893 ms 52872 KB Output is correct
60 Correct 824 ms 52872 KB Output is correct
61 Correct 566 ms 35660 KB Output is correct
62 Correct 203 ms 22488 KB Output is correct
63 Correct 802 ms 45252 KB Output is correct
64 Correct 747 ms 45396 KB Output is correct
65 Correct 600 ms 37352 KB Output is correct
66 Correct 590 ms 37388 KB Output is correct
67 Correct 799 ms 52932 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 392 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 616 ms 60868 KB Output is correct
14 Correct 768 ms 69244 KB Output is correct
15 Correct 917 ms 76884 KB Output is correct
16 Correct 1087 ms 85748 KB Output is correct
17 Correct 1316 ms 95724 KB Output is correct
18 Correct 1277 ms 95664 KB Output is correct
19 Correct 1287 ms 95636 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 724 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 468 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 0 ms 468 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 0 ms 468 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 1 ms 724 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 1 ms 724 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 1 ms 596 KB Output is correct
44 Correct 1 ms 596 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 596 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 0 ms 468 KB Output is correct
54 Correct 0 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 596 KB Output is correct
57 Correct 2 ms 1364 KB Output is correct
58 Correct 4 ms 2632 KB Output is correct
59 Correct 11 ms 3796 KB Output is correct
60 Correct 13 ms 3792 KB Output is correct
61 Correct 10 ms 3796 KB Output is correct
62 Correct 11 ms 3796 KB Output is correct
63 Correct 14 ms 3744 KB Output is correct
64 Correct 7 ms 2900 KB Output is correct
65 Correct 9 ms 3308 KB Output is correct
66 Correct 10 ms 3472 KB Output is correct
67 Correct 9 ms 3412 KB Output is correct
68 Correct 10 ms 3300 KB Output is correct
69 Correct 9 ms 3300 KB Output is correct
70 Correct 11 ms 3796 KB Output is correct
71 Correct 70 ms 12748 KB Output is correct
72 Correct 146 ms 22368 KB Output is correct
73 Correct 784 ms 52632 KB Output is correct
74 Correct 811 ms 52752 KB Output is correct
75 Correct 819 ms 52916 KB Output is correct
76 Correct 893 ms 52872 KB Output is correct
77 Correct 824 ms 52872 KB Output is correct
78 Correct 566 ms 35660 KB Output is correct
79 Correct 203 ms 22488 KB Output is correct
80 Correct 802 ms 45252 KB Output is correct
81 Correct 747 ms 45396 KB Output is correct
82 Correct 600 ms 37352 KB Output is correct
83 Correct 590 ms 37388 KB Output is correct
84 Correct 799 ms 52932 KB Output is correct
85 Correct 2659 ms 124188 KB Output is correct
86 Execution timed out 3082 ms 209220 KB Time limit exceeded
87 Halted 0 ms 0 KB -