oj.uz

Submission #1108911

# Submission time Handle Problem Language Result Execution time Memory
1108911 2024-11-05T16:19:15 Z akim9905 Copy and Paste 3 (JOI22_copypaste3) C++17
20 / 100
 403 ms 134088 KB 
#include <bits/stdc++.h>
using namespace std;

#define fileio() freopen("input.txt","r",stdin); freopen("output.txt","w",stdout)
#define fio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(x) (x).begin(), (x).end()
#define allr(x) x.rbegin(), x.rend()
#define cmprs(x) sort(all(x)),x.erase(unique(all(x)),x.end())
#define endl "\n"
#define sp " "
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define rz resize
#define sz(a) (int)(a.size())
#define clr(a) a.clear()

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef tuple<int, int, int> tpi;
typedef tuple<ll, ll, ll> tpl;
typedef pair<double, ll> pdl;
typedef pair<double, int> pdi;

const int dx[] = {1,-1,0,0,1,1,-1,-1};
const int dy[] = {0,0,1,-1,1,-1,1,-1};
const ll MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MAX = 2525; // PLZ CHK!

template <ll P, ll M> struct Hash {
    vector<ll> H,B;
    void build(const string &S) {
        H.resize(sz(S)+1), B.resize(sz(S)+1);
        B[0]=1;
        for (int i=1; i<=sz(S); i++) H[i]=(H[i-1]*P+S[i-1])%M;
        for (int i=1; i<=sz(S); i++) B[i]=B[i-1]*P%M;
    }

    ll get(int s, int e) {
        return (H[e]-H[s-1]*B[e-s+1]%M+M)%M;
    }
};

Hash<1299709, 1'000'000'007> H;

int N;

ll A,B,C,D[MAX][MAX],I[MAX][MAX];
string S;

