oj.uz

답안 #549379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
549379 2022-04-15T17:37:17 Z Ronin13 Copy and Paste 3 (JOI22_copypaste3) C++14
62 / 100
 3000 ms 214300 KB 
#include<iostream>
#include<vector>
#include<math.h>
#include<map>
#pragma optimization("unroll-loops")
#pragma optimize("Ofast")
#pragma optimize("O3")
#pragma target("avx2,avx,fma")
#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];

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 j = i; j <= n; j++){
            int x = get(i, j, 0);
            int x1 = get(i, j, 1);
            int 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";
    }*/
    vector <int> 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(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:5: warning: ignoring '#pragma optimization ' [-Wunknown-pragmas]
    5 | #pragma optimization("unroll-loops")
      | 
copypaste3.cpp:6: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    6 | #pragma optimize("Ofast")
      | 
copypaste3.cpp:7: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    7 | #pragma optimize("O3")
      | 
copypaste3.cpp:8: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    8 | #pragma target("avx2,avx,fma")
      | 
copypaste3.cpp: In function 'int main()':
copypaste3.cpp:107:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |             for(int ind = 0; ind < v[l].size(); ind++){
      |                              ~~~~^~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 681 ms 60944 KB Output is correct
4 Correct 800 ms 69072 KB Output is correct
5 Correct 935 ms 76832 KB Output is correct
6 Correct 1194 ms 85784 KB Output is correct
7 Correct 1386 ms 95652 KB Output is correct
8 Correct 1434 ms 95732 KB Output is correct
9 Correct 1424 ms 95676 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 3 ms 596 KB Output is correct
17 Correct 0 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 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 340 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 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 2 ms 512 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 1 ms 468 KB Output is correct
17 Correct 1 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 1 ms 468 KB Output is correct
21 Correct 1 ms 616 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 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 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 340 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 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 2 ms 512 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 1 ms 468 KB Output is correct
17 Correct 1 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 1 ms 468 KB Output is correct
21 Correct 1 ms 616 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 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 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 5 ms 2644 KB Output is correct
42 Correct 13 ms 3720 KB Output is correct
43 Correct 12 ms 3796 KB Output is correct
44 Correct 11 ms 3816 KB Output is correct
45 Correct 11 ms 3796 KB Output is correct
46 Correct 11 ms 3696 KB Output is correct
47 Correct 7 ms 2900 KB Output is correct
48 Correct 9 ms 3284 KB Output is correct
49 Correct 12 ms 3436 KB Output is correct
50 Correct 11 ms 3440 KB Output is correct
51 Correct 9 ms 3208 KB Output is correct
52 Correct 10 ms 3284 KB Output is correct
53 Correct 10 ms 3808 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 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 340 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 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 2 ms 512 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 1 ms 468 KB Output is correct
17 Correct 1 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 1 ms 468 KB Output is correct
21 Correct 1 ms 616 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 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 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 5 ms 2644 KB Output is correct
42 Correct 13 ms 3720 KB Output is correct
43 Correct 12 ms 3796 KB Output is correct
44 Correct 11 ms 3816 KB Output is correct
45 Correct 11 ms 3796 KB Output is correct
46 Correct 11 ms 3696 KB Output is correct
47 Correct 7 ms 2900 KB Output is correct
48 Correct 9 ms 3284 KB Output is correct
49 Correct 12 ms 3436 KB Output is correct
50 Correct 11 ms 3440 KB Output is correct
51 Correct 9 ms 3208 KB Output is correct
52 Correct 10 ms 3284 KB Output is correct
53 Correct 10 ms 3808 KB Output is correct
54 Correct 80 ms 12780 KB Output is correct
55 Correct 147 ms 22372 KB Output is correct
56 Correct 854 ms 52472 KB Output is correct
57 Correct 797 ms 52864 KB Output is correct
58 Correct 829 ms 52860 KB Output is correct
59 Correct 818 ms 52860 KB Output is correct
60 Correct 813 ms 52972 KB Output is correct
61 Correct 567 ms 35552 KB Output is correct
62 Correct 173 ms 22516 KB Output is correct
63 Correct 693 ms 45168 KB Output is correct
64 Correct 672 ms 45580 KB Output is correct
65 Correct 573 ms 37384 KB Output is correct
66 Correct 619 ms 37412 KB Output is correct
67 Correct 783 ms 52940 KB Output is correct

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 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 340 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 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 2 ms 468 KB Output is correct
13 Correct 681 ms 60944 KB Output is correct
14 Correct 800 ms 69072 KB Output is correct
15 Correct 935 ms 76832 KB Output is correct
16 Correct 1194 ms 85784 KB Output is correct
17 Correct 1386 ms 95652 KB Output is correct
18 Correct 1434 ms 95732 KB Output is correct
19 Correct 1424 ms 95676 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 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 3 ms 596 KB Output is correct
27 Correct 0 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 512 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 1 ms 468 KB Output is correct
34 Correct 1 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 1 ms 468 KB Output is correct
38 Correct 1 ms 616 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 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 468 KB Output is correct
54 Correct 1 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 5 ms 2644 KB Output is correct
59 Correct 13 ms 3720 KB Output is correct
60 Correct 12 ms 3796 KB Output is correct
61 Correct 11 ms 3816 KB Output is correct
62 Correct 11 ms 3796 KB Output is correct
63 Correct 11 ms 3696 KB Output is correct
64 Correct 7 ms 2900 KB Output is correct
65 Correct 9 ms 3284 KB Output is correct
66 Correct 12 ms 3436 KB Output is correct
67 Correct 11 ms 3440 KB Output is correct
68 Correct 9 ms 3208 KB Output is correct
69 Correct 10 ms 3284 KB Output is correct
70 Correct 10 ms 3808 KB Output is correct
71 Correct 80 ms 12780 KB Output is correct
72 Correct 147 ms 22372 KB Output is correct
73 Correct 854 ms 52472 KB Output is correct
74 Correct 797 ms 52864 KB Output is correct
75 Correct 829 ms 52860 KB Output is correct
76 Correct 818 ms 52860 KB Output is correct
77 Correct 813 ms 52972 KB Output is correct
78 Correct 567 ms 35552 KB Output is correct
79 Correct 173 ms 22516 KB Output is correct
80 Correct 693 ms 45168 KB Output is correct
81 Correct 672 ms 45580 KB Output is correct
82 Correct 573 ms 37384 KB Output is correct
83 Correct 619 ms 37412 KB Output is correct
84 Correct 783 ms 52940 KB Output is correct
85 Correct 2525 ms 124216 KB Output is correct
86 Execution timed out 3079 ms 214300 KB Time limit exceeded
87 Halted 0 ms 0 KB -