oj.uz

Submission #1004183

# Submission time Handle Problem Language Result Execution time Memory
1004183 2024-06-21T06:12:02 Z De3b0o Copy and Paste 3 (JOI22_copypaste3) C++14
1 / 100
 3000 ms 2396 KB 
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*x)
#define rc (2*x+1)

using namespace std;

ll n;
string s;
ll A , B , C;
bool e[39][39][39][39];
ll dp[39][39];

ll solve(ll l , ll r)
{
    if(l>r)
        return 0;
    if(dp[l][r])
        return dp[l][r];
    ll ans = (r-l+1)*A;
    for(int i = l ; r>=i ; i++)
    {
        for(int j = i ; r>=j ; j++)
        {
            for(int i1 = j+1 ; r>=i1 ; i1++)
            {
                for(int j1 = i1 ; r>=j1 ; j1++)
                {
                    if((j1-i1+1)%(j-i+1)!=0)
                        continue;
                    bool g = 0;
                    for(int h = 0 ; (j1-i1+1)/(j-i+1)>h ; h++)
                    {
                        if(!e[i][j][i1+h*(j-i+1)][i1+(h+1)*(j-i+1)-1])
                            g=1;
                    }
                    if(g)
                        continue;
                    ll ans1 = (i-1-l+1)*A + solve(i,j) + B + C + A*(i1-j-1) + (j1-i1+1)/(j-i+1)*C + (r-(j1+1)+1)*A;
                    ans=min(ans,ans1);
                }
            }
        }
    }
    dp[l][r]=ans;
    return ans;
}

int main()
{
    d3
    cin >> n;
    cin >> s;
    cin >> A >> B >> C;
    for(int i = 0 ; n>i ; i++)
    {
        for(int j = i ; n>j ; j++)
        {
            for(int i1 = j+1 ; n>i1 ; i1++)
            {
                for(int j1 = i1 ; n>j1 ; j1++)
                {
                    if(j-i!=j1-i1)
                        continue;
                    e[i][j][i1][j1]=1;
                    for(int h = i ; j>=h ; h++)
                    {
                        if(s[h]!=s[i1+(h-i)])
                            e[i][j][i1][j1]=0;
                    }
                }
            }
        }
    }
    cout << solve(0,n-1);
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 3087 ms 1848 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Incorrect 0 ms 600 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Incorrect 0 ms 600 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Incorrect 0 ms 600 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Execution timed out 3087 ms 1848 KB Time limit exceeded
14 Halted 0 ms 0 KB -