oj.uz

답안 #852088

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852088 2023-09-21T08:19:08 Z danikoynov Chorus (JOI23_chorus) C++14
40 / 100
 7000 ms 201744 KB 
/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const ll maxn = 5100;
const ll inf = 1e18;

ll n, k;
string s;

ll pos[2][maxn], pref[maxn];
/// ll dp[maxn][maxn];
/**

*/

void chmin(ll &var, ll val) /// careful for long long
{
    var = min(var, val);
}

ll costd[maxn][maxn];

void precalc()
{
    for (ll j = 1; j <= n; j ++)
    {
        ll tk = 0;
        for (ll fix = 1; fix <= n - j; fix ++)
        {
            if (pos[0][fix + j] > j * 2 + fix)
                tk += pos[0][fix + j] - (j * 2 + fix);
            costd[j + 1][j + fix] = tk;
        }
    }
}

ll cost(ll left, ll right)
{
    ll above = (left - 1) * 2;
    ll lf = left, rf = right;
    while(lf <= rf)
    {
        ll mf = (lf + rf) / 2;
        if (pos[0][mf] > above + (mf - left + 1))
            rf = mf - 1;
        else
            lf = mf + 1;
    }

    ll sum = pref[right] - pref[lf - 1];
    sum = sum - (right - lf + 1) * above;
    ll len = right - left + 1;
    ll sm = lf - left;
    sum = sum - (len) * (len + 1) / 2;
    sum = sum + (sm) * (sm + 1) / 2;
    /**for (ll i = lf; i <= right; i ++)
    {

            sum = sum + pos[0][i] - (above + (i - left + 1));
    }*/
    return sum;

}

/**void divide(ll row, ll left, ll right, ll optl, ll optr)
{
    if (left > right)
        return;

    ll mid = (left + right) / 2;
    ll opt = -1;
    for (ll j = optl; j <= min(optr, mid); j ++)
    {
        ll cur = dp[j - 1][row - 1] + costd[j][mid];
        if (cur < dp[mid][row])
        {
            dp[mid][row] = cur;
            opt = j;
        }
    }

    divide(row, left, mid - 1, optl, opt);
    divide(row, mid + 1, right, opt, optr);
}*/

ll dp[maxn], f[maxn];
pair < ll, ll > calc_dp(ll group_cost)
{
    for (int i = 1; i <= n; i ++)
    {
        dp[i] = inf;
        f[i] = 0;
    }

    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j <= i; j ++)
        {
            ll cur = dp[j - 1] + cost(j, i) + group_cost;
            if (cur < dp[i])
            {
                dp[i] = cur;
                f[i] = f[j - 1] + 1;
            }
        }
    }
    return {dp[n], f[n]};
}
void solve()
{
    cin >> n >> k >> s;

    s = "#" + s;
    ll cntA = 0, cntB = 0;
    for (ll i = 1; i <= 2 * n; i ++)
    {
        if (s[i] == 'A')
        {
            cntA ++;
            pos[0][cntA] = i;
            pref[cntA] = pref[cntA - 1] + i;
        }
        else
        {
            cntB ++;
            pos[1][cntB] = i;
        }
    }

    ///for (ll i = 0; i <= n; i ++)
       // for (ll j = 0; j <= n; j ++)
         //   dp[i][j] = 4 * n * n; /// careful for overflow

    precalc();

    /**ll cr = 0;
    for (ll j = 1; j <= n; j ++)
    {
        cr = cr + pos[0][j] - j;

        dp[j][1] = cr;
    }

    for (ll j = 2; j <= k; j ++)

    {
        divide(j, j, n, j, n);
    }*/


    ll lf = 0, rf = n * n * 4;
    while(lf <= rf)
    {
        ll mf = (lf + rf) / 2;
        pair < ll, ll > cur = calc_dp(mf);
        if (cur.second <= k)
            rf = mf - 1;
        else
            lf = mf + 1;
    }

    if (rf < 0)
    {
        pair < ll, ll > cur = calc_dp(0);
        cout << cur.first << endl;
        return;
    }
    pair < ll, ll > fs = calc_dp(rf);
    pair < ll, ll > ds = calc_dp(rf + 1);

    ll fs_val = fs.first - fs.second * rf;
    ll ds_val = ds.first - ds.second * (rf + 1);

    double part = (double)(fs.second - k) / (double)(fs.second - ds.second);
    double ans = (double)(fs_val) + part * (double)(ds_val - fs_val);
    ///cout << ds.first << "  " << ds.second << endl;
    ///cout << fs.first << "  " << fs.second << endl;
    cout << round(ans) << endl;
}

