oj.uz

Submission #871537

# Submission time Handle Problem Language Result Execution time Memory
871537 2023-11-11T05:06:07 Z resting Chorus (JOI23_chorus) C++17
87 / 100
 7000 ms 637204 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

struct segtree{
    int l, r, i; double m, b; int cnt;
    segtree* lc = 0, *rc = 0;
    segtree* getmem();
    segtree(int l, int r) : l(l), r(r), m(0), b(1e9), cnt(0){
        i = (l + r) / 2;
        if(l==r) return;
        lc = getmem(); *lc = segtree(l, i);
        rc = getmem(); *rc = segtree(i+1, r);
    };
    segtree() : segtree(-1, -1){};
    void u(double qm, double qb, int qcnt){
        if(qm * i + qb < m*i+b){
            swap(m, qm); swap(b, qb); swap(cnt, qcnt);
        }
        if(l == r) return;
        if(qm > m) lc->u(qm, qb, qcnt);
        else rc->u(qm, qb, qcnt);
    }
    pair<double, int> q(int qi){
        pair<double, int> cur = {m*qi+b, cnt};
        if(i == qi) return cur;
        if(qi < i) return min(cur, lc->q(qi));
        else return min(cur, rc->q(qi));
    }

} mem[(int)1e7]; int memsz = 0; 
segtree* segtree::getmem(){return &mem[memsz++];}


