oj.uz

답안 #1004254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004254 2024-06-21T06:50:30 Z De3b0o Copy and Paste 3 (JOI22_copypaste3) C++14
15 / 100
 3000 ms 110788 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[209][209][209][209];
ll dp[209][209];

ll solve(ll l , ll r)
{
    if(dp[l][r])
        return dp[l][r];
    ll ans = (r-l+1)*A;
    for(ll i = l ; r>i ; i++)
    {
        for(ll j = i ; r>j ; j++)
        {
            ll ans1 = solve(i,j) + B + (i-l)*A + C;
            for(ll h = j+1 ; r>=h ; h++)
            {
                ll i1 = h , j1 = h+j-i;
                if(e[i][j][i1][j1])
                {
                    ans1+=C;
                    h=j1;
                }
                else
                    ans1+=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++)
            {
                ll j1 = i1+(j-i);
                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;
                }
            }
        }
    }
    if(n>30)
        return n;
    cout << solve(0,n-1);
}

Subtask #1
1.0 / 1.0

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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 3047 ms 110788 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 0 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 0 ms 600 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 1372 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 3164 KB Output is correct
22 Correct 3 ms 3164 KB Output is correct
23 Correct 1 ms 3164 KB Output is correct
24 Correct 2 ms 3164 KB Output is correct
25 Correct 1 ms 3164 KB Output is correct
26 Correct 1 ms 3236 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 1 ms 3164 KB Output is correct
29 Correct 1 ms 3164 KB Output is correct
30 Correct 1 ms 3164 KB Output is correct
31 Correct 1 ms 3164 KB Output is correct
32 Correct 2 ms 3160 KB Output is correct
33 Correct 1 ms 3164 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 860 KB Output is correct
39 Correct 1 ms 3164 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 0 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 0 ms 600 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 1372 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 3164 KB Output is correct
22 Correct 3 ms 3164 KB Output is correct
23 Correct 1 ms 3164 KB Output is correct
24 Correct 2 ms 3164 KB Output is correct
25 Correct 1 ms 3164 KB Output is correct
26 Correct 1 ms 3236 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 1 ms 3164 KB Output is correct
29 Correct 1 ms 3164 KB Output is correct
30 Correct 1 ms 3164 KB Output is correct
31 Correct 1 ms 3164 KB Output is correct
32 Correct 2 ms 3160 KB Output is correct
33 Correct 1 ms 3164 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 860 KB Output is correct
39 Correct 1 ms 3164 KB Output is correct
40 Runtime error 19 ms 35420 KB Execution failed because the return code was nonzero
41 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 0 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 0 ms 600 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 1372 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 3164 KB Output is correct
22 Correct 3 ms 3164 KB Output is correct
23 Correct 1 ms 3164 KB Output is correct
24 Correct 2 ms 3164 KB Output is correct
25 Correct 1 ms 3164 KB Output is correct
26 Correct 1 ms 3236 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 1 ms 3164 KB Output is correct
29 Correct 1 ms 3164 KB Output is correct
30 Correct 1 ms 3164 KB Output is correct
31 Correct 1 ms 3164 KB Output is correct
32 Correct 2 ms 3160 KB Output is correct
33 Correct 1 ms 3164 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 860 KB Output is correct
39 Correct 1 ms 3164 KB Output is correct
40 Runtime error 19 ms 35420 KB Execution failed because the return code was nonzero
41 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 0 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 1116 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Execution timed out 3047 ms 110788 KB Time limit exceeded
14 Halted 0 ms 0 KB -