oj.uz

답안 #549212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
549212 2022-04-15T12:16:45 Z Ronin13 Copy and Paste 3 (JOI22_copypaste3) C++14
62 / 100
 3000 ms 242596 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 = 3001 + 1;
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];
        }
    }
}

ll 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];
int adj[NMAX][NMAX];

map<pair<int, pii>, int> mp;
vector <pair<int, pii> > vec[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(auto to : vec[i - 1]) mp[to] = i - 1;
        for(int j = i; j <= n; j++){
            ll x = get(i, j, 0);
            ll x1 = get(i, j, 1);
            ll x2 = get(i, j, 2);
            int v = mp[{x, {x1, x2}}];
            if(v != 0)
            adj[i][j - i + 1] = v - (j - i);
            vec[j].pb({x, {x1, x2}});
        }
    }
    /*for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            cout << adj[i][j] << ' ';
        }
        cout << "\n";
    }*/
    vector <ll> v[NMAX];
    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 i = 1; i <= r; i++){
            int cur = r - i + 1;
            while(cur){
                v[cur].pb(i);
                cur = adj[cur][i];
            }
        }
        ll mn = 0;
        dp[r][r] = a;
        for(ll l = r; l >= 1; l--){
            for(ll to : v[l]){
                cnt[to]++;
                ll val = dp[r - to + 1][r] + b;
                val += (c - to * a) * cnt[to];
                mn = min(mn, val);
            }
            dp[l][r] = mn + (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;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 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 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 611 ms 71552 KB Output is correct
4 Correct 756 ms 81464 KB Output is correct
5 Correct 896 ms 93544 KB Output is correct
6 Correct 1053 ms 108808 KB Output is correct
7 Correct 1396 ms 125828 KB Output is correct
8 Correct 1373 ms 125756 KB Output is correct
9 Correct 1305 ms 125916 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 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 0 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 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 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 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 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 724 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 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 724 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 1 ms 468 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 0 ms 724 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 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 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 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 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 724 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 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 724 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 1 ms 468 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 0 ms 724 KB Output is correct
40 Correct 2 ms 1492 KB Output is correct
41 Correct 4 ms 2772 KB Output is correct
42 Correct 10 ms 3924 KB Output is correct
43 Correct 11 ms 4004 KB Output is correct
44 Correct 15 ms 3972 KB Output is correct
45 Correct 14 ms 3956 KB Output is correct
46 Correct 12 ms 3924 KB Output is correct
47 Correct 8 ms 3028 KB Output is correct
48 Correct 10 ms 3368 KB Output is correct
49 Correct 11 ms 3540 KB Output is correct
50 Correct 10 ms 3540 KB Output is correct
51 Correct 10 ms 3448 KB Output is correct
52 Correct 10 ms 3404 KB Output is correct
53 Correct 10 ms 3900 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 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 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 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 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 724 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 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 724 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 1 ms 468 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 0 ms 724 KB Output is correct
40 Correct 2 ms 1492 KB Output is correct
41 Correct 4 ms 2772 KB Output is correct
42 Correct 10 ms 3924 KB Output is correct
43 Correct 11 ms 4004 KB Output is correct
44 Correct 15 ms 3972 KB Output is correct
45 Correct 14 ms 3956 KB Output is correct
46 Correct 12 ms 3924 KB Output is correct
47 Correct 8 ms 3028 KB Output is correct
48 Correct 10 ms 3368 KB Output is correct
49 Correct 11 ms 3540 KB Output is correct
50 Correct 10 ms 3540 KB Output is correct
51 Correct 10 ms 3448 KB Output is correct
52 Correct 10 ms 3404 KB Output is correct
53 Correct 10 ms 3900 KB Output is correct
54 Correct 67 ms 13384 KB Output is correct
55 Correct 151 ms 25468 KB Output is correct
56 Correct 694 ms 55016 KB Output is correct
57 Correct 731 ms 55348 KB Output is correct
58 Correct 741 ms 55600 KB Output is correct
59 Correct 751 ms 55572 KB Output is correct
60 Correct 764 ms 55508 KB Output is correct
61 Correct 488 ms 39052 KB Output is correct
62 Correct 197 ms 25744 KB Output is correct
63 Correct 598 ms 48016 KB Output is correct
64 Correct 652 ms 48220 KB Output is correct
65 Correct 605 ms 40604 KB Output is correct
66 Correct 583 ms 40660 KB Output is correct
67 Correct 754 ms 55540 KB Output is correct

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 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 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 611 ms 71552 KB Output is correct
14 Correct 756 ms 81464 KB Output is correct
15 Correct 896 ms 93544 KB Output is correct
16 Correct 1053 ms 108808 KB Output is correct
17 Correct 1396 ms 125828 KB Output is correct
18 Correct 1373 ms 125756 KB Output is correct
19 Correct 1305 ms 125916 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 0 ms 468 KB Output is correct
23 Correct 1 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 0 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 468 KB Output is correct
36 Correct 0 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 724 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 724 KB Output is correct
45 Correct 1 ms 724 KB Output is correct
46 Correct 1 ms 724 KB Output is correct
47 Correct 1 ms 724 KB Output is correct
48 Correct 1 ms 724 KB Output is correct
49 Correct 1 ms 724 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 1 ms 468 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 0 ms 724 KB Output is correct
57 Correct 2 ms 1492 KB Output is correct
58 Correct 4 ms 2772 KB Output is correct
59 Correct 10 ms 3924 KB Output is correct
60 Correct 11 ms 4004 KB Output is correct
61 Correct 15 ms 3972 KB Output is correct
62 Correct 14 ms 3956 KB Output is correct
63 Correct 12 ms 3924 KB Output is correct
64 Correct 8 ms 3028 KB Output is correct
65 Correct 10 ms 3368 KB Output is correct
66 Correct 11 ms 3540 KB Output is correct
67 Correct 10 ms 3540 KB Output is correct
68 Correct 10 ms 3448 KB Output is correct
69 Correct 10 ms 3404 KB Output is correct
70 Correct 10 ms 3900 KB Output is correct
71 Correct 67 ms 13384 KB Output is correct
72 Correct 151 ms 25468 KB Output is correct
73 Correct 694 ms 55016 KB Output is correct
74 Correct 731 ms 55348 KB Output is correct
75 Correct 741 ms 55600 KB Output is correct
76 Correct 751 ms 55572 KB Output is correct
77 Correct 764 ms 55508 KB Output is correct
78 Correct 488 ms 39052 KB Output is correct
79 Correct 197 ms 25744 KB Output is correct
80 Correct 598 ms 48016 KB Output is correct
81 Correct 652 ms 48220 KB Output is correct
82 Correct 605 ms 40604 KB Output is correct
83 Correct 583 ms 40660 KB Output is correct
84 Correct 754 ms 55540 KB Output is correct
85 Correct 2549 ms 130676 KB Output is correct
86 Execution timed out 3086 ms 242596 KB Time limit exceeded
87 Halted 0 ms 0 KB -