oj.uz

Submission #1067024

# Submission time Handle Problem Language Result Execution time Memory
1067024 2024-08-20T09:51:48 Z GrindMachine Chorus (JOI23_chorus) C++17
16 / 100
 476 ms 1048576 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

read the edi some time ago, remember some ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    int n,k; cin >> n >> k;
    string s; cin >> s;
    s = "$" + s;
    n <<= 1;

    vector<int> p(n+5);
    rep1(i,n) p[i] = p[i-1]+(s[i]=='A');

    int dp[n+5][n+5][n+5][n+5][n+5];
    memset(dp,0x3f,sizeof dp);
    dp[0][0][0][0][0] = 0;

    rep(i,n){
        int x = p[i+1];
        rep(ignore_cnt,n+1){
            rep(ones,n+1){
                rep(active_ones,n+1){
                    rep(c,n+1){
                        int curr = dp[i][ignore_cnt][ones][active_ones][c];

                        // A
                        amin(dp[i+1][ignore_cnt][ones+1][active_ones+1][c+(active_ones==0)],curr+abs(ones+1-x));

                        // B
                        if(ignore_cnt){
                            amin(dp[i+1][ignore_cnt-1][ones][active_ones][c],curr+abs(ones-x));
                        }
                        else{
                            if(active_ones){
                                amin(dp[i+1][active_ones-1][ones][0][c],curr+abs(ones-x));
                            }
                        }
                    }
                }
            }
        }
    }

    int ans = inf1;
    rep(c,k+1){
        amin(ans,dp[n][0][n/2][0][c]);
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 26 ms 38672 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 10076 KB Output is correct
7 Correct 26 ms 38596 KB Output is correct
8 Correct 31 ms 38488 KB Output is correct
9 Correct 27 ms 38492 KB Output is correct
10 Correct 31 ms 38436 KB Output is correct
11 Correct 29 ms 38492 KB Output is correct
12 Correct 28 ms 38492 KB Output is correct
13 Correct 28 ms 38492 KB Output is correct
14 Correct 29 ms 38488 KB Output is correct
15 Correct 29 ms 38464 KB Output is correct
16 Correct 26 ms 38668 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 26 ms 38672 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 10076 KB Output is correct
7 Correct 26 ms 38596 KB Output is correct
8 Correct 31 ms 38488 KB Output is correct
9 Correct 27 ms 38492 KB Output is correct
10 Correct 31 ms 38436 KB Output is correct
11 Correct 29 ms 38492 KB Output is correct
12 Correct 28 ms 38492 KB Output is correct
13 Correct 28 ms 38492 KB Output is correct
14 Correct 29 ms 38488 KB Output is correct
15 Correct 29 ms 38464 KB Output is correct
16 Correct 26 ms 38668 KB Output is correct
17 Runtime error 476 ms 1048576 KB Execution killed with signal 9
18 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 26 ms 38672 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 10076 KB Output is correct
7 Correct 26 ms 38596 KB Output is correct
8 Correct 31 ms 38488 KB Output is correct
9 Correct 27 ms 38492 KB Output is correct
10 Correct 31 ms 38436 KB Output is correct
11 Correct 29 ms 38492 KB Output is correct
12 Correct 28 ms 38492 KB Output is correct
13 Correct 28 ms 38492 KB Output is correct
14 Correct 29 ms 38488 KB Output is correct
15 Correct 29 ms 38464 KB Output is correct
16 Correct 26 ms 38668 KB Output is correct
17 Runtime error 476 ms 1048576 KB Execution killed with signal 9
18 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 26 ms 38672 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 10076 KB Output is correct
7 Correct 26 ms 38596 KB Output is correct
8 Correct 31 ms 38488 KB Output is correct
9 Correct 27 ms 38492 KB Output is correct
10 Correct 31 ms 38436 KB Output is correct
11 Correct 29 ms 38492 KB Output is correct
12 Correct 28 ms 38492 KB Output is correct
13 Correct 28 ms 38492 KB Output is correct
14 Correct 29 ms 38488 KB Output is correct
15 Correct 29 ms 38464 KB Output is correct
16 Correct 26 ms 38668 KB Output is correct
17 Runtime error 476 ms 1048576 KB Execution killed with signal 9
18 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 26 ms 38672 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 10076 KB Output is correct
7 Correct 26 ms 38596 KB Output is correct
8 Correct 31 ms 38488 KB Output is correct
9 Correct 27 ms 38492 KB Output is correct
10 Correct 31 ms 38436 KB Output is correct
11 Correct 29 ms 38492 KB Output is correct
12 Correct 28 ms 38492 KB Output is correct
13 Correct 28 ms 38492 KB Output is correct
14 Correct 29 ms 38488 KB Output is correct
15 Correct 29 ms 38464 KB Output is correct
16 Correct 26 ms 38668 KB Output is correct
17 Runtime error 476 ms 1048576 KB Execution killed with signal 9
18 Halted 0 ms 0 KB -