int main() {
    fio();

    cin>>N>>S>>A>>B>>C;
    H.build(S);
    S=' '+S;

    map<ll,vector<pii>> idx;
    for (int i=1; i<=N; i++) {
        for (int j=i; j<=N; j++) {
            idx[H.get(i,j)].pb({i,j});   
        }
    }

    fill_n(&I[0][0],MAX*MAX,LINF);
    for (auto &[t,v]:idx) {
        for (int i=0; i<sz(v); i++) {
            auto [s,e]=v[i];
            int t=lb(all(v),pii{e+1,-1})-v.begin();
            if (t<sz(v)) I[s][e]=v[t].first;
        }
    }

    fill_n(&D[0][0],MAX*MAX,LINF);

    for (int i=1; i<=N; i++) D[i][i]=A+B;
    for (int i=1; i<=N; i++) {
        for (int l=1,r=l+i-1; r<=N; l++,r++) {
            if (l>1) D[l-1][r]=min(D[l-1][r], A+D[l][r]);
            if (r<N) D[l][r+1]=min(D[l][r+1], A+D[l][r]);

            int cur=I[l][r], cnt=2;
            while (cur+i-1<=N) {
                D[l][cur+i-1]=min(D[l][cur+i-1], D[l][r]+C*cnt+A*(cur+i-l-cnt*i)+B);
                cnt++,cur=I[cur][cur+i-1];
            }
        }
    }

    cout<<D[1][N]-B;

    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 100176 KB Output is correct
2 Correct 16 ms 100176 KB Output is correct
3 Correct 14 ms 100144 KB Output is correct
4 Correct 14 ms 100176 KB Output is correct
5 Correct 15 ms 100176 KB Output is correct
6 Correct 15 ms 100116 KB Output is correct
7 Correct 14 ms 100176 KB Output is correct
8 Correct 13 ms 100084 KB Output is correct
9 Correct 14 ms 100176 KB Output is correct
10 Correct 14 ms 100052 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 100176 KB Output is correct
2 Correct 13 ms 100176 KB Output is correct
3 Correct 174 ms 118516 KB Output is correct
4 Correct 216 ms 120772 KB Output is correct
5 Correct 256 ms 124232 KB Output is correct
6 Correct 315 ms 128584 KB Output is correct
7 Correct 388 ms 133880 KB Output is correct
8 Correct 403 ms 133948 KB Output is correct
9 Correct 372 ms 134088 KB Output is correct
10 Correct 13 ms 100176 KB Output is correct
11 Correct 14 ms 100176 KB Output is correct
12 Correct 14 ms 100144 KB Output is correct
13 Correct 14 ms 100176 KB Output is correct
14 Correct 15 ms 100128 KB Output is correct
15 Correct 15 ms 100176 KB Output is correct
16 Correct 14 ms 100176 KB Output is correct
17 Correct 13 ms 100096 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 100176 KB Output is correct
2 Correct 16 ms 100176 KB Output is correct
3 Correct 14 ms 100144 KB Output is correct
4 Correct 14 ms 100176 KB Output is correct
5 Correct 15 ms 100176 KB Output is correct
6 Correct 15 ms 100116 KB Output is correct
7 Correct 14 ms 100176 KB Output is correct
8 Correct 13 ms 100084 KB Output is correct
9 Correct 14 ms 100176 KB Output is correct
10 Correct 14 ms 100052 KB Output is correct
11 Correct 14 ms 100344 KB Output is correct
12 Correct 14 ms 100176 KB Output is correct
13 Correct 13 ms 100176 KB Output is correct
14 Correct 12 ms 100100 KB Output is correct
15 Correct 12 ms 100176 KB Output is correct
16 Correct 12 ms 100176 KB Output is correct
17 Correct 12 ms 100176 KB Output is correct
18 Correct 13 ms 100176 KB Output is correct
19 Correct 15 ms 100048 KB Output is correct
20 Correct 13 ms 100344 KB Output is correct
21 Correct 13 ms 100176 KB Output is correct
22 Correct 13 ms 100132 KB Output is correct
23 Correct 12 ms 100176 KB Output is correct
24 Correct 12 ms 100324 KB Output is correct
25 Correct 12 ms 100176 KB Output is correct
26 Correct 13 ms 100176 KB Output is correct
27 Correct 12 ms 100176 KB Output is correct
28 Correct 13 ms 100052 KB Output is correct
29 Correct 13 ms 100176 KB Output is correct
30 Correct 13 ms 100092 KB Output is correct
31 Correct 13 ms 100344 KB Output is correct
32 Correct 13 ms 100344 KB Output is correct
33 Correct 13 ms 100168 KB Output is correct
34 Correct 12 ms 100176 KB Output is correct
35 Correct 12 ms 100176 KB Output is correct
36 Correct 12 ms 100176 KB Output is correct
37 Correct 12 ms 100176 KB Output is correct
38 Correct 12 ms 100176 KB Output is correct
39 Correct 12 ms 100176 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 100176 KB Output is correct
2 Correct 16 ms 100176 KB Output is correct
3 Correct 14 ms 100144 KB Output is correct
4 Correct 14 ms 100176 KB Output is correct
5 Correct 15 ms 100176 KB Output is correct
6 Correct 15 ms 100116 KB Output is correct
7 Correct 14 ms 100176 KB Output is correct
8 Correct 13 ms 100084 KB Output is correct
9 Correct 14 ms 100176 KB Output is correct
10 Correct 14 ms 100052 KB Output is correct
11 Correct 14 ms 100344 KB Output is correct
12 Correct 14 ms 100176 KB Output is correct
13 Correct 13 ms 100176 KB Output is correct
14 Correct 12 ms 100100 KB Output is correct
15 Correct 12 ms 100176 KB Output is correct
16 Correct 12 ms 100176 KB Output is correct
17 Correct 12 ms 100176 KB Output is correct
18 Correct 13 ms 100176 KB Output is correct
19 Correct 15 ms 100048 KB Output is correct
20 Correct 13 ms 100344 KB Output is correct
21 Correct 13 ms 100176 KB Output is correct
22 Correct 13 ms 100132 KB Output is correct
23 Correct 12 ms 100176 KB Output is correct
24 Correct 12 ms 100324 KB Output is correct
25 Correct 12 ms 100176 KB Output is correct
26 Correct 13 ms 100176 KB Output is correct
27 Correct 12 ms 100176 KB Output is correct
28 Correct 13 ms 100052 KB Output is correct
29 Correct 13 ms 100176 KB Output is correct
30 Correct 13 ms 100092 KB Output is correct
31 Correct 13 ms 100344 KB Output is correct
32 Correct 13 ms 100344 KB Output is correct
33 Correct 13 ms 100168 KB Output is correct
34 Correct 12 ms 100176 KB Output is correct
35 Correct 12 ms 100176 KB Output is correct
36 Correct 12 ms 100176 KB Output is correct
37 Correct 12 ms 100176 KB Output is correct
38 Correct 12 ms 100176 KB Output is correct
39 Correct 12 ms 100176 KB Output is correct
40 Correct 17 ms 100688 KB Output is correct
41 Correct 17 ms 100532 KB Output is correct
42 Correct 23 ms 102136 KB Output is correct
43 Correct 25 ms 102224 KB Output is correct
44 Correct 22 ms 102216 KB Output is correct
45 Incorrect 21 ms 102236 KB Output isn't correct
46 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 100176 KB Output is correct
2 Correct 16 ms 100176 KB Output is correct
3 Correct 14 ms 100144 KB Output is correct
4 Correct 14 ms 100176 KB Output is correct
5 Correct 15 ms 100176 KB Output is correct
6 Correct 15 ms 100116 KB Output is correct
7 Correct 14 ms 100176 KB Output is correct
8 Correct 13 ms 100084 KB Output is correct
9 Correct 14 ms 100176 KB Output is correct
10 Correct 14 ms 100052 KB Output is correct
11 Correct 14 ms 100344 KB Output is correct
12 Correct 14 ms 100176 KB Output is correct
13 Correct 13 ms 100176 KB Output is correct
14 Correct 12 ms 100100 KB Output is correct
15 Correct 12 ms 100176 KB Output is correct
16 Correct 12 ms 100176 KB Output is correct
17 Correct 12 ms 100176 KB Output is correct
18 Correct 13 ms 100176 KB Output is correct
19 Correct 15 ms 100048 KB Output is correct
20 Correct 13 ms 100344 KB Output is correct
21 Correct 13 ms 100176 KB Output is correct
22 Correct 13 ms 100132 KB Output is correct
23 Correct 12 ms 100176 KB Output is correct
24 Correct 12 ms 100324 KB Output is correct
25 Correct 12 ms 100176 KB Output is correct
26 Correct 13 ms 100176 KB Output is correct
27 Correct 12 ms 100176 KB Output is correct
28 Correct 13 ms 100052 KB Output is correct
29 Correct 13 ms 100176 KB Output is correct
30 Correct 13 ms 100092 KB Output is correct
31 Correct 13 ms 100344 KB Output is correct
32 Correct 13 ms 100344 KB Output is correct
33 Correct 13 ms 100168 KB Output is correct
34 Correct 12 ms 100176 KB Output is correct
35 Correct 12 ms 100176 KB Output is correct
36 Correct 12 ms 100176 KB Output is correct
37 Correct 12 ms 100176 KB Output is correct
38 Correct 12 ms 100176 KB Output is correct
39 Correct 12 ms 100176 KB Output is correct
40 Correct 17 ms 100688 KB Output is correct
41 Correct 17 ms 100532 KB Output is correct
42 Correct 23 ms 102136 KB Output is correct
43 Correct 25 ms 102224 KB Output is correct
44 Correct 22 ms 102216 KB Output is correct
45 Incorrect 21 ms 102236 KB Output isn't correct
46 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 100176 KB Output is correct
2 Correct 16 ms 100176 KB Output is correct
3 Correct 14 ms 100144 KB Output is correct
4 Correct 14 ms 100176 KB Output is correct
5 Correct 15 ms 100176 KB Output is correct
6 Correct 15 ms 100116 KB Output is correct
7 Correct 14 ms 100176 KB Output is correct
8 Correct 13 ms 100084 KB Output is correct
9 Correct 14 ms 100176 KB Output is correct
10 Correct 14 ms 100052 KB Output is correct
11 Correct 15 ms 100176 KB Output is correct
12 Correct 13 ms 100176 KB Output is correct
13 Correct 174 ms 118516 KB Output is correct
14 Correct 216 ms 120772 KB Output is correct
15 Correct 256 ms 124232 KB Output is correct
16 Correct 315 ms 128584 KB Output is correct
17 Correct 388 ms 133880 KB Output is correct
18 Correct 403 ms 133948 KB Output is correct
19 Correct 372 ms 134088 KB Output is correct
20 Correct 13 ms 100176 KB Output is correct
21 Correct 14 ms 100176 KB Output is correct
22 Correct 14 ms 100144 KB Output is correct
23 Correct 14 ms 100176 KB Output is correct
24 Correct 15 ms 100128 KB Output is correct
25 Correct 15 ms 100176 KB Output is correct
26 Correct 14 ms 100176 KB Output is correct
27 Correct 13 ms 100096 KB Output is correct
28 Correct 14 ms 100344 KB Output is correct
29 Correct 14 ms 100176 KB Output is correct
30 Correct 13 ms 100176 KB Output is correct
31 Correct 12 ms 100100 KB Output is correct
32 Correct 12 ms 100176 KB Output is correct
33 Correct 12 ms 100176 KB Output is correct
34 Correct 12 ms 100176 KB Output is correct
35 Correct 13 ms 100176 KB Output is correct
36 Correct 15 ms 100048 KB Output is correct
37 Correct 13 ms 100344 KB Output is correct
38 Correct 13 ms 100176 KB Output is correct
39 Correct 13 ms 100132 KB Output is correct
40 Correct 12 ms 100176 KB Output is correct
41 Correct 12 ms 100324 KB Output is correct
42 Correct 12 ms 100176 KB Output is correct
43 Correct 13 ms 100176 KB Output is correct
44 Correct 12 ms 100176 KB Output is correct
45 Correct 13 ms 100052 KB Output is correct
46 Correct 13 ms 100176 KB Output is correct
47 Correct 13 ms 100092 KB Output is correct
48 Correct 13 ms 100344 KB Output is correct
49 Correct 13 ms 100344 KB Output is correct
50 Correct 13 ms 100168 KB Output is correct
51 Correct 12 ms 100176 KB Output is correct
52 Correct 12 ms 100176 KB Output is correct
53 Correct 12 ms 100176 KB Output is correct
54 Correct 12 ms 100176 KB Output is correct
55 Correct 12 ms 100176 KB Output is correct
56 Correct 12 ms 100176 KB Output is correct
57 Correct 17 ms 100688 KB Output is correct
58 Correct 17 ms 100532 KB Output is correct
59 Correct 23 ms 102136 KB Output is correct
60 Correct 25 ms 102224 KB Output is correct
61 Correct 22 ms 102216 KB Output is correct
62 Incorrect 21 ms 102236 KB Output isn't correct
63 Halted 0 ms 0 KB -