Submission #825384

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
825384	2023-08-14T19:10:25 Z	grogu	Chorus (JOI23_chorus)	C++14	40 / 100	38 ms	4460 KB

chorus

#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include <bits/stdc++.h>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define eb emplace_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}
#define si(a) (ll)(a.size())
using namespace std;


#define maxn 5005
ll n,k;
ll a[maxn];
ll c[maxn];
ll ps[maxn];
ll sz = 0;
ll dp[maxn][maxn];
struct line{
    ll n,k;
    line(){n = llinf;k = 0;}
    line(ll n_,ll k_){n = n_,k = k_;}
    ll operator()(ll x){
        return k*x+n;
    }
};
line t[2*maxn];
ll ls[2*maxn],rs[2*maxn],tsz = 0,root = 0;
void init(ll &v,ll tl,ll tr){
    if(!v) v = ++tsz;
    t[v] = line();
    if(tl==tr) return;
    ll mid = (tl+tr)/2;
    init(ls[v],tl,mid);
    init(rs[v],mid+1,tr);
}
void upd(ll v,ll tl,ll tr,line f){
    line g = t[v];
    if(tl==tr){
        if(f(tl)<g(tl)) t[v] = f;
        return;
    }
    ll mid = (tl+tr)/2;
    if(f(tl)>g(tl)) swap(f,g);
    if(f(mid)<=g(mid)){t[v] = f;upd(rs[v],mid+1,tr,g);}
    else{t[v] = g;upd(ls[v],tl,mid,f);}
}
ll get(ll v,ll tl,ll tr,ll i){
    if(tl==tr) return t[v](i);
    ll mid = (tl+tr)/2;
    if(i<=mid) return min(get(ls[v],tl,mid,i),t[v](i));
    return min(get(rs[v],mid+1,tr,i),t[v](i));
}
int main(){
	ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
    cin >> n >> k;
    string s; cin >> s;
    for(ll i = 1;i<=2*n;i++){
        if(s[i-1]=='A') a[i] = 1;
    }
    ll b = 0;
    for(ll i = 2*n;i>=1;i--){
        if(a[i]==1){
            c[++sz] = b;
        }else b++;
    }
    for(ll i = 1;i<=n;i++) ps[i] = ps[i-1] + c[i];
    dp[0][0] = 0;
    for(ll i = 1;i<=n;i++) dp[i][0] = dp[0][i] = llinf;
    ll e = 0;
    for(ll j = 1;j<=k;j++){
        multiset<ll> s;
        init(root,1,n);
        e = 1;
        s.insert(dp[0][j-1]);
        for(ll i = 1;i<=n;i++){
            while(e<=i&&c[e]<=i){
                s.erase(s.find(dp[e-1][j-1]));
                line f(ps[e-1]+dp[e-1][j-1],-e);
                upd(root,1,n,f);
                e++;
            }
            dp[i][j] = llinf;
            if(si(s)) dp[i][j] = *s.begin();
            dp[i][j] = min(dp[i][j],get(root,1,n,i) - ps[e-1] + e*i);
            s.insert(dp[i][j-1]);
        }
    }
    //for(ll i = 0;i<=n;i++) ceri(dp[i],0,k);
    cout<<dp[n][k]<<endl;
	return (0-0);
}
/**
5 2
AABABABBAB

**/

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	468 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	468 KB	Output is correct
7	Correct	0 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	0 ms	468 KB	Output is correct
10	Correct	0 ms	468 KB	Output is correct
11	Correct	0 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct

Subtask #2
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	468 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	468 KB	Output is correct
7	Correct	0 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	0 ms	468 KB	Output is correct
10	Correct	0 ms	468 KB	Output is correct
11	Correct	0 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	2 ms	1236 KB	Output is correct
18	Correct	9 ms	2852 KB	Output is correct
19	Correct	26 ms	3532 KB	Output is correct
20	Correct	1 ms	2544 KB	Output is correct
21	Correct	1 ms	2516 KB	Output is correct
22	Correct	29 ms	4460 KB	Output is correct
23	Correct	38 ms	4428 KB	Output is correct
24	Correct	2 ms	2516 KB	Output is correct
25	Correct	35 ms	4456 KB	Output is correct
26	Correct	27 ms	4140 KB	Output is correct
27	Correct	13 ms	3224 KB	Output is correct
28	Correct	13 ms	3108 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	468 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	468 KB	Output is correct
7	Correct	0 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	0 ms	468 KB	Output is correct
10	Correct	0 ms	468 KB	Output is correct
11	Correct	0 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	2 ms	1236 KB	Output is correct
18	Correct	9 ms	2852 KB	Output is correct
19	Correct	26 ms	3532 KB	Output is correct
20	Correct	1 ms	2544 KB	Output is correct
21	Correct	1 ms	2516 KB	Output is correct
22	Correct	29 ms	4460 KB	Output is correct
23	Correct	38 ms	4428 KB	Output is correct
24	Correct	2 ms	2516 KB	Output is correct
25	Correct	35 ms	4456 KB	Output is correct
26	Correct	27 ms	4140 KB	Output is correct
27	Correct	13 ms	3224 KB	Output is correct
28	Correct	13 ms	3108 KB	Output is correct
29	Runtime error	4 ms	852 KB	Execution killed with signal 11
30	Halted	0 ms	0 KB	-

Subtask #4
0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	468 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	468 KB	Output is correct
7	Correct	0 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	0 ms	468 KB	Output is correct
10	Correct	0 ms	468 KB	Output is correct
11	Correct	0 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	2 ms	1236 KB	Output is correct
18	Correct	9 ms	2852 KB	Output is correct
19	Correct	26 ms	3532 KB	Output is correct
20	Correct	1 ms	2544 KB	Output is correct
21	Correct	1 ms	2516 KB	Output is correct
22	Correct	29 ms	4460 KB	Output is correct
23	Correct	38 ms	4428 KB	Output is correct
24	Correct	2 ms	2516 KB	Output is correct
25	Correct	35 ms	4456 KB	Output is correct
26	Correct	27 ms	4140 KB	Output is correct
27	Correct	13 ms	3224 KB	Output is correct
28	Correct	13 ms	3108 KB	Output is correct
29	Runtime error	4 ms	852 KB	Execution killed with signal 11
30	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	468 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	468 KB	Output is correct
7	Correct	0 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	0 ms	468 KB	Output is correct
10	Correct	0 ms	468 KB	Output is correct
11	Correct	0 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	0 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	2 ms	1236 KB	Output is correct
18	Correct	9 ms	2852 KB	Output is correct
19	Correct	26 ms	3532 KB	Output is correct
20	Correct	1 ms	2544 KB	Output is correct
21	Correct	1 ms	2516 KB	Output is correct
22	Correct	29 ms	4460 KB	Output is correct
23	Correct	38 ms	4428 KB	Output is correct
24	Correct	2 ms	2516 KB	Output is correct
25	Correct	35 ms	4456 KB	Output is correct
26	Correct	27 ms	4140 KB	Output is correct
27	Correct	13 ms	3224 KB	Output is correct
28	Correct	13 ms	3108 KB	Output is correct
29	Runtime error	4 ms	852 KB	Execution killed with signal 11
30	Halted	0 ms	0 KB	-

Submission #825384

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 24.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
24.0 / 24.0

Subtask #3
0 / 21.0

Subtask #4
0 / 26.0

Subtask #5
0 / 13.0