oj.uz

Submission #1004019

# Submission time Handle Problem Language Result Execution time Memory
1004019 2024-06-21T00:57:20 Z De3b0o Copy and Paste 3 (JOI22_copypaste3) C++14
5 / 100
 8 ms 484 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 , A , B , C;
string s;
ll ans;
ll dp[2509];

ll solve(ll x)
{
    if(dp[x])
        return dp[x];
    ll mn = x*A;
    for(int i = 1 ; x>i ; i++)
    {
        ll ans1 = solve(i) + B + (x/i)*C + solve(x%i);
        mn=min(ans1,mn);
    }
    dp[x]=mn;
    return dp[x];
}

int main()
{
    d3
    cin >> n;
    cin >> s;
    cin >> A >> B >> C;
    /*ll p;
    for(int i = 0 ; 12>i ; i++)
    {
        ll x = (1<<i);
        if(x>n)
            break;
        if(i==0)
        {
            ll ans1 = A+B + n*C;
            ans=min(ans1,ans);
            p=A;
            continue;
        }
        ll ans1;
        ll c = min(p+B+2*C,p+A*(x/2));
        ans1 = c + B + (n/x)*C;
        ans1 += n%x * A;
        ans=min(ans,ans1);
        p=c;
    }*/
    solve(n);
    ans=dp[n];
    if(n==3)
        ans=min(3*A,A+B+3*C);
    cans
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 6 ms 484 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 8 ms 484 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 456 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -