oj.uz

Submission #791699

# Submission time Handle Problem Language Result Execution time Memory
791699 2023-07-24T08:56:32 Z 이동현(#10049) Sličnost (COI23_slicnost) C++17
67 / 100
 1474 ms 524288 KB 
#include <bits/stdc++.h>
#define mi(x, y) (x = min(x, y))
#define ma(x, y) (x = max(x, y))
using namespace std;

const int SZ = (int)2e7, NS = (int)1e5 + 4;
struct Data{
    int l, r, mx, lazy, cnt;
    Data(){
        l = r = mx = lazy = cnt = 0;
    }
};
Data tr[SZ];
int tn;
int n, k, q;
int yl[NS], yr[NS];
int a[NS], b[NS];
int rt[NS];
long long cntsum[NS];

void build(int x, int s, int e){
    if(s == e){
        tr[x].cnt = 1;
        return;
    }
    int m = s + e >> 1;
    tr[x].l = ++tn;
    build(tr[x].l, s, m);
    tr[x].r = ++tn;
    build(tr[x].r, m + 1, e);
    tr[x].cnt = e - s + 1;
}

void push(int pre, int now, int s, int e, int ps, int pe, int val){
    // cout << "PUSH " << pre << ' ' << now << ' ' << s << ' ' << e << ' ' << ps << ' ' << pe << ' ' << val << endl;

    if(ps <= s && e <= pe){
        tr[now].mx += val;
        tr[now].lazy += val;
        return;
    }

    int m = s + e >> 1;
    if(tr[now].lazy || ps <= m){
        tr[now].l = ++tn;
        tr[tn] = tr[tr[pre].l];
        tr[tn].mx += tr[now].lazy;
        tr[tn].lazy += tr[now].lazy;
    }
    if(tr[now].lazy || pe > m){
        tr[now].r = ++tn;
        tr[tn] = tr[tr[pre].r];
        tr[tn].mx += tr[now].lazy;
        tr[tn].lazy += tr[now].lazy;
    }
    tr[now].lazy = 0;
    if(ps <= m){
        push(tr[pre].l, tr[now].l, s, m, ps, pe, val);
    }
    if(pe > m){
        push(tr[pre].r, tr[now].r, m + 1, e, ps, pe, val);
    }

    tr[now].mx = max(tr[tr[now].l].mx, tr[tr[now].r].mx);
    tr[now].cnt = (tr[now].mx == tr[tr[now].l].mx ? tr[tr[now].l].cnt : 0) + (tr[now].mx == tr[tr[now].r].mx ? tr[tr[now].r].cnt : 0);
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> k >> q;
    for(int i = 0; i < n; ++i){
        cin >> a[i];
        --a[i];
    }
    for(int i = 0; i < n; ++i){
        cin >> b[i];
        --b[i];

        yl[b[i]] = max(0, i - k + 1);
        yr[b[i]] = min(i, n - k);
    }
    vector<vector<vector<int>>> add(n - k + 2);
    for(int i = 0; i < n; ++i){
        add[max(0, i - k + 1)].push_back({yl[a[i]], yr[a[i]], 1});
        add[min(i, n - k) + 1].push_back({yl[a[i]], yr[a[i]], -1});
    }

    ++tn;
    build(1, 0, n - k);
    int pre = 1;
    for(int i = 0; i <= n - k; ++i){
        for(auto&j:add[i]){
            // cout << i << ' ' << j[0] << ' ' << j[1] << ' ' << j[2] << endl;
            rt[i] = ++tn;
            tr[tn] = tr[pre];
            push(pre, rt[i], 0, n - k, j[0], j[1], j[2]);
            // cout << tr[rt[i]].mx << ' ' << tr[rt[i]].cnt << endl;
            pre = rt[i];
        }
    }

    multiset<int> st;
    for(int i = 0; i <= n - k; ++i){
        st.insert(tr[rt[i]].mx);
        cntsum[tr[rt[i]].mx] += tr[rt[i]].cnt;
    }

    auto output = [&](){
        int ans1 = *(--st.end());
        cout << ans1 << ' ' << cntsum[ans1] << '\n';
    };
    output();

    for(int i = 0; i < q; ++i){
        int x;
        cin >> x;
        --x;

        int lp = x - k + 1;
        int rp = x + 1;

        if(lp >= 0){
            st.erase(st.find(tr[rt[lp]].mx));
            cntsum[tr[rt[lp]].mx] -= tr[rt[lp]].cnt;

            int lst = rt[lp];
            tr[++tn] = tr[rt[lp]];
            push(lst, rt[lp] = tn, 0, n - k, yl[a[x]], yr[a[x]], -1);
            lst = rt[lp];
            tr[++tn] = tr[rt[lp]];
            push(lst, rt[lp] = tn, 0, n - k, yl[a[x + 1]], yr[a[x + 1]], 1);

            st.insert(tr[rt[lp]].mx);
            cntsum[tr[rt[lp]].mx] += tr[rt[lp]].cnt;
        }

        if(rp <= n - k){
            st.erase(st.find(tr[rt[rp]].mx));
            cntsum[tr[rt[rp]].mx] -= tr[rt[rp]].cnt;

            int lst = rt[rp];
            tr[++tn] = tr[rt[rp]];
            push(lst, rt[rp] = tn, 0, n - k, yl[a[x]], yr[a[x]], 1);
            lst = rt[rp];
            tr[++tn] = tr[rt[rp]];
            push(lst, rt[rp] = tn, 0, n - k, yl[a[x + 1]], yr[a[x + 1]], -1);

            st.insert(tr[rt[rp]].mx);
            cntsum[tr[rt[rp]].mx] += tr[rt[rp]].cnt;
        }

        swap(a[x], a[x + 1]);

        output();
    }
    
    return 0;
}

Compilation message

Main.cpp: In function 'void build(int, int, int)':
Main.cpp:26:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |     int m = s + e >> 1;
      |             ~~^~~
Main.cpp: In function 'void push(int, int, int, int, int, int, int)':
Main.cpp:43:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |     int m = s + e >> 1;
      |             ~~^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 391708 KB Output is correct
2 Correct 176 ms 391628 KB Output is correct
3 Correct 146 ms 391692 KB Output is correct
4 Correct 152 ms 391608 KB Output is correct
5 Correct 149 ms 391704 KB Output is correct
6 Correct 152 ms 391644 KB Output is correct
7 Correct 162 ms 391628 KB Output is correct
8 Correct 147 ms 391688 KB Output is correct
9 Correct 147 ms 391624 KB Output is correct
10 Correct 149 ms 391676 KB Output is correct
11 Correct 148 ms 391652 KB Output is correct
12 Correct 151 ms 391680 KB Output is correct
13 Correct 160 ms 391696 KB Output is correct
14 Correct 152 ms 391728 KB Output is correct
15 Correct 164 ms 391692 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 391708 KB Output is correct
2 Correct 176 ms 391628 KB Output is correct
3 Correct 146 ms 391692 KB Output is correct
4 Correct 152 ms 391608 KB Output is correct
5 Correct 149 ms 391704 KB Output is correct
6 Correct 152 ms 391644 KB Output is correct
7 Correct 162 ms 391628 KB Output is correct
8 Correct 147 ms 391688 KB Output is correct
9 Correct 147 ms 391624 KB Output is correct
10 Correct 149 ms 391676 KB Output is correct
11 Correct 148 ms 391652 KB Output is correct
12 Correct 151 ms 391680 KB Output is correct
13 Correct 160 ms 391696 KB Output is correct
14 Correct 152 ms 391728 KB Output is correct
15 Correct 164 ms 391692 KB Output is correct
16 Correct 152 ms 392688 KB Output is correct
17 Correct 158 ms 392712 KB Output is correct
18 Correct 147 ms 392432 KB Output is correct
19 Correct 158 ms 392572 KB Output is correct
20 Correct 170 ms 392676 KB Output is correct
21 Correct 151 ms 392704 KB Output is correct
22 Correct 151 ms 392464 KB Output is correct
23 Correct 185 ms 392648 KB Output is correct
24 Correct 155 ms 392908 KB Output is correct
25 Correct 165 ms 392596 KB Output is correct
26 Correct 153 ms 392564 KB Output is correct
27 Correct 168 ms 392680 KB Output is correct
28 Correct 167 ms 392504 KB Output is correct
29 Correct 147 ms 392444 KB Output is correct
30 Correct 144 ms 392428 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 391708 KB Output is correct
2 Correct 176 ms 391628 KB Output is correct
3 Correct 146 ms 391692 KB Output is correct
4 Correct 152 ms 391608 KB Output is correct
5 Correct 149 ms 391704 KB Output is correct
6 Correct 152 ms 391644 KB Output is correct
7 Correct 162 ms 391628 KB Output is correct
8 Correct 147 ms 391688 KB Output is correct
9 Correct 147 ms 391624 KB Output is correct
10 Correct 149 ms 391676 KB Output is correct
11 Correct 148 ms 391652 KB Output is correct
12 Correct 151 ms 391680 KB Output is correct
13 Correct 160 ms 391696 KB Output is correct
14 Correct 152 ms 391728 KB Output is correct
15 Correct 164 ms 391692 KB Output is correct
16 Correct 152 ms 392688 KB Output is correct
17 Correct 158 ms 392712 KB Output is correct
18 Correct 147 ms 392432 KB Output is correct
19 Correct 158 ms 392572 KB Output is correct
20 Correct 170 ms 392676 KB Output is correct
21 Correct 151 ms 392704 KB Output is correct
22 Correct 151 ms 392464 KB Output is correct
23 Correct 185 ms 392648 KB Output is correct
24 Correct 155 ms 392908 KB Output is correct
25 Correct 165 ms 392596 KB Output is correct
26 Correct 153 ms 392564 KB Output is correct
27 Correct 168 ms 392680 KB Output is correct
28 Correct 167 ms 392504 KB Output is correct
29 Correct 147 ms 392444 KB Output is correct
30 Correct 144 ms 392428 KB Output is correct
31 Correct 298 ms 412680 KB Output is correct
32 Correct 299 ms 412564 KB Output is correct
33 Correct 166 ms 403912 KB Output is correct
34 Correct 252 ms 408292 KB Output is correct
35 Correct 396 ms 413120 KB Output is correct
36 Correct 280 ms 411872 KB Output is correct
37 Correct 172 ms 404564 KB Output is correct
38 Correct 340 ms 412136 KB Output is correct
39 Correct 304 ms 412968 KB Output is correct
40 Correct 299 ms 409028 KB Output is correct
41 Correct 319 ms 410288 KB Output is correct
42 Correct 384 ms 411704 KB Output is correct
43 Correct 258 ms 408476 KB Output is correct
44 Correct 242 ms 407676 KB Output is correct
45 Correct 172 ms 404552 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 391708 KB Output is correct
2 Correct 176 ms 391628 KB Output is correct
3 Correct 146 ms 391692 KB Output is correct
4 Correct 152 ms 391608 KB Output is correct
5 Correct 149 ms 391704 KB Output is correct
6 Correct 152 ms 391644 KB Output is correct
7 Correct 162 ms 391628 KB Output is correct
8 Correct 147 ms 391688 KB Output is correct
9 Correct 147 ms 391624 KB Output is correct
10 Correct 149 ms 391676 KB Output is correct
11 Correct 148 ms 391652 KB Output is correct
12 Correct 151 ms 391680 KB Output is correct
13 Correct 160 ms 391696 KB Output is correct
14 Correct 152 ms 391728 KB Output is correct
15 Correct 164 ms 391692 KB Output is correct
16 Correct 143 ms 391672 KB Output is correct
17 Correct 172 ms 391668 KB Output is correct
18 Correct 175 ms 391660 KB Output is correct
19 Correct 186 ms 391736 KB Output is correct
20 Correct 151 ms 391648 KB Output is correct
21 Correct 162 ms 391824 KB Output is correct
22 Correct 147 ms 391628 KB Output is correct
23 Correct 146 ms 391716 KB Output is correct
24 Correct 145 ms 391624 KB Output is correct
25 Correct 150 ms 391680 KB Output is correct
26 Correct 144 ms 391620 KB Output is correct
27 Correct 144 ms 391624 KB Output is correct
28 Correct 144 ms 391664 KB Output is correct
29 Correct 151 ms 391664 KB Output is correct
30 Correct 150 ms 391712 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 391708 KB Output is correct
2 Correct 176 ms 391628 KB Output is correct
3 Correct 146 ms 391692 KB Output is correct
4 Correct 152 ms 391608 KB Output is correct
5 Correct 149 ms 391704 KB Output is correct
6 Correct 152 ms 391644 KB Output is correct
7 Correct 162 ms 391628 KB Output is correct
8 Correct 147 ms 391688 KB Output is correct
9 Correct 147 ms 391624 KB Output is correct
10 Correct 149 ms 391676 KB Output is correct
11 Correct 148 ms 391652 KB Output is correct
12 Correct 151 ms 391680 KB Output is correct
13 Correct 160 ms 391696 KB Output is correct
14 Correct 152 ms 391728 KB Output is correct
15 Correct 164 ms 391692 KB Output is correct
16 Correct 152 ms 392688 KB Output is correct
17 Correct 158 ms 392712 KB Output is correct
18 Correct 147 ms 392432 KB Output is correct
19 Correct 158 ms 392572 KB Output is correct
20 Correct 170 ms 392676 KB Output is correct
21 Correct 151 ms 392704 KB Output is correct
22 Correct 151 ms 392464 KB Output is correct
23 Correct 185 ms 392648 KB Output is correct
24 Correct 155 ms 392908 KB Output is correct
25 Correct 165 ms 392596 KB Output is correct
26 Correct 153 ms 392564 KB Output is correct
27 Correct 168 ms 392680 KB Output is correct
28 Correct 167 ms 392504 KB Output is correct
29 Correct 147 ms 392444 KB Output is correct
30 Correct 144 ms 392428 KB Output is correct
31 Correct 143 ms 391672 KB Output is correct
32 Correct 172 ms 391668 KB Output is correct
33 Correct 175 ms 391660 KB Output is correct
34 Correct 186 ms 391736 KB Output is correct
35 Correct 151 ms 391648 KB Output is correct
36 Correct 162 ms 391824 KB Output is correct
37 Correct 147 ms 391628 KB Output is correct
38 Correct 146 ms 391716 KB Output is correct
39 Correct 145 ms 391624 KB Output is correct
40 Correct 150 ms 391680 KB Output is correct
41 Correct 144 ms 391620 KB Output is correct
42 Correct 144 ms 391624 KB Output is correct
43 Correct 144 ms 391664 KB Output is correct
44 Correct 151 ms 391664 KB Output is correct
45 Correct 150 ms 391712 KB Output is correct
46 Correct 176 ms 392772 KB Output is correct
47 Correct 172 ms 392780 KB Output is correct
48 Correct 157 ms 392520 KB Output is correct
49 Correct 179 ms 392668 KB Output is correct
50 Correct 169 ms 392808 KB Output is correct
51 Correct 171 ms 392524 KB Output is correct
52 Correct 156 ms 392600 KB Output is correct
53 Correct 167 ms 392680 KB Output is correct
54 Correct 163 ms 392792 KB Output is correct
55 Correct 154 ms 392448 KB Output is correct
56 Correct 201 ms 392708 KB Output is correct
57 Correct 168 ms 392772 KB Output is correct
58 Correct 170 ms 392420 KB Output is correct
59 Correct 165 ms 392608 KB Output is correct
60 Correct 154 ms 392420 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 391708 KB Output is correct
2 Correct 176 ms 391628 KB Output is correct
3 Correct 146 ms 391692 KB Output is correct
4 Correct 152 ms 391608 KB Output is correct
5 Correct 149 ms 391704 KB Output is correct
6 Correct 152 ms 391644 KB Output is correct
7 Correct 162 ms 391628 KB Output is correct
8 Correct 147 ms 391688 KB Output is correct
9 Correct 147 ms 391624 KB Output is correct
10 Correct 149 ms 391676 KB Output is correct
11 Correct 148 ms 391652 KB Output is correct
12 Correct 151 ms 391680 KB Output is correct
13 Correct 160 ms 391696 KB Output is correct
14 Correct 152 ms 391728 KB Output is correct
15 Correct 164 ms 391692 KB Output is correct
16 Correct 152 ms 392688 KB Output is correct
17 Correct 158 ms 392712 KB Output is correct
18 Correct 147 ms 392432 KB Output is correct
19 Correct 158 ms 392572 KB Output is correct
20 Correct 170 ms 392676 KB Output is correct
21 Correct 151 ms 392704 KB Output is correct
22 Correct 151 ms 392464 KB Output is correct
23 Correct 185 ms 392648 KB Output is correct
24 Correct 155 ms 392908 KB Output is correct
25 Correct 165 ms 392596 KB Output is correct
26 Correct 153 ms 392564 KB Output is correct
27 Correct 168 ms 392680 KB Output is correct
28 Correct 167 ms 392504 KB Output is correct
29 Correct 147 ms 392444 KB Output is correct
30 Correct 144 ms 392428 KB Output is correct
31 Correct 298 ms 412680 KB Output is correct
32 Correct 299 ms 412564 KB Output is correct
33 Correct 166 ms 403912 KB Output is correct
34 Correct 252 ms 408292 KB Output is correct
35 Correct 396 ms 413120 KB Output is correct
36 Correct 280 ms 411872 KB Output is correct
37 Correct 172 ms 404564 KB Output is correct
38 Correct 340 ms 412136 KB Output is correct
39 Correct 304 ms 412968 KB Output is correct
40 Correct 299 ms 409028 KB Output is correct
41 Correct 319 ms 410288 KB Output is correct
42 Correct 384 ms 411704 KB Output is correct
43 Correct 258 ms 408476 KB Output is correct
44 Correct 242 ms 407676 KB Output is correct
45 Correct 172 ms 404552 KB Output is correct
46 Correct 143 ms 391672 KB Output is correct
47 Correct 172 ms 391668 KB Output is correct
48 Correct 175 ms 391660 KB Output is correct
49 Correct 186 ms 391736 KB Output is correct
50 Correct 151 ms 391648 KB Output is correct
51 Correct 162 ms 391824 KB Output is correct
52 Correct 147 ms 391628 KB Output is correct
53 Correct 146 ms 391716 KB Output is correct
54 Correct 145 ms 391624 KB Output is correct
55 Correct 150 ms 391680 KB Output is correct
56 Correct 144 ms 391620 KB Output is correct
57 Correct 144 ms 391624 KB Output is correct
58 Correct 144 ms 391664 KB Output is correct
59 Correct 151 ms 391664 KB Output is correct
60 Correct 150 ms 391712 KB Output is correct
61 Correct 176 ms 392772 KB Output is correct
62 Correct 172 ms 392780 KB Output is correct
63 Correct 157 ms 392520 KB Output is correct
64 Correct 179 ms 392668 KB Output is correct
65 Correct 169 ms 392808 KB Output is correct
66 Correct 171 ms 392524 KB Output is correct
67 Correct 156 ms 392600 KB Output is correct
68 Correct 167 ms 392680 KB Output is correct
69 Correct 163 ms 392792 KB Output is correct
70 Correct 154 ms 392448 KB Output is correct
71 Correct 201 ms 392708 KB Output is correct
72 Correct 168 ms 392772 KB Output is correct
73 Correct 170 ms 392420 KB Output is correct
74 Correct 165 ms 392608 KB Output is correct
75 Correct 154 ms 392420 KB Output is correct
76 Correct 734 ms 413520 KB Output is correct
77 Correct 825 ms 414612 KB Output is correct
78 Correct 188 ms 406340 KB Output is correct
79 Correct 561 ms 410836 KB Output is correct
80 Runtime error 1474 ms 524288 KB Execution killed with signal 11
81 Halted 0 ms 0 KB -