oj.uz

답안 #904773

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
904773 2024-01-12T08:18:36 Z Tuanlinh123 Copy and Paste 3 (JOI22_copypaste3) C++17
30 / 100
 743 ms 431008 KB 
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;

const ll p=31, maxn=2505;
const long long Mod=1e9+7;
vector <ll> pos[maxn*maxn];
long long Hash[maxn][maxn], check[maxn*maxn];
ll pi[maxn][maxn], idx[maxn][maxn], cnt[maxn][maxn], R[maxn][maxn];

inline ll calc(ll l, ll r, ll q)
{
    ll id=idx[l][r], len=r-l+1;
    while (1)
    {
        ll p=upper_bound(pos[id].begin(), pos[id].end(), R[l][r])-pos[id].begin();
        if (p>=pos[id].size() || pos[id][p]+len-1>q) break;
        cnt[l][r]++, R[l][r]=pos[id][p]+len-1;
        // cout << cnt[l][r] << " " << R[l][r] << "\n";
    }
    return cnt[l][r];
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n; cin >> n;
    string s; cin >> s; s='$'+s;
    long long A, B, C; cin >> A >> B >> C;
    vector <long long> num;
    for (ll i=1; i<=n; i++)
    {
        for (ll j=i+1; j<=n; j++)
        {
            ll k=pi[i][j-1];
            while (k && s[i+k]!=s[j])
                k=pi[i][k-1];   
            pi[i][j]=k+(s[i+k]==s[j]);
        }
        for (ll j=i; j<=n; j++)
        {
            Hash[i][j]=(Hash[i][j-1]*p+s[j]-'a'+1)%Mod;
            num.pb(Hash[i][j]), R[i][j]=j, cnt[i][j]=1;
        }
    }
    sort(num.begin(), num.end());
    num.resize(unique(num.begin(), num.end())-num.begin());
    for (ll i=1; i<=n; i++)
        for (ll j=i; j<=n; j++)
        {
            idx[i][j]=lower_bound(num.begin(), num.end(), Hash[i][j])-num.begin();
            pos[idx[i][j]].pb(i);
        }
    for (ll len=1; len<=n; len++)
    {
        for (ll i=1; i+len<=n+1; i++)
        {
            ll j=i+len-1, crr=pi[i][j];
            if (check[idx[i][j]])
                continue;
            check[idx[i][j]]=A*len;
            if (i<j) check[idx[i][j]]=min({check[idx[i][j]], check[idx[i+1][j]]+A, check[idx[i][j-1]]+A});
            for (; crr; crr=pi[i][i+crr-1])
            {
                ll c=calc(i, i+crr-1, j);
                long long val=check[idx[i][i+crr-1]];
                check[idx[i][j]]=min(check[idx[i][j]], val+B+C*c+A*(len-crr*c));
            }
        }
    }
    cout << check[idx[1][n]];
}

Compilation message

copypaste3.cpp: In function 'long long int calc(long long int, long long int, long long int)':
copypaste3.cpp:23:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         if (p>=pos[id].size() || pos[id][p]+len-1>q) break;
      |             ~^~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 152920 KB Output is correct