signed main(){
    int n, k; cin >> n >> k;
    string s; cin >> s;
    double l = 0, r = 1e12;
    double res = 0, m = 0; 
    int cnt = 0;
    vector<int> b;
    for(int i = 0; i < 2*n; i++){
        if(s[i] == 'B') b.push_back(i);
    }
    while(r - l > 1e-6){
        m = (l+r)/2;
        memsz = 0;
        segtree ac(0, n);
        double sl = 0;
        ac.u(0, 0, 0);
        int cnta = 0;
        double cur = 0;
        int funnynumber = 0;
        int cntactive = 0;
        for(int i = 0; i < 2 * n; i++){
            if(s[i] == 'A'){
                if(cntactive>0) funnynumber -= cntactive;
                cntactive++;
                if(cntactive>0) funnynumber += b[cnta] - i - cntactive;
                cnta++;
                cur += sl;
                auto tmp = ac.q(cnta); 
                tmp.first += m; tmp.second++;
                if(cnta == n) {
                    res = tmp.first + cur;
                    cnt = tmp.second;
                }
                ac.u(-cnta, tmp.first + (cnta)*cnta+funnynumber, tmp.second);
            }
            else{
                cntactive--;
                sl++;
            }
        }
        if(cnt <= k) r = m;
        else l = m;
    }
    cout<<(int)round(res-m*k)<<endl;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 626568 KB Output is correct
2 Correct 87 ms 626564 KB Output is correct
3 Correct 91 ms 626432 KB Output is correct
4 Correct 86 ms 626516 KB Output is correct
5 Correct 93 ms 626600 KB Output is correct
6 Correct 86 ms 626428 KB Output is correct
7 Correct 83 ms 626520 KB Output is correct
8 Correct 87 ms 626516 KB Output is correct
9 Correct 83 ms 626600 KB Output is correct
10 Correct 86 ms 626508 KB Output is correct
11 Correct 84 ms 626516 KB Output is correct
12 Correct 85 ms 626516 KB Output is correct
13 Correct 85 ms 626392 KB Output is correct
14 Correct 93 ms 626620 KB Output is correct
15 Correct 91 ms 626488 KB Output is correct
16 Correct 88 ms 626584 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 626568 KB Output is correct
2 Correct 87 ms 626564 KB Output is correct
3 Correct 91 ms 626432 KB Output is correct
4 Correct 86 ms 626516 KB Output is correct
5 Correct 93 ms 626600 KB Output is correct
6 Correct 86 ms 626428 KB Output is correct
7 Correct 83 ms 626520 KB Output is correct
8 Correct 87 ms 626516 KB Output is correct
9 Correct 83 ms 626600 KB Output is correct
10 Correct 86 ms 626508 KB Output is correct
11 Correct 84 ms 626516 KB Output is correct
12 Correct 85 ms 626516 KB Output is correct
13 Correct 85 ms 626392 KB Output is correct
14 Correct 93 ms 626620 KB Output is correct
15 Correct 91 ms 626488 KB Output is correct
16 Correct 88 ms 626584 KB Output is correct
17 Correct 87 ms 626592 KB Output is correct
18 Correct 93 ms 626500 KB Output is correct
19 Correct 89 ms 626516 KB Output is correct
20 Correct 92 ms 626512 KB Output is correct
21 Correct 91 ms 626760 KB Output is correct
22 Correct 91 ms 626628 KB Output is correct
23 Correct 88 ms 626396 KB Output is correct
24 Correct 88 ms 626512 KB Output is correct
25 Correct 86 ms 626512 KB Output is correct
26 Correct 89 ms 626608 KB Output is correct
27 Correct 88 ms 626628 KB Output is correct
28 Correct 88 ms 626512 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 626568 KB Output is correct
2 Correct 87 ms 626564 KB Output is correct
3 Correct 91 ms 626432 KB Output is correct
4 Correct 86 ms 626516 KB Output is correct
5 Correct 93 ms 626600 KB Output is correct
6 Correct 86 ms 626428 KB Output is correct
7 Correct 83 ms 626520 KB Output is correct
8 Correct 87 ms 626516 KB Output is correct
9 Correct 83 ms 626600 KB Output is correct
10 Correct 86 ms 626508 KB Output is correct
11 Correct 84 ms 626516 KB Output is correct
12 Correct 85 ms 626516 KB Output is correct
13 Correct 85 ms 626392 KB Output is correct
14 Correct 93 ms 626620 KB Output is correct
15 Correct 91 ms 626488 KB Output is correct
16 Correct 88 ms 626584 KB Output is correct
17 Correct 87 ms 626592 KB Output is correct
18 Correct 93 ms 626500 KB Output is correct
19 Correct 89 ms 626516 KB Output is correct
20 Correct 92 ms 626512 KB Output is correct
21 Correct 91 ms 626760 KB Output is correct
22 Correct 91 ms 626628 KB Output is correct
23 Correct 88 ms 626396 KB Output is correct
24 Correct 88 ms 626512 KB Output is correct
25 Correct 86 ms 626512 KB Output is correct
26 Correct 89 ms 626608 KB Output is correct
27 Correct 88 ms 626628 KB Output is correct
28 Correct 88 ms 626512 KB Output is correct
29 Correct 128 ms 626516 KB Output is correct
30 Correct 128 ms 626680 KB Output is correct
31 Correct 129 ms 626512 KB Output is correct
32 Correct 116 ms 626516 KB Output is correct
33 Correct 116 ms 626540 KB Output is correct
34 Correct 127 ms 626772 KB Output is correct
35 Correct 126 ms 626512 KB Output is correct
36 Correct 128 ms 626608 KB Output is correct
37 Correct 130 ms 626576 KB Output is correct
38 Correct 126 ms 626768 KB Output is correct
39 Correct 128 ms 626512 KB Output is correct
40 Correct 129 ms 626548 KB Output is correct
41 Correct 127 ms 626652 KB Output is correct
42 Correct 116 ms 626708 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 626568 KB Output is correct
2 Correct 87 ms 626564 KB Output is correct
3 Correct 91 ms 626432 KB Output is correct
4 Correct 86 ms 626516 KB Output is correct
5 Correct 93 ms 626600 KB Output is correct
6 Correct 86 ms 626428 KB Output is correct
7 Correct 83 ms 626520 KB Output is correct
8 Correct 87 ms 626516 KB Output is correct
9 Correct 83 ms 626600 KB Output is correct
10 Correct 86 ms 626508 KB Output is correct
11 Correct 84 ms 626516 KB Output is correct
12 Correct 85 ms 626516 KB Output is correct
13 Correct 85 ms 626392 KB Output is correct
14 Correct 93 ms 626620 KB Output is correct
15 Correct 91 ms 626488 KB Output is correct
16 Correct 88 ms 626584 KB Output is correct
17 Correct 87 ms 626592 KB Output is correct
18 Correct 93 ms 626500 KB Output is correct
19 Correct 89 ms 626516 KB Output is correct
20 Correct 92 ms 626512 KB Output is correct
21 Correct 91 ms 626760 KB Output is correct
22 Correct 91 ms 626628 KB Output is correct
23 Correct 88 ms 626396 KB Output is correct
24 Correct 88 ms 626512 KB Output is correct
25 Correct 86 ms 626512 KB Output is correct
26 Correct 89 ms 626608 KB Output is correct
27 Correct 88 ms 626628 KB Output is correct
28 Correct 88 ms 626512 KB Output is correct
29 Correct 128 ms 626516 KB Output is correct
30 Correct 128 ms 626680 KB Output is correct
31 Correct 129 ms 626512 KB Output is correct
32 Correct 116 ms 626516 KB Output is correct
33 Correct 116 ms 626540 KB Output is correct
34 Correct 127 ms 626772 KB Output is correct
35 Correct 126 ms 626512 KB Output is correct
36 Correct 128 ms 626608 KB Output is correct
37 Correct 130 ms 626576 KB Output is correct
38 Correct 126 ms 626768 KB Output is correct
39 Correct 128 ms 626512 KB Output is correct
40 Correct 129 ms 626548 KB Output is correct
41 Correct 127 ms 626652 KB Output is correct
42 Correct 116 ms 626708 KB Output is correct
43 Correct 694 ms 627404 KB Output is correct
44 Correct 1119 ms 628056 KB Output is correct
45 Correct 1130 ms 627800 KB Output is correct
46 Correct 866 ms 627968 KB Output is correct
47 Correct 855 ms 627768 KB Output is correct
48 Correct 1144 ms 627868 KB Output is correct
49 Correct 1108 ms 627804 KB Output is correct
50 Correct 1087 ms 627876 KB Output is correct
51 Correct 1167 ms 627804 KB Output is correct
52 Correct 1098 ms 627956 KB Output is correct
53 Correct 1110 ms 627912 KB Output is correct
54 Correct 1219 ms 627908 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 626568 KB Output is correct
2 Correct 87 ms 626564 KB Output is correct
3 Correct 91 ms 626432 KB Output is correct
4 Correct 86 ms 626516 KB Output is correct
5 Correct 93 ms 626600 KB Output is correct
6 Correct 86 ms 626428 KB Output is correct
7 Correct 83 ms 626520 KB Output is correct
8 Correct 87 ms 626516 KB Output is correct
9 Correct 83 ms 626600 KB Output is correct
10 Correct 86 ms 626508 KB Output is correct
11 Correct 84 ms 626516 KB Output is correct
12 Correct 85 ms 626516 KB Output is correct
13 Correct 85 ms 626392 KB Output is correct
14 Correct 93 ms 626620 KB Output is correct
15 Correct 91 ms 626488 KB Output is correct
16 Correct 88 ms 626584 KB Output is correct
17 Correct 87 ms 626592 KB Output is correct
18 Correct 93 ms 626500 KB Output is correct
19 Correct 89 ms 626516 KB Output is correct
20 Correct 92 ms 626512 KB Output is correct
21 Correct 91 ms 626760 KB Output is correct
22 Correct 91 ms 626628 KB Output is correct
23 Correct 88 ms 626396 KB Output is correct
24 Correct 88 ms 626512 KB Output is correct
25 Correct 86 ms 626512 KB Output is correct
26 Correct 89 ms 626608 KB Output is correct
27 Correct 88 ms 626628 KB Output is correct
28 Correct 88 ms 626512 KB Output is correct
29 Correct 128 ms 626516 KB Output is correct
30 Correct 128 ms 626680 KB Output is correct
31 Correct 129 ms 626512 KB Output is correct
32 Correct 116 ms 626516 KB Output is correct
33 Correct 116 ms 626540 KB Output is correct
34 Correct 127 ms 626772 KB Output is correct
35 Correct 126 ms 626512 KB Output is correct
36 Correct 128 ms 626608 KB Output is correct
37 Correct 130 ms 626576 KB Output is correct
38 Correct 126 ms 626768 KB Output is correct
39 Correct 128 ms 626512 KB Output is correct
40 Correct 129 ms 626548 KB Output is correct
41 Correct 127 ms 626652 KB Output is correct
42 Correct 116 ms 626708 KB Output is correct
43 Correct 694 ms 627404 KB Output is correct
44 Correct 1119 ms 628056 KB Output is correct
45 Correct 1130 ms 627800 KB Output is correct
46 Correct 866 ms 627968 KB Output is correct
47 Correct 855 ms 627768 KB Output is correct
48 Correct 1144 ms 627868 KB Output is correct
49 Correct 1108 ms 627804 KB Output is correct
50 Correct 1087 ms 627876 KB Output is correct
51 Correct 1167 ms 627804 KB Output is correct
52 Correct 1098 ms 627956 KB Output is correct
53 Correct 1110 ms 627912 KB Output is correct
54 Correct 1219 ms 627908 KB Output is correct
55 Execution timed out 7068 ms 637204 KB Time limit exceeded
56 Halted 0 ms 0 KB -