답안 #788455

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788455	2023-07-20T08:51:07 Z	someone	Chorus (JOI23_chorus)	C++14	16 / 100	3 ms	1224 KB

chorus

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 5e3 + 42, INF = 1e12 + 42;

deque<int> imin, a, b;
vector<int> pre, upd[N];
int n, k, cumul[N], fi[N], dp[N][N];

int evalCHT(int x) {
    if(a.empty()) return INF;
    if((int)a.size() == 1)
        return a[0] * x + b[0];
    if(a[0] * x + b[0] > a[1] * x + b[1]) {
        a.pop_front();
        b.pop_front();
    }
    return a[0] * x + b[0];
}

void pushCHT(int A, int B) {
    int sz = (int)a.size();
    while(sz >= 2 && (B - b[sz-1]) * (a[sz-2] - a[sz-1]) <= (b[sz-1] - b[sz-2]) * (a[sz-1] - A)) {
        sz--;
        a.pop_back();
        b.pop_back();
    }
    a.push_back(A);
    b.push_back(B);
}

void add(int i, int nbG) {
    if(fi[i] == i)  {
        pushCHT(-i, dp[nbG-1][i] + i * fi[i] - cumul[fi[i]]);
        return;
    }
    upd[fi[i]].push_back(i);
    while(!imin.empty() && dp[nbG-1][imin.back()] > dp[nbG-1][i])
        imin.pop_back();
    imin.push_back(i);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int x = 0;
    cin >> n >> k;
    for(int i = 0; i < N; i++)
        fi[i] = N-1;
    for(int i = 0; i < 2*n; i++) {
        char c; cin >> c;
        if(c == 'A') {
            if(fi[x] == N-1)
                fi[x] = (int)pre.size();
            pre.push_back(x);
        } else {
            x++;
        }
    }
    for(int i = n-1; i > -1; i--)
        if(fi[i] == N-1)
            fi[i] = fi[i+1];
    for(int i = 0; i <= n; i++)
        fi[i] = max(fi[i], i);

    for(int i = 1; i <= n; i++)
        cumul[i] = cumul[i-1] + pre[i-1];
    for(int i = 1; i <= n; i++)
        dp[0][i] = INF;

    for(int nbG = 1; nbG <= k; nbG++) {
        a.clear();
        b.clear();
        imin.clear();
        for(int i = 0; i < N; i++)
            upd[i].clear();

        add(0, nbG);
        for(int i = 1; i <= n; i++) {
            for(int j : upd[i]) {
                pushCHT(-j, dp[nbG-1][j] + j * fi[j] - cumul[fi[j]]);
                if(!imin.empty() && imin[0] == j)
                    imin.pop_front();
            }
            dp[nbG][i] = evalCHT(i) + cumul[i];
            if(!imin.empty())
                dp[nbG][i] = min(dp[nbG][i], dp[nbG-1][imin[0]]);
            add(i, nbG);
        }
    }

    cout << dp[k][n] << '\n';
}

Subtask #1
16.0 / 16.0

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

Subtask #2
0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	452 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	452 KB	Output is correct
17	Correct	2 ms	724 KB	Output is correct
18	Incorrect	3 ms	1224 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	452 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	452 KB	Output is correct
17	Correct	2 ms	724 KB	Output is correct
18	Incorrect	3 ms	1224 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #4
0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	452 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	452 KB	Output is correct
17	Correct	2 ms	724 KB	Output is correct
18	Incorrect	3 ms	1224 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	452 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	452 KB	Output is correct
17	Correct	2 ms	724 KB	Output is correct
18	Incorrect	3 ms	1224 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

답안 #788455

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 0 / 24.0

Subtask #3 0 / 21.0

Subtask #4 0 / 26.0

Subtask #5 0 / 13.0

Subtask #1
16.0 / 16.0

Subtask #2
0 / 24.0

Subtask #3
0 / 21.0

Subtask #4
0 / 26.0

Subtask #5
0 / 13.0