oj.uz

Submission #1059856

# Submission time Handle Problem Language Result Execution time Memory
1059856 2024-08-15T08:43:05 Z vjudge1 Copy and Paste 3 (JOI22_copypaste3) C++17
30 / 100
 1322 ms 160012 KB 
#include <bits/stdc++.h>

using namespace std;
    
typedef long long ll;
const int  N = 2500 + 2;
struct H{
    int p,mod;
    vector<ll> h,inv;
    ll binpow(ll a,ll b) {
        ll ret = 1,k = a;
        while(b) {
            if(b & 1) {
                ret *= k;
                ret %= mod;
            }
            k *= k;
            k%=mod;
            b /= 2;
        }
        return ret;
    }
    void init(string s) {
        int n = (int)s.size();
        h.resize((int)s.size());
        inv.resize((int)s.size());
        ll x = 1;
        for(int i = 0;i < n;i++) {
            h[i] = x * 1ll * (s[i] - 'a' + 1)%mod;
            if(i) h[i] += h[i - 1];
            if(h[i] >= mod) h[i] -= mod;
            inv[i] = binpow(x,mod-2);
            x = x * 1ll * p%mod;
        }
    }
    int get(int l,int r) {
        ll val = h[r];
        if(l) {
            val -= h[l - 1];
        }
        if(val < 0) val += mod;
        val = val * inv[l]%mod;
        return val;
    }

}xx,yy;
string s;
ll a,b,c;
int n;
ll dp[N][N];
int nx[N][N];
map<pair<int,int>,vector<pair<int,int>>> f;
vector<array<int,3>> x;
void test() {
    cin >> n >> s >> a >> b >> c;
    yy.p = 37;yy.mod = 998244353;yy.init(s);
    xx.p = 167;xx.mod = (int)1e9 + 7;xx.init(s);
    bool sub = true;
    for(int i = 0;i < n;i++) {
        if(s[i] != 'a') {
            sub = false;
        }
    }
    ll res = n * 1ll * a;
    for(int i = 0;i < n;i++) {
        for(int j = i;j < n;j++) {
            int ff = xx.get(i,j),tt = yy.get(i,j);
            f[{xx.get(i,j)+yy.get(i,j),0}].push_back({i,j});
        }
    }
    for(int l = 0;l < n;l++) {
        for(int r = 0;r < n;r++) {
            dp[l][r] = 1e18;
        }
    }
    for(auto [t,k]:f) {
        int it = (int)k.size() - 1;
        for(int j = (int)k.size() - 1;j >= 0;j--) {
            while(it >= 0 && k[it].first > k[j].second) {
                it--;
            }
            if(it == (int)k.size() - 1) {
                nx[k[j].first][k[j].second] = -1; 
            } else {
                nx[k[j].first][k[j].second] = k[it + 1].first;
            }
        }
    }
    for(int l = 0;l < n;l++) {
        dp[l][l] = a;
        for(int r = l;r < n;r++) {
            x.push_back({r - l + 1,l,r});
        }
    }
    sort(x.begin(),x.end());
    for(auto [s,l,r]:x) {
        dp[l][r] = min({dp[l][r],dp[l + 1][r] + a,dp[l][r - 1] + a});
        int l_ = l,r_ = r;
        int occ = 1;
        int len = (r - l + 1);
        // cout << l << ' ' << r << ' ' << dp[l][r] << '\n';
        while(l_ != -1) {
            int sz = (r_ - l + 1);
            ll val = (sz - occ * 1ll * len) * 1ll * a + b + occ * c + dp[l][r];
            dp[l][r_] = min(dp[l][r_],val);
            occ++;
            l_ = nx[l_][r_];
            r_ = l_ + len - 1;
        }
    }
    cout << dp[0][n-1] << '\n';
}
signed main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) {
        test();
    }
}

Compilation message

copypaste3.cpp: In function 'void test()':
copypaste3.cpp:67:17: warning: unused variable 'ff' [-Wunused-variable]
   67 |             int ff = xx.get(i,j),tt = yy.get(i,j);
      |                 ^~
copypaste3.cpp:67:34: warning: unused variable 'tt' [-Wunused-variable]
   67 |             int ff = xx.get(i,j),tt = yy.get(i,j);
      |                                  ^~
copypaste3.cpp:58:10: warning: variable 'sub' set but not used [-Wunused-but-set-variable]
   58 |     bool sub = true;
      |          ^~~
copypaste3.cpp:64:8: warning: unused variable 'res' [-Wunused-variable]
   64 |     ll res = n * 1ll * a;
      |        ^~~

