oj.uz

Submission #647326

# Submission time Handle Problem Language Result Execution time Memory
647326 2022-10-02T08:16:09 Z berr Necklace (Subtask 1-3) (BOI19_necklace1) C++17
85 / 85
 523 ms 283216 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
int sp[3005][3005], ps[3005][3005], p[3005][3005], ss[3005][3005];

void clear()
{
    memset(sp, 0, sizeof(sp));
    memset(ps, 0, sizeof(ps));
    memset(p, 0, sizeof(p));
    memset(ss, 0, sizeof(ss));
 
}

array<int, 3> solve(string s, string t)
{
    clear();

    array<int, 3> ans={0, 0, 0};
 
    int n=s.size(), m=t.size();
 
 
    for(int i=0; i<n; i++)
    for(int l=0; l<m; l++)
    if(s[i]==t[l]) p[i][l]=ss[i][l]=1;
        
    for(int i=1; i<n; i++)
    {
        for(int l=1; l<m; l++)
        {
            if(ss[i][l]) ss[i][l]+=ss[i-1][l-1];
        }
    }
 
    for(int i=n-2; i>=0; i--)
    {
        for(int l=m-2; l>=0; l--)
        {
            if( p[i][l]) p[i][l]+=p[i+1][l+1];
        }
    }
 
 
    for(int i=0; i<n; i++)
    {
        for(int l=0; l<m; l++)
        {
            sp[i][l-ss[i][l]+1]=max(sp[i][l-ss[i][l]+1], ss[i][l]);
            ps[i][l+p[i][l]-1]=max(ps[i][l+p[i][l]-1], p[i][l]);
        }
        
        for(int l=1; l<m; l++)
        {
            sp[i][l]=max(sp[i][l], sp[i][l-1]-1);
        }
        for(int l=m-2; l>=0; l--)
        {
            ps[i][l]=max(ps[i][l], ps[i][l+1]-1);
        }
    }
 
    for(int i=0; i<n-1; i++)
    {
        for(int l=1; l<m; l++)
        {
            if(sp[i][l]+ps[i+1][l-1]>ans[0])
            {
                ans={sp[i][l]+ps[i+1][l-1], i-sp[i][l]+1, l-ps[i+1][l-1]};
            }
        }
    }
 
    return ans;
}
 
 
int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
 
 
    string s, t; cin>>s>>t;
 
    array<int, 3> ans=solve(s, t);
    reverse(s.begin(), s.end());
 
    array<int, 3> ans2=solve(s, t);
    
    if(ans2[0]>ans[0])
    {
        ans[0]=ans2[0];
        ans[1]=(s.size()-ans2[1])-ans[0];
        ans[2]=ans2[2];
    }
 
 
    cout<<ans[0]<<"\n"<<ans[1]<<" "<<ans[2];
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 283044 KB Output is correct
2 Correct 141 ms 283008 KB Output is correct
3 Correct 166 ms 282960 KB Output is correct
4 Correct 176 ms 282972 KB Output is correct
5 Correct 141 ms 282956 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 283044 KB Output is correct
2 Correct 141 ms 283008 KB Output is correct
3 Correct 166 ms 282960 KB Output is correct
4 Correct 176 ms 282972 KB Output is correct
5 Correct 141 ms 282956 KB Output is correct
6 Correct 147 ms 283040 KB Output is correct
7 Correct 153 ms 282956 KB Output is correct
8 Correct 173 ms 282956 KB Output is correct
9 Correct 152 ms 283044 KB Output is correct
10 Correct 163 ms 283012 KB Output is correct
11 Correct 152 ms 283084 KB Output is correct
12 Correct 148 ms 283000 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 283044 KB Output is correct
2 Correct 141 ms 283008 KB Output is correct
3 Correct 166 ms 282960 KB Output is correct
4 Correct 176 ms 282972 KB Output is correct
5 Correct 141 ms 282956 KB Output is correct
6 Correct 147 ms 283040 KB Output is correct
7 Correct 153 ms 282956 KB Output is correct
8 Correct 173 ms 282956 KB Output is correct
9 Correct 152 ms 283044 KB Output is correct
10 Correct 163 ms 283012 KB Output is correct
11 Correct 152 ms 283084 KB Output is correct
12 Correct 148 ms 283000 KB Output is correct
13 Correct 495 ms 282968 KB Output is correct
14 Correct 510 ms 282972 KB Output is correct
15 Correct 499 ms 283064 KB Output is correct
16 Correct 523 ms 283060 KB Output is correct
17 Correct 493 ms 283216 KB Output is correct
18 Correct 506 ms 283060 KB Output is correct
19 Correct 494 ms 283060 KB Output is correct
20 Correct 505 ms 283064 KB Output is correct
21 Correct 491 ms 283064 KB Output is correct