int main()
{
    speed();
    ///freopen("test.txt", "r", stdin);
    solve();
    return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2512 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2512 KB Output is correct
17 Correct 6 ms 8536 KB Output is correct
18 Correct 54 ms 21012 KB Output is correct
19 Correct 56 ms 20824 KB Output is correct
20 Correct 29 ms 20824 KB Output is correct
21 Correct 30 ms 20828 KB Output is correct
22 Correct 31 ms 20824 KB Output is correct
23 Correct 28 ms 20824 KB Output is correct
24 Correct 55 ms 20824 KB Output is correct
25 Correct 36 ms 21080 KB Output is correct
26 Correct 36 ms 20824 KB Output is correct
27 Correct 37 ms 21020 KB Output is correct
28 Correct 37 ms 20824 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2512 KB Output is correct
17 Correct 6 ms 8536 KB Output is correct
18 Correct 54 ms 21012 KB Output is correct
19 Correct 56 ms 20824 KB Output is correct
20 Correct 29 ms 20824 KB Output is correct
21 Correct 30 ms 20828 KB Output is correct
22 Correct 31 ms 20824 KB Output is correct
23 Correct 28 ms 20824 KB Output is correct
24 Correct 55 ms 20824 KB Output is correct
25 Correct 36 ms 21080 KB Output is correct
26 Correct 36 ms 20824 KB Output is correct
27 Correct 37 ms 21020 KB Output is correct
28 Correct 37 ms 20824 KB Output is correct
29 Correct 5426 ms 197684 KB Output is correct
30 Execution timed out 7071 ms 201744 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2512 KB Output is correct
17 Correct 6 ms 8536 KB Output is correct
18 Correct 54 ms 21012 KB Output is correct
19 Correct 56 ms 20824 KB Output is correct
20 Correct 29 ms 20824 KB Output is correct
21 Correct 30 ms 20828 KB Output is correct
22 Correct 31 ms 20824 KB Output is correct
23 Correct 28 ms 20824 KB Output is correct
24 Correct 55 ms 20824 KB Output is correct
25 Correct 36 ms 21080 KB Output is correct
26 Correct 36 ms 20824 KB Output is correct
27 Correct 37 ms 21020 KB Output is correct
28 Correct 37 ms 20824 KB Output is correct
29 Correct 5426 ms 197684 KB Output is correct
30 Execution timed out 7071 ms 201744 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2512 KB Output is correct
17 Correct 6 ms 8536 KB Output is correct
18 Correct 54 ms 21012 KB Output is correct
19 Correct 56 ms 20824 KB Output is correct
20 Correct 29 ms 20824 KB Output is correct
21 Correct 30 ms 20828 KB Output is correct
22 Correct 31 ms 20824 KB Output is correct
23 Correct 28 ms 20824 KB Output is correct
24 Correct 55 ms 20824 KB Output is correct
25 Correct 36 ms 21080 KB Output is correct
26 Correct 36 ms 20824 KB Output is correct
27 Correct 37 ms 21020 KB Output is correct
28 Correct 37 ms 20824 KB Output is correct
29 Correct 5426 ms 197684 KB Output is correct
30 Execution timed out 7071 ms 201744 KB Time limit exceeded
31 Halted 0 ms 0 KB -