oj.uz

답안 #871513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871513 2023-11-11T04:45:01 Z resting Chorus (JOI23_chorus) C++17
87 / 100
 5582 ms 638272 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/k;
    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-5){
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 626520 KB Output is correct
2 Correct 84 ms 626396 KB Output is correct
3 Correct 84 ms 626516 KB Output is correct
4 Correct 86 ms 626568 KB Output is correct
5 Correct 84 ms 626508 KB Output is correct
6 Correct 84 ms 626516 KB Output is correct
7 Correct 85 ms 626512 KB Output is correct
8 Correct 84 ms 626512 KB Output is correct
9 Correct 83 ms 626476 KB Output is correct
10 Correct 86 ms 626512 KB Output is correct
11 Correct 89 ms 626544 KB Output is correct
12 Correct 86 ms 626572 KB Output is correct
13 Correct 86 ms 626612 KB Output is correct
14 Correct 84 ms 626516 KB Output is correct
15 Correct 86 ms 626516 KB Output is correct
16 Correct 87 ms 626636 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 626520 KB Output is correct
2 Correct 84 ms 626396 KB Output is correct
3 Correct 84 ms 626516 KB Output is correct
4 Correct 86 ms 626568 KB Output is correct
5 Correct 84 ms 626508 KB Output is correct
6 Correct 84 ms 626516 KB Output is correct
7 Correct 85 ms 626512 KB Output is correct
8 Correct 84 ms 626512 KB Output is correct
9 Correct 83 ms 626476 KB Output is correct
10 Correct 86 ms 626512 KB Output is correct
11 Correct 89 ms 626544 KB Output is correct
12 Correct 86 ms 626572 KB Output is correct
13 Correct 86 ms 626612 KB Output is correct
14 Correct 84 ms 626516 KB Output is correct
15 Correct 86 ms 626516 KB Output is correct
16 Correct 87 ms 626636 KB Output is correct
17 Correct 90 ms 626456 KB Output is correct
18 Correct 87 ms 626516 KB Output is correct
19 Correct 86 ms 626512 KB Output is correct
20 Correct 87 ms 626516 KB Output is correct
21 Correct 88 ms 626612 KB Output is correct
22 Correct 86 ms 626548 KB Output is correct
23 Correct 89 ms 626448 KB Output is correct
24 Correct 93 ms 626412 KB Output is correct
25 Correct 87 ms 626432 KB Output is correct
26 Correct 85 ms 626400 KB Output is correct
27 Correct 89 ms 626404 KB Output is correct
28 Correct 86 ms 626404 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 626520 KB Output is correct
2 Correct 84 ms 626396 KB Output is correct
3 Correct 84 ms 626516 KB Output is correct
4 Correct 86 ms 626568 KB Output is correct
5 Correct 84 ms 626508 KB Output is correct
6 Correct 84 ms 626516 KB Output is correct
7 Correct 85 ms 626512 KB Output is correct
8 Correct 84 ms 626512 KB Output is correct
9 Correct 83 ms 626476 KB Output is correct
10 Correct 86 ms 626512 KB Output is correct
11 Correct 89 ms 626544 KB Output is correct
12 Correct 86 ms 626572 KB Output is correct
13 Correct 86 ms 626612 KB Output is correct
14 Correct 84 ms 626516 KB Output is correct
15 Correct 86 ms 626516 KB Output is correct
16 Correct 87 ms 626636 KB Output is correct
17 Correct 90 ms 626456 KB Output is correct
18 Correct 87 ms 626516 KB Output is correct
19 Correct 86 ms 626512 KB Output is correct
20 Correct 87 ms 626516 KB Output is correct
21 Correct 88 ms 626612 KB Output is correct
22 Correct 86 ms 626548 KB Output is correct
23 Correct 89 ms 626448 KB Output is correct
24 Correct 93 ms 626412 KB Output is correct
25 Correct 87 ms 626432 KB Output is correct
26 Correct 85 ms 626400 KB Output is correct
27 Correct 89 ms 626404 KB Output is correct
28 Correct 86 ms 626404 KB Output is correct
29 Correct 121 ms 626772 KB Output is correct
30 Correct 121 ms 626528 KB Output is correct
31 Correct 122 ms 626752 KB Output is correct
32 Correct 110 ms 626512 KB Output is correct
33 Correct 113 ms 626676 KB Output is correct
34 Correct 116 ms 626512 KB Output is correct
35 Correct 117 ms 626516 KB Output is correct
36 Correct 128 ms 626512 KB Output is correct
37 Correct 130 ms 626752 KB Output is correct
38 Correct 117 ms 626512 KB Output is correct
39 Correct 122 ms 626516 KB Output is correct
40 Correct 119 ms 626512 KB Output is correct
41 Correct 121 ms 626996 KB Output is correct
42 Correct 109 ms 626512 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 626520 KB Output is correct
2 Correct 84 ms 626396 KB Output is correct
3 Correct 84 ms 626516 KB Output is correct
4 Correct 86 ms 626568 KB Output is correct
5 Correct 84 ms 626508 KB Output is correct
6 Correct 84 ms 626516 KB Output is correct
7 Correct 85 ms 626512 KB Output is correct
8 Correct 84 ms 626512 KB Output is correct
9 Correct 83 ms 626476 KB Output is correct
10 Correct 86 ms 626512 KB Output is correct
11 Correct 89 ms 626544 KB Output is correct
12 Correct 86 ms 626572 KB Output is correct
13 Correct 86 ms 626612 KB Output is correct
14 Correct 84 ms 626516 KB Output is correct
15 Correct 86 ms 626516 KB Output is correct
16 Correct 87 ms 626636 KB Output is correct
17 Correct 90 ms 626456 KB Output is correct
18 Correct 87 ms 626516 KB Output is correct
19 Correct 86 ms 626512 KB Output is correct
20 Correct 87 ms 626516 KB Output is correct
21 Correct 88 ms 626612 KB Output is correct
22 Correct 86 ms 626548 KB Output is correct
23 Correct 89 ms 626448 KB Output is correct
24 Correct 93 ms 626412 KB Output is correct
25 Correct 87 ms 626432 KB Output is correct
26 Correct 85 ms 626400 KB Output is correct
27 Correct 89 ms 626404 KB Output is correct
28 Correct 86 ms 626404 KB Output is correct
29 Correct 121 ms 626772 KB Output is correct
30 Correct 121 ms 626528 KB Output is correct
31 Correct 122 ms 626752 KB Output is correct
32 Correct 110 ms 626512 KB Output is correct
33 Correct 113 ms 626676 KB Output is correct
34 Correct 116 ms 626512 KB Output is correct
35 Correct 117 ms 626516 KB Output is correct
36 Correct 128 ms 626512 KB Output is correct
37 Correct 130 ms 626752 KB Output is correct
38 Correct 117 ms 626512 KB Output is correct
39 Correct 122 ms 626516 KB Output is correct
40 Correct 119 ms 626512 KB Output is correct
41 Correct 121 ms 626996 KB Output is correct
42 Correct 109 ms 626512 KB Output is correct
43 Correct 520 ms 627420 KB Output is correct
44 Correct 992 ms 627872 KB Output is correct
45 Correct 871 ms 627800 KB Output is correct
46 Correct 668 ms 627804 KB Output is correct
47 Correct 820 ms 627844 KB Output is correct
48 Correct 798 ms 627800 KB Output is correct
49 Correct 798 ms 627804 KB Output is correct
50 Correct 1036 ms 627884 KB Output is correct
51 Correct 976 ms 627828 KB Output is correct
52 Correct 839 ms 627868 KB Output is correct
53 Correct 832 ms 627812 KB Output is correct
54 Correct 919 ms 627928 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 626520 KB Output is correct
2 Correct 84 ms 626396 KB Output is correct
3 Correct 84 ms 626516 KB Output is correct
4 Correct 86 ms 626568 KB Output is correct
5 Correct 84 ms 626508 KB Output is correct
6 Correct 84 ms 626516 KB Output is correct
7 Correct 85 ms 626512 KB Output is correct
8 Correct 84 ms 626512 KB Output is correct
9 Correct 83 ms 626476 KB Output is correct
10 Correct 86 ms 626512 KB Output is correct
11 Correct 89 ms 626544 KB Output is correct
12 Correct 86 ms 626572 KB Output is correct
13 Correct 86 ms 626612 KB Output is correct
14 Correct 84 ms 626516 KB Output is correct
15 Correct 86 ms 626516 KB Output is correct
16 Correct 87 ms 626636 KB Output is correct
17 Correct 90 ms 626456 KB Output is correct
18 Correct 87 ms 626516 KB Output is correct
19 Correct 86 ms 626512 KB Output is correct
20 Correct 87 ms 626516 KB Output is correct
21 Correct 88 ms 626612 KB Output is correct
22 Correct 86 ms 626548 KB Output is correct
23 Correct 89 ms 626448 KB Output is correct
24 Correct 93 ms 626412 KB Output is correct
25 Correct 87 ms 626432 KB Output is correct
26 Correct 85 ms 626400 KB Output is correct
27 Correct 89 ms 626404 KB Output is correct
28 Correct 86 ms 626404 KB Output is correct
29 Correct 121 ms 626772 KB Output is correct
30 Correct 121 ms 626528 KB Output is correct
31 Correct 122 ms 626752 KB Output is correct
32 Correct 110 ms 626512 KB Output is correct
33 Correct 113 ms 626676 KB Output is correct
34 Correct 116 ms 626512 KB Output is correct
35 Correct 117 ms 626516 KB Output is correct
36 Correct 128 ms 626512 KB Output is correct
37 Correct 130 ms 626752 KB Output is correct
38 Correct 117 ms 626512 KB Output is correct
39 Correct 122 ms 626516 KB Output is correct
40 Correct 119 ms 626512 KB Output is correct
41 Correct 121 ms 626996 KB Output is correct
42 Correct 109 ms 626512 KB Output is correct
43 Correct 520 ms 627420 KB Output is correct
44 Correct 992 ms 627872 KB Output is correct
45 Correct 871 ms 627800 KB Output is correct
46 Correct 668 ms 627804 KB Output is correct
47 Correct 820 ms 627844 KB Output is correct
48 Correct 798 ms 627800 KB Output is correct
49 Correct 798 ms 627804 KB Output is correct
50 Correct 1036 ms 627884 KB Output is correct
51 Correct 976 ms 627828 KB Output is correct
52 Correct 839 ms 627868 KB Output is correct
53 Correct 832 ms 627812 KB Output is correct
54 Correct 919 ms 627928 KB Output is correct
55 Incorrect 5582 ms 638272 KB Output isn't correct
56 Halted 0 ms 0 KB -