2 Correct 47 ms 153052 KB Output is correct
3 Correct 48 ms 153048 KB Output is correct
4 Correct 47 ms 153020 KB Output is correct
5 Correct 47 ms 152912 KB Output is correct
6 Correct 51 ms 153036 KB Output is correct
7 Correct 53 ms 153008 KB Output is correct
8 Correct 50 ms 152920 KB Output is correct
9 Correct 51 ms 153052 KB Output is correct
10 Correct 50 ms 152912 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 157036 KB Output is correct
2 Correct 47 ms 153048 KB Output is correct
3 Correct 362 ms 346284 KB Output is correct
4 Correct 416 ms 363848 KB Output is correct
5 Correct 498 ms 388208 KB Output is correct
6 Correct 627 ms 409756 KB Output is correct
7 Correct 743 ms 431008 KB Output is correct
8 Correct 705 ms 430564 KB Output is correct
9 Correct 726 ms 431008 KB Output is correct
10 Correct 52 ms 152904 KB Output is correct
11 Correct 47 ms 153052 KB Output is correct
12 Correct 47 ms 153052 KB Output is correct
13 Correct 51 ms 152912 KB Output is correct
14 Correct 49 ms 152916 KB Output is correct
15 Correct 48 ms 155172 KB Output is correct
16 Correct 53 ms 159476 KB Output is correct
17 Correct 47 ms 152912 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 152920 KB Output is correct
2 Correct 47 ms 153052 KB Output is correct
3 Correct 48 ms 153048 KB Output is correct
4 Correct 47 ms 153020 KB Output is correct
5 Correct 47 ms 152912 KB Output is correct
6 Correct 51 ms 153036 KB Output is correct
7 Correct 53 ms 153008 KB Output is correct
8 Correct 50 ms 152920 KB Output is correct
9 Correct 51 ms 153052 KB Output is correct
10 Correct 50 ms 152912 KB Output is correct
11 Correct 51 ms 154960 KB Output is correct
12 Correct 48 ms 157264 KB Output is correct
13 Correct 49 ms 157276 KB Output is correct
14 Correct 49 ms 152916 KB Output is correct
15 Correct 50 ms 157272 KB Output is correct
16 Correct 49 ms 154960 KB Output is correct
17 Correct 49 ms 152912 KB Output is correct
18 Correct 46 ms 152968 KB Output is correct
19 Correct 48 ms 155228 KB Output is correct
20 Correct 48 ms 152984 KB Output is correct
21 Correct 50 ms 159316 KB Output is correct
22 Correct 48 ms 159484 KB Output is correct
23 Correct 49 ms 159312 KB Output is correct
24 Correct 52 ms 159480 KB Output is correct
25 Correct 50 ms 159692 KB Output is correct
26 Correct 52 ms 159476 KB Output is correct
27 Correct 52 ms 159320 KB Output is correct
28 Correct 49 ms 159408 KB Output is correct
29 Correct 48 ms 159312 KB Output is correct
30 Correct 50 ms 159472 KB Output is correct
31 Correct 49 ms 159476 KB Output is correct
32 Correct 51 ms 159472 KB Output is correct
33 Correct 48 ms 159280 KB Output is correct
34 Correct 49 ms 153176 KB Output is correct
35 Correct 46 ms 152924 KB Output is correct
36 Correct 49 ms 152916 KB Output is correct
37 Correct 51 ms 153168 KB Output is correct
38 Correct 48 ms 155216 KB Output is correct
39 Correct 51 ms 159312 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 152920 KB Output is correct
2 Correct 47 ms 153052 KB Output is correct
3 Correct 48 ms 153048 KB Output is correct
4 Correct 47 ms 153020 KB Output is correct
5 Correct 47 ms 152912 KB Output is correct
6 Correct 51 ms 153036 KB Output is correct
7 Correct 53 ms 153008 KB Output is correct
8 Correct 50 ms 152920 KB Output is correct
9 Correct 51 ms 153052 KB Output is correct
10 Correct 50 ms 152912 KB Output is correct
11 Correct 51 ms 154960 KB Output is correct
12 Correct 48 ms 157264 KB Output is correct
13 Correct 49 ms 157276 KB Output is correct
14 Correct 49 ms 152916 KB Output is correct
15 Correct 50 ms 157272 KB Output is correct
16 Correct 49 ms 154960 KB Output is correct
17 Correct 49 ms 152912 KB Output is correct
18 Correct 46 ms 152968 KB Output is correct
19 Correct 48 ms 155228 KB Output is correct
20 Correct 48 ms 152984 KB Output is correct
21 Correct 50 ms 159316 KB Output is correct
22 Correct 48 ms 159484 KB Output is correct
23 Correct 49 ms 159312 KB Output is correct
24 Correct 52 ms 159480 KB Output is correct
25 Correct 50 ms 159692 KB Output is correct
26 Correct 52 ms 159476 KB Output is correct
27 Correct 52 ms 159320 KB Output is correct
28 Correct 49 ms 159408 KB Output is correct
29 Correct 48 ms 159312 KB Output is correct
30 Correct 50 ms 159472 KB Output is correct
31 Correct 49 ms 159476 KB Output is correct
32 Correct 51 ms 159472 KB Output is correct
33 Correct 48 ms 159280 KB Output is correct
34 Correct 49 ms 153176 KB Output is correct
35 Correct 46 ms 152924 KB Output is correct
36 Correct 49 ms 152916 KB Output is correct
37 Correct 51 ms 153168 KB Output is correct
38 Correct 48 ms 155216 KB Output is correct
39 Correct 51 ms 159312 KB Output is correct
40 Correct 52 ms 160032 KB Output is correct
41 Correct 55 ms 167636 KB Output is correct
42 Correct 60 ms 168208 KB Output is correct
43 Correct 59 ms 168152 KB Output is correct
44 Correct 62 ms 168064 KB Output is correct
45 Correct 59 ms 168180 KB Output is correct
46 Correct 57 ms 168428 KB Output is correct
47 Correct 54 ms 167640 KB Output is correct
48 Correct 56 ms 167916 KB Output is correct
49 Correct 56 ms 167904 KB Output is correct
50 Correct 60 ms 167892 KB Output is correct
51 Correct 58 ms 167896 KB Output is correct
52 Correct 58 ms 168152 KB Output is correct
53 Correct 56 ms 168160 KB Output is correct

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 152920 KB Output is correct
2 Correct 47 ms 153052 KB Output is correct
3 Correct 48 ms 153048 KB Output is correct
4 Correct 47 ms 153020 KB Output is correct
5 Correct 47 ms 152912 KB Output is correct
6 Correct 51 ms 153036 KB Output is correct
7 Correct 53 ms 153008 KB Output is correct
8 Correct 50 ms 152920 KB Output is correct
9 Correct 51 ms 153052 KB Output is correct
10 Correct 50 ms 152912 KB Output is correct
11 Correct 51 ms 154960 KB Output is correct
12 Correct 48 ms 157264 KB Output is correct
13 Correct 49 ms 157276 KB Output is correct
14 Correct 49 ms 152916 KB Output is correct
15 Correct 50 ms 157272 KB Output is correct
16 Correct 49 ms 154960 KB Output is correct
17 Correct 49 ms 152912 KB Output is correct
18 Correct 46 ms 152968 KB Output is correct
19 Correct 48 ms 155228 KB Output is correct
20 Correct 48 ms 152984 KB Output is correct
21 Correct 50 ms 159316 KB Output is correct
22 Correct 48 ms 159484 KB Output is correct
23 Correct 49 ms 159312 KB Output is correct
24 Correct 52 ms 159480 KB Output is correct
25 Correct 50 ms 159692 KB Output is correct
26 Correct 52 ms 159476 KB Output is correct
27 Correct 52 ms 159320 KB Output is correct
28 Correct 49 ms 159408 KB Output is correct
29 Correct 48 ms 159312 KB Output is correct
30 Correct 50 ms 159472 KB Output is correct
31 Correct 49 ms 159476 KB Output is correct
32 Correct 51 ms 159472 KB Output is correct
33 Correct 48 ms 159280 KB Output is correct
34 Correct 49 ms 153176 KB Output is correct
35 Correct 46 ms 152924 KB Output is correct
36 Correct 49 ms 152916 KB Output is correct
37 Correct 51 ms 153168 KB Output is correct
38 Correct 48 ms 155216 KB Output is correct
39 Correct 51 ms 159312 KB Output is correct
40 Correct 52 ms 160032 KB Output is correct
41 Correct 55 ms 167636 KB Output is correct
42 Correct 60 ms 168208 KB Output is correct
43 Correct 59 ms 168152 KB Output is correct
44 Correct 62 ms 168064 KB Output is correct
45 Correct 59 ms 168180 KB Output is correct
46 Correct 57 ms 168428 KB Output is correct
47 Correct 54 ms 167640 KB Output is correct
48 Correct 56 ms 167916 KB Output is correct
49 Correct 56 ms 167904 KB Output is correct
50 Correct 60 ms 167892 KB Output is correct
51 Correct 58 ms 167896 KB Output is correct
52 Correct 58 ms 168152 KB Output is correct
53 Correct 56 ms 168160 KB Output is correct
54 Correct 99 ms 193628 KB Output is correct
55 Correct 126 ms 244068 KB Output is correct
56 Incorrect 373 ms 258084 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 152920 KB Output is correct
2 Correct 47 ms 153052 KB Output is correct
3 Correct 48 ms 153048 KB Output is correct
4 Correct 47 ms 153020 KB Output is correct
5 Correct 47 ms 152912 KB Output is correct
6 Correct 51 ms 153036 KB Output is correct
7 Correct 53 ms 153008 KB Output is correct
8 Correct 50 ms 152920 KB Output is correct
9 Correct 51 ms 153052 KB Output is correct
10 Correct 50 ms 152912 KB Output is correct
11 Correct 49 ms 157036 KB Output is correct
12 Correct 47 ms 153048 KB Output is correct
13 Correct 362 ms 346284 KB Output is correct
14 Correct 416 ms 363848 KB Output is correct
15 Correct 498 ms 388208 KB Output is correct
16 Correct 627 ms 409756 KB Output is correct
17 Correct 743 ms 431008 KB Output is correct
18 Correct 705 ms 430564 KB Output is correct
19 Correct 726 ms 431008 KB Output is correct
20 Correct 52 ms 152904 KB Output is correct
21 Correct 47 ms 153052 KB Output is correct
22 Correct 47 ms 153052 KB Output is correct
23 Correct 51 ms 152912 KB Output is correct
24 Correct 49 ms 152916 KB Output is correct
25 Correct 48 ms 155172 KB Output is correct
26 Correct 53 ms 159476 KB Output is correct
27 Correct 47 ms 152912 KB Output is correct
28 Correct 51 ms 154960 KB Output is correct
29 Correct 48 ms 157264 KB Output is correct
30 Correct 49 ms 157276 KB Output is correct
31 Correct 49 ms 152916 KB Output is correct
32 Correct 50 ms 157272 KB Output is correct
33 Correct 49 ms 154960 KB Output is correct
34 Correct 49 ms 152912 KB Output is correct
35 Correct 46 ms 152968 KB Output is correct
36 Correct 48 ms 155228 KB Output is correct
37 Correct 48 ms 152984 KB Output is correct
38 Correct 50 ms 159316 KB Output is correct
39 Correct 48 ms 159484 KB Output is correct
40 Correct 49 ms 159312 KB Output is correct
41 Correct 52 ms 159480 KB Output is correct
42 Correct 50 ms 159692 KB Output is correct
43 Correct 52 ms 159476 KB Output is correct
44 Correct 52 ms 159320 KB Output is correct
45 Correct 49 ms 159408 KB Output is correct
46 Correct 48 ms 159312 KB Output is correct
47 Correct 50 ms 159472 KB Output is correct
48 Correct 49 ms 159476 KB Output is correct
49 Correct 51 ms 159472 KB Output is correct
50 Correct 48 ms 159280 KB Output is correct
51 Correct 49 ms 153176 KB Output is correct
52 Correct 46 ms 152924 KB Output is correct
53 Correct 49 ms 152916 KB Output is correct
54 Correct 51 ms 153168 KB Output is correct
55 Correct 48 ms 155216 KB Output is correct
56 Correct 51 ms 159312 KB Output is correct
57 Correct 52 ms 160032 KB Output is correct
58 Correct 55 ms 167636 KB Output is correct
59 Correct 60 ms 168208 KB Output is correct
60 Correct 59 ms 168152 KB Output is correct
61 Correct 62 ms 168064 KB Output is correct
62 Correct 59 ms 168180 KB Output is correct
63 Correct 57 ms 168428 KB Output is correct
64 Correct 54 ms 167640 KB Output is correct
65 Correct 56 ms 167916 KB Output is correct
66 Correct 56 ms 167904 KB Output is correct
67 Correct 60 ms 167892 KB Output is correct
68 Correct 58 ms 167896 KB Output is correct
69 Correct 58 ms 168152 KB Output is correct
70 Correct 56 ms 168160 KB Output is correct
71 Correct 99 ms 193628 KB Output is correct
72 Correct 126 ms 244068 KB Output is correct
73 Incorrect 373 ms 258084 KB Output isn't correct
74 Halted 0 ms 0 KB -