Subtask #1
1.0 / 1.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 612 ms 102872 KB Output is correct
4 Correct 705 ms 108916 KB Output is correct
5 Correct 978 ms 142528 KB Output is correct
6 Correct 1031 ms 150708 KB Output is correct
7 Correct 1273 ms 160012 KB Output is correct
8 Correct 1322 ms 159360 KB Output is correct
9 Correct 1241 ms 158196 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2428 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6748 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 1 ms 6748 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 0 ms 2396 KB Output is correct
36 Correct 0 ms 2396 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 0 ms 2396 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 2 ms 7004 KB Output is correct
41 Correct 5 ms 9500 KB Output is correct
42 Correct 10 ms 11296 KB Output is correct
43 Correct 10 ms 11220 KB Output is correct
44 Correct 11 ms 11292 KB Output is correct
45 Correct 13 ms 11292 KB Output is correct
46 Correct 10 ms 11268 KB Output is correct
47 Correct 7 ms 10016 KB Output is correct
48 Correct 10 ms 10524 KB Output is correct
49 Correct 10 ms 10700 KB Output is correct
50 Correct 10 ms 10784 KB Output is correct
51 Correct 9 ms 10524 KB Output is correct
52 Correct 9 ms 10524 KB Output is correct
53 Correct 10 ms 11392 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2428 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6748 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 1 ms 6748 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 0 ms 2396 KB Output is correct
36 Correct 0 ms 2396 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 0 ms 2396 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 2 ms 7004 KB Output is correct
41 Correct 5 ms 9500 KB Output is correct
42 Correct 10 ms 11296 KB Output is correct
43 Correct 10 ms 11220 KB Output is correct
44 Correct 11 ms 11292 KB Output is correct
45 Correct 13 ms 11292 KB Output is correct
46 Correct 10 ms 11268 KB Output is correct
47 Correct 7 ms 10016 KB Output is correct
48 Correct 10 ms 10524 KB Output is correct
49 Correct 10 ms 10700 KB Output is correct
50 Correct 10 ms 10784 KB Output is correct
51 Correct 9 ms 10524 KB Output is correct
52 Correct 9 ms 10524 KB Output is correct
53 Correct 10 ms 11392 KB Output is correct
54 Correct 66 ms 31180 KB Output is correct
55 Correct 147 ms 46556 KB Output is correct
56 Incorrect 497 ms 94660 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2428 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 612 ms 102872 KB Output is correct
14 Correct 705 ms 108916 KB Output is correct
15 Correct 978 ms 142528 KB Output is correct
16 Correct 1031 ms 150708 KB Output is correct
17 Correct 1273 ms 160012 KB Output is correct
18 Correct 1322 ms 159360 KB Output is correct
19 Correct 1241 ms 158196 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 6492 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 1 ms 6748 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 1 ms 6492 KB Output is correct
44 Correct 1 ms 6492 KB Output is correct
45 Correct 1 ms 6492 KB Output is correct
46 Correct 1 ms 6492 KB Output is correct
47 Correct 1 ms 6492 KB Output is correct
48 Correct 1 ms 6492 KB Output is correct
49 Correct 2 ms 6492 KB Output is correct
50 Correct 1 ms 6748 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 0 ms 2396 KB Output is correct
53 Correct 0 ms 2396 KB Output is correct
54 Correct 1 ms 2392 KB Output is correct
55 Correct 0 ms 2396 KB Output is correct
56 Correct 1 ms 6492 KB Output is correct
57 Correct 2 ms 7004 KB Output is correct
58 Correct 5 ms 9500 KB Output is correct
59 Correct 10 ms 11296 KB Output is correct
60 Correct 10 ms 11220 KB Output is correct
61 Correct 11 ms 11292 KB Output is correct
62 Correct 13 ms 11292 KB Output is correct
63 Correct 10 ms 11268 KB Output is correct
64 Correct 7 ms 10016 KB Output is correct
65 Correct 10 ms 10524 KB Output is correct
66 Correct 10 ms 10700 KB Output is correct
67 Correct 10 ms 10784 KB Output is correct
68 Correct 9 ms 10524 KB Output is correct
69 Correct 9 ms 10524 KB Output is correct
70 Correct 10 ms 11392 KB Output is correct
71 Correct 66 ms 31180 KB Output is correct
72 Correct 147 ms 46556 KB Output is correct
73 Incorrect 497 ms 94660 KB Output isn't correct
74 Halted 0 ms 0 KB -