oj.uz

답안 #871528

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871528 2023-11-11T04:55:08 Z resting Chorus (JOI23_chorus) C++17
87 / 100
 7000 ms 643516 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 = 1e-7, 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 = sqrt(l*r);
        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 110 ms 626516 KB Output is correct
2 Correct 86 ms 626512 KB Output is correct
3 Correct 83 ms 626548 KB Output is correct
4 Correct 82 ms 626772 KB Output is correct
5 Correct 86 ms 626600 KB Output is correct
6 Correct 86 ms 626608 KB Output is correct
7 Correct 83 ms 626512 KB Output is correct
8 Correct 82 ms 626564 KB Output is correct
9 Correct 87 ms 626512 KB Output is correct
10 Correct 83 ms 626516 KB Output is correct
11 Correct 88 ms 626480 KB Output is correct
12 Correct 84 ms 626764 KB Output is correct
13 Correct 86 ms 626516 KB Output is correct
14 Correct 83 ms 626516 KB Output is correct
15 Correct 84 ms 626636 KB Output is correct
16 Correct 88 ms 626512 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 626516 KB Output is correct
2 Correct 86 ms 626512 KB Output is correct
3 Correct 83 ms 626548 KB Output is correct
4 Correct 82 ms 626772 KB Output is correct
5 Correct 86 ms 626600 KB Output is correct
6 Correct 86 ms 626608 KB Output is correct
7 Correct 83 ms 626512 KB Output is correct
8 Correct 82 ms 626564 KB Output is correct
9 Correct 87 ms 626512 KB Output is correct
10 Correct 83 ms 626516 KB Output is correct
11 Correct 88 ms 626480 KB Output is correct
12 Correct 84 ms 626764 KB Output is correct
13 Correct 86 ms 626516 KB Output is correct
14 Correct 83 ms 626516 KB Output is correct
15 Correct 84 ms 626636 KB Output is correct
16 Correct 88 ms 626512 KB Output is correct
17 Correct 86 ms 626584 KB Output is correct
18 Correct 88 ms 626572 KB Output is correct
19 Correct 87 ms 626516 KB Output is correct
20 Correct 87 ms 626512 KB Output is correct
21 Correct 87 ms 626512 KB Output is correct
22 Correct 88 ms 626612 KB Output is correct
23 Correct 86 ms 626512 KB Output is correct
24 Correct 86 ms 626540 KB Output is correct
25 Correct 87 ms 626508 KB Output is correct
26 Correct 90 ms 626556 KB Output is correct
27 Correct 92 ms 626512 KB Output is correct
28 Correct 88 ms 626812 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 626516 KB Output is correct
2 Correct 86 ms 626512 KB Output is correct
3 Correct 83 ms 626548 KB Output is correct
4 Correct 82 ms 626772 KB Output is correct
5 Correct 86 ms 626600 KB Output is correct
6 Correct 86 ms 626608 KB Output is correct
7 Correct 83 ms 626512 KB Output is correct
8 Correct 82 ms 626564 KB Output is correct
9 Correct 87 ms 626512 KB Output is correct
10 Correct 83 ms 626516 KB Output is correct
11 Correct 88 ms 626480 KB Output is correct
12 Correct 84 ms 626764 KB Output is correct
13 Correct 86 ms 626516 KB Output is correct
14 Correct 83 ms 626516 KB Output is correct
15 Correct 84 ms 626636 KB Output is correct
16 Correct 88 ms 626512 KB Output is correct
17 Correct 86 ms 626584 KB Output is correct
18 Correct 88 ms 626572 KB Output is correct
19 Correct 87 ms 626516 KB Output is correct
20 Correct 87 ms 626512 KB Output is correct
21 Correct 87 ms 626512 KB Output is correct
22 Correct 88 ms 626612 KB Output is correct
23 Correct 86 ms 626512 KB Output is correct
24 Correct 86 ms 626540 KB Output is correct
25 Correct 87 ms 626508 KB Output is correct
26 Correct 90 ms 626556 KB Output is correct
27 Correct 92 ms 626512 KB Output is correct
28 Correct 88 ms 626812 KB Output is correct
29 Correct 114 ms 626512 KB Output is correct
30 Correct 91 ms 626512 KB Output is correct
31 Correct 91 ms 626640 KB Output is correct
32 Correct 119 ms 626512 KB Output is correct
33 Correct 119 ms 626752 KB Output is correct
34 Correct 107 ms 626672 KB Output is correct
35 Correct 90 ms 626516 KB Output is correct
36 Correct 118 ms 626512 KB Output is correct
37 Correct 111 ms 626524 KB Output is correct
38 Correct 107 ms 626516 KB Output is correct
39 Correct 113 ms 626648 KB Output is correct
40 Correct 110 ms 626592 KB Output is correct
41 Correct 110 ms 626756 KB Output is correct
42 Correct 100 ms 626516 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 626516 KB Output is correct
2 Correct 86 ms 626512 KB Output is correct
3 Correct 83 ms 626548 KB Output is correct
4 Correct 82 ms 626772 KB Output is correct
5 Correct 86 ms 626600 KB Output is correct
6 Correct 86 ms 626608 KB Output is correct
7 Correct 83 ms 626512 KB Output is correct
8 Correct 82 ms 626564 KB Output is correct
9 Correct 87 ms 626512 KB Output is correct
10 Correct 83 ms 626516 KB Output is correct
11 Correct 88 ms 626480 KB Output is correct
12 Correct 84 ms 626764 KB Output is correct
13 Correct 86 ms 626516 KB Output is correct
14 Correct 83 ms 626516 KB Output is correct
15 Correct 84 ms 626636 KB Output is correct
16 Correct 88 ms 626512 KB Output is correct
17 Correct 86 ms 626584 KB Output is correct
18 Correct 88 ms 626572 KB Output is correct
19 Correct 87 ms 626516 KB Output is correct
20 Correct 87 ms 626512 KB Output is correct
21 Correct 87 ms 626512 KB Output is correct
22 Correct 88 ms 626612 KB Output is correct
23 Correct 86 ms 626512 KB Output is correct
24 Correct 86 ms 626540 KB Output is correct
25 Correct 87 ms 626508 KB Output is correct
26 Correct 90 ms 626556 KB Output is correct
27 Correct 92 ms 626512 KB Output is correct
28 Correct 88 ms 626812 KB Output is correct
29 Correct 114 ms 626512 KB Output is correct
30 Correct 91 ms 626512 KB Output is correct
31 Correct 91 ms 626640 KB Output is correct
32 Correct 119 ms 626512 KB Output is correct
33 Correct 119 ms 626752 KB Output is correct
34 Correct 107 ms 626672 KB Output is correct
35 Correct 90 ms 626516 KB Output is correct
36 Correct 118 ms 626512 KB Output is correct
37 Correct 111 ms 626524 KB Output is correct
38 Correct 107 ms 626516 KB Output is correct
39 Correct 113 ms 626648 KB Output is correct
40 Correct 110 ms 626592 KB Output is correct
41 Correct 110 ms 626756 KB Output is correct
42 Correct 100 ms 626516 KB Output is correct
43 Correct 144 ms 627332 KB Output is correct
44 Correct 578 ms 627784 KB Output is correct
45 Correct 199 ms 627792 KB Output is correct
46 Correct 825 ms 627804 KB Output is correct
47 Correct 813 ms 627804 KB Output is correct
48 Correct 589 ms 627852 KB Output is correct
49 Correct 186 ms 627804 KB Output is correct
50 Correct 1002 ms 627864 KB Output is correct
51 Correct 811 ms 627824 KB Output is correct
52 Correct 196 ms 627804 KB Output is correct
53 Correct 585 ms 627804 KB Output is correct
54 Correct 678 ms 627808 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 626516 KB Output is correct
2 Correct 86 ms 626512 KB Output is correct
3 Correct 83 ms 626548 KB Output is correct
4 Correct 82 ms 626772 KB Output is correct
5 Correct 86 ms 626600 KB Output is correct
6 Correct 86 ms 626608 KB Output is correct
7 Correct 83 ms 626512 KB Output is correct
8 Correct 82 ms 626564 KB Output is correct
9 Correct 87 ms 626512 KB Output is correct
10 Correct 83 ms 626516 KB Output is correct
11 Correct 88 ms 626480 KB Output is correct
12 Correct 84 ms 626764 KB Output is correct
13 Correct 86 ms 626516 KB Output is correct
14 Correct 83 ms 626516 KB Output is correct
15 Correct 84 ms 626636 KB Output is correct
16 Correct 88 ms 626512 KB Output is correct
17 Correct 86 ms 626584 KB Output is correct
18 Correct 88 ms 626572 KB Output is correct
19 Correct 87 ms 626516 KB Output is correct
20 Correct 87 ms 626512 KB Output is correct
21 Correct 87 ms 626512 KB Output is correct
22 Correct 88 ms 626612 KB Output is correct
23 Correct 86 ms 626512 KB Output is correct
24 Correct 86 ms 626540 KB Output is correct
25 Correct 87 ms 626508 KB Output is correct
26 Correct 90 ms 626556 KB Output is correct
27 Correct 92 ms 626512 KB Output is correct
28 Correct 88 ms 626812 KB Output is correct
29 Correct 114 ms 626512 KB Output is correct
30 Correct 91 ms 626512 KB Output is correct
31 Correct 91 ms 626640 KB Output is correct
32 Correct 119 ms 626512 KB Output is correct
33 Correct 119 ms 626752 KB Output is correct
34 Correct 107 ms 626672 KB Output is correct
35 Correct 90 ms 626516 KB Output is correct
36 Correct 118 ms 626512 KB Output is correct
37 Correct 111 ms 626524 KB Output is correct
38 Correct 107 ms 626516 KB Output is correct
39 Correct 113 ms 626648 KB Output is correct
40 Correct 110 ms 626592 KB Output is correct
41 Correct 110 ms 626756 KB Output is correct
42 Correct 100 ms 626516 KB Output is correct
43 Correct 144 ms 627332 KB Output is correct
44 Correct 578 ms 627784 KB Output is correct
45 Correct 199 ms 627792 KB Output is correct
46 Correct 825 ms 627804 KB Output is correct
47 Correct 813 ms 627804 KB Output is correct
48 Correct 589 ms 627852 KB Output is correct
49 Correct 186 ms 627804 KB Output is correct
50 Correct 1002 ms 627864 KB Output is correct
51 Correct 811 ms 627824 KB Output is correct
52 Correct 196 ms 627804 KB Output is correct
53 Correct 585 ms 627804 KB Output is correct
54 Correct 678 ms 627808 KB Output is correct
55 Correct 836 ms 637760 KB Output is correct
56 Correct 1264 ms 642236 KB Output is correct
57 Correct 1289 ms 643516 KB Output is correct
58 Execution timed out 7096 ms 642748 KB Time limit exceeded
59 Halted 0 ms 0 KB -