oj.uz

Submission #871561

# Submission time Handle Problem Language Result Execution time Memory
871561 2023-11-11T05:50:29 Z resting Chorus (JOI23_chorus) C++17
87 / 100
 7000 ms 266172 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
 
struct segtree{
    int l, r, i; int 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(int qm, int 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<int, int> q(int qi){
        pair<int, 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)4e6]; int memsz = 0; 
segtree* segtree::getmem(){return &mem[memsz++];}
int n, k; 
int res = 0;
int cnt = 0;string s; 
vector<int> b;
void solve(int m){
    memsz=0;
    segtree ac(0, n);
    int sl = 0;
    ac.u(0, 0, 0);
    int cnta = 0;
    int 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++;
        }
    }
}
signed main(){
    cin >> n >> k;
    cin >> s;
    int l = -1, r = 2e12;
    int m = 0; 
    for(int i = 0; i < 2*n; i++){
        if(s[i] == 'B') b.push_back(i);
    }
    while(r - l > 1){
        m = (l+r)/2;
        solve(m);
        if(cnt <= k) r = m;
        else l = m;
    }
    solve(r);
    cout<<res-k*r<<endl;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 250708 KB Output is correct
2 Correct 35 ms 250704 KB Output is correct
3 Correct 34 ms 250704 KB Output is correct
4 Correct 34 ms 250840 KB Output is correct
5 Correct 35 ms 250708 KB Output is correct
6 Correct 36 ms 250704 KB Output is correct
7 Correct 35 ms 250892 KB Output is correct
8 Correct 35 ms 250708 KB Output is correct
9 Correct 34 ms 250708 KB Output is correct
10 Correct 36 ms 250708 KB Output is correct
11 Correct 35 ms 250708 KB Output is correct
12 Correct 35 ms 250760 KB Output is correct
13 Correct 35 ms 250728 KB Output is correct
14 Correct 34 ms 250780 KB Output is correct
15 Correct 34 ms 250704 KB Output is correct
16 Correct 35 ms 250708 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 250708 KB Output is correct
2 Correct 35 ms 250704 KB Output is correct
3 Correct 34 ms 250704 KB Output is correct
4 Correct 34 ms 250840 KB Output is correct
5 Correct 35 ms 250708 KB Output is correct
6 Correct 36 ms 250704 KB Output is correct
7 Correct 35 ms 250892 KB Output is correct
8 Correct 35 ms 250708 KB Output is correct
9 Correct 34 ms 250708 KB Output is correct
10 Correct 36 ms 250708 KB Output is correct
11 Correct 35 ms 250708 KB Output is correct
12 Correct 35 ms 250760 KB Output is correct
13 Correct 35 ms 250728 KB Output is correct
14 Correct 34 ms 250780 KB Output is correct
15 Correct 34 ms 250704 KB Output is correct
16 Correct 35 ms 250708 KB Output is correct
17 Correct 36 ms 250728 KB Output is correct
18 Correct 37 ms 250724 KB Output is correct
19 Correct 37 ms 250680 KB Output is correct
20 Correct 36 ms 250728 KB Output is correct
21 Correct 37 ms 250864 KB Output is correct
22 Correct 36 ms 250708 KB Output is correct
23 Correct 36 ms 250708 KB Output is correct
24 Correct 36 ms 250708 KB Output is correct
25 Correct 36 ms 250708 KB Output is correct
26 Correct 38 ms 250708 KB Output is correct
27 Correct 37 ms 250708 KB Output is correct
28 Correct 37 ms 250856 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 250708 KB Output is correct
2 Correct 35 ms 250704 KB Output is correct
3 Correct 34 ms 250704 KB Output is correct
4 Correct 34 ms 250840 KB Output is correct
5 Correct 35 ms 250708 KB Output is correct
6 Correct 36 ms 250704 KB Output is correct
7 Correct 35 ms 250892 KB Output is correct
8 Correct 35 ms 250708 KB Output is correct
9 Correct 34 ms 250708 KB Output is correct
10 Correct 36 ms 250708 KB Output is correct
11 Correct 35 ms 250708 KB Output is correct
12 Correct 35 ms 250760 KB Output is correct
13 Correct 35 ms 250728 KB Output is correct
14 Correct 34 ms 250780 KB Output is correct
15 Correct 34 ms 250704 KB Output is correct
16 Correct 35 ms 250708 KB Output is correct
17 Correct 36 ms 250728 KB Output is correct
18 Correct 37 ms 250724 KB Output is correct
19 Correct 37 ms 250680 KB Output is correct
20 Correct 36 ms 250728 KB Output is correct
21 Correct 37 ms 250864 KB Output is correct
22 Correct 36 ms 250708 KB Output is correct
23 Correct 36 ms 250708 KB Output is correct
24 Correct 36 ms 250708 KB Output is correct
25 Correct 36 ms 250708 KB Output is correct
26 Correct 38 ms 250708 KB Output is correct
27 Correct 37 ms 250708 KB Output is correct
28 Correct 37 ms 250856 KB Output is correct
29 Correct 64 ms 250960 KB Output is correct
30 Correct 64 ms 251020 KB Output is correct
31 Correct 65 ms 250832 KB Output is correct
32 Correct 57 ms 250824 KB Output is correct
33 Correct 59 ms 251024 KB Output is correct
34 Correct 63 ms 250964 KB Output is correct
35 Correct 61 ms 250968 KB Output is correct
36 Correct 65 ms 250964 KB Output is correct
37 Correct 65 ms 250960 KB Output is correct
38 Correct 63 ms 250960 KB Output is correct
39 Correct 65 ms 250964 KB Output is correct
40 Correct 63 ms 250964 KB Output is correct
41 Correct 64 ms 250960 KB Output is correct
42 Correct 59 ms 250968 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 250708 KB Output is correct
2 Correct 35 ms 250704 KB Output is correct
3 Correct 34 ms 250704 KB Output is correct
4 Correct 34 ms 250840 KB Output is correct
5 Correct 35 ms 250708 KB Output is correct
6 Correct 36 ms 250704 KB Output is correct
7 Correct 35 ms 250892 KB Output is correct
8 Correct 35 ms 250708 KB Output is correct
9 Correct 34 ms 250708 KB Output is correct
10 Correct 36 ms 250708 KB Output is correct
11 Correct 35 ms 250708 KB Output is correct
12 Correct 35 ms 250760 KB Output is correct
13 Correct 35 ms 250728 KB Output is correct
14 Correct 34 ms 250780 KB Output is correct
15 Correct 34 ms 250704 KB Output is correct
16 Correct 35 ms 250708 KB Output is correct
17 Correct 36 ms 250728 KB Output is correct
18 Correct 37 ms 250724 KB Output is correct
19 Correct 37 ms 250680 KB Output is correct
20 Correct 36 ms 250728 KB Output is correct
21 Correct 37 ms 250864 KB Output is correct
22 Correct 36 ms 250708 KB Output is correct
23 Correct 36 ms 250708 KB Output is correct
24 Correct 36 ms 250708 KB Output is correct
25 Correct 36 ms 250708 KB Output is correct
26 Correct 38 ms 250708 KB Output is correct
27 Correct 37 ms 250708 KB Output is correct
28 Correct 37 ms 250856 KB Output is correct
29 Correct 64 ms 250960 KB Output is correct
30 Correct 64 ms 251020 KB Output is correct
31 Correct 65 ms 250832 KB Output is correct
32 Correct 57 ms 250824 KB Output is correct
33 Correct 59 ms 251024 KB Output is correct
34 Correct 63 ms 250964 KB Output is correct
35 Correct 61 ms 250968 KB Output is correct
36 Correct 65 ms 250964 KB Output is correct
37 Correct 65 ms 250960 KB Output is correct
38 Correct 63 ms 250960 KB Output is correct
39 Correct 65 ms 250964 KB Output is correct
40 Correct 63 ms 250964 KB Output is correct
41 Correct 64 ms 250960 KB Output is correct
42 Correct 59 ms 250968 KB Output is correct
43 Correct 467 ms 251720 KB Output is correct
44 Correct 821 ms 252252 KB Output is correct
45 Correct 807 ms 252252 KB Output is correct
46 Correct 668 ms 252252 KB Output is correct
47 Correct 666 ms 252248 KB Output is correct
48 Correct 755 ms 252248 KB Output is correct
49 Correct 737 ms 252392 KB Output is correct
50 Correct 820 ms 252248 KB Output is correct
51 Correct 829 ms 252256 KB Output is correct
52 Correct 744 ms 252220 KB Output is correct
53 Correct 770 ms 252248 KB Output is correct
54 Correct 826 ms 252420 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 250708 KB Output is correct
2 Correct 35 ms 250704 KB Output is correct
3 Correct 34 ms 250704 KB Output is correct
4 Correct 34 ms 250840 KB Output is correct
5 Correct 35 ms 250708 KB Output is correct
6 Correct 36 ms 250704 KB Output is correct
7 Correct 35 ms 250892 KB Output is correct
8 Correct 35 ms 250708 KB Output is correct
9 Correct 34 ms 250708 KB Output is correct
10 Correct 36 ms 250708 KB Output is correct
11 Correct 35 ms 250708 KB Output is correct
12 Correct 35 ms 250760 KB Output is correct
13 Correct 35 ms 250728 KB Output is correct
14 Correct 34 ms 250780 KB Output is correct
15 Correct 34 ms 250704 KB Output is correct
16 Correct 35 ms 250708 KB Output is correct
17 Correct 36 ms 250728 KB Output is correct
18 Correct 37 ms 250724 KB Output is correct
19 Correct 37 ms 250680 KB Output is correct
20 Correct 36 ms 250728 KB Output is correct
21 Correct 37 ms 250864 KB Output is correct
22 Correct 36 ms 250708 KB Output is correct
23 Correct 36 ms 250708 KB Output is correct
24 Correct 36 ms 250708 KB Output is correct
25 Correct 36 ms 250708 KB Output is correct
26 Correct 38 ms 250708 KB Output is correct
27 Correct 37 ms 250708 KB Output is correct
28 Correct 37 ms 250856 KB Output is correct
29 Correct 64 ms 250960 KB Output is correct
30 Correct 64 ms 251020 KB Output is correct
31 Correct 65 ms 250832 KB Output is correct
32 Correct 57 ms 250824 KB Output is correct
33 Correct 59 ms 251024 KB Output is correct
34 Correct 63 ms 250964 KB Output is correct
35 Correct 61 ms 250968 KB Output is correct
36 Correct 65 ms 250964 KB Output is correct
37 Correct 65 ms 250960 KB Output is correct
38 Correct 63 ms 250960 KB Output is correct
39 Correct 65 ms 250964 KB Output is correct
40 Correct 63 ms 250964 KB Output is correct
41 Correct 64 ms 250960 KB Output is correct
42 Correct 59 ms 250968 KB Output is correct
43 Correct 467 ms 251720 KB Output is correct
44 Correct 821 ms 252252 KB Output is correct
45 Correct 807 ms 252252 KB Output is correct
46 Correct 668 ms 252252 KB Output is correct
47 Correct 666 ms 252248 KB Output is correct
48 Correct 755 ms 252248 KB Output is correct
49 Correct 737 ms 252392 KB Output is correct
50 Correct 820 ms 252248 KB Output is correct
51 Correct 829 ms 252256 KB Output is correct
52 Correct 744 ms 252220 KB Output is correct
53 Correct 770 ms 252248 KB Output is correct
54 Correct 826 ms 252420 KB Output is correct
55 Correct 6895 ms 262176 KB Output is correct
56 Execution timed out 7029 ms 266172 KB Time limit exceeded
57 Halted 0 ms 0 KB -