oj.uz

Submission #791711

# Submission time Handle Problem Language Result Execution time Memory
791711 2023-07-24T09:01:03 Z 이동현(#10049) Sličnost (COI23_slicnost) C++17
67 / 100
 1051 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)15000000, 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();

        if(tn > SZ - 10){
            tn -= SZ - 10;
        }
    }
    
    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 120 ms 293892 KB Output is correct
2 Correct 114 ms 293832 KB Output is correct
3 Correct 113 ms 293900 KB Output is correct
4 Correct 115 ms 293816 KB Output is correct
5 Correct 121 ms 293872 KB Output is correct
6 Correct 114 ms 293816 KB Output is correct
7 Correct 119 ms 293828 KB Output is correct
8 Correct 117 ms 293884 KB Output is correct
9 Correct 124 ms 293888 KB Output is correct
10 Correct 118 ms 293776 KB Output is correct
11 Correct 116 ms 293780 KB Output is correct
12 Correct 119 ms 293856 KB Output is correct
13 Correct 114 ms 293836 KB Output is correct
14 Correct 115 ms 293880 KB Output is correct
15 Correct 121 ms 293780 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 293892 KB Output is correct
2 Correct 114 ms 293832 KB Output is correct
3 Correct 113 ms 293900 KB Output is correct
4 Correct 115 ms 293816 KB Output is correct
5 Correct 121 ms 293872 KB Output is correct
6 Correct 114 ms 293816 KB Output is correct
7 Correct 119 ms 293828 KB Output is correct
8 Correct 117 ms 293884 KB Output is correct
9 Correct 124 ms 293888 KB Output is correct
10 Correct 118 ms 293776 KB Output is correct
11 Correct 116 ms 293780 KB Output is correct
12 Correct 119 ms 293856 KB Output is correct
13 Correct 114 ms 293836 KB Output is correct
14 Correct 115 ms 293880 KB Output is correct
15 Correct 121 ms 293780 KB Output is correct
16 Correct 131 ms 294940 KB Output is correct
17 Correct 122 ms 294908 KB Output is correct
18 Correct 117 ms 294568 KB Output is correct
19 Correct 122 ms 294708 KB Output is correct
20 Correct 124 ms 294884 KB Output is correct
21 Correct 129 ms 294828 KB Output is correct
22 Correct 128 ms 294656 KB Output is correct
23 Correct 122 ms 294796 KB Output is correct
24 Correct 122 ms 294816 KB Output is correct
25 Correct 120 ms 294652 KB Output is correct
26 Correct 129 ms 294784 KB Output is correct
27 Correct 122 ms 294856 KB Output is correct
28 Correct 122 ms 294672 KB Output is correct
29 Correct 119 ms 294652 KB Output is correct
30 Correct 119 ms 294628 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 293892 KB Output is correct
2 Correct 114 ms 293832 KB Output is correct
3 Correct 113 ms 293900 KB Output is correct
4 Correct 115 ms 293816 KB Output is correct
5 Correct 121 ms 293872 KB Output is correct
6 Correct 114 ms 293816 KB Output is correct
7 Correct 119 ms 293828 KB Output is correct
8 Correct 117 ms 293884 KB Output is correct
9 Correct 124 ms 293888 KB Output is correct
10 Correct 118 ms 293776 KB Output is correct
11 Correct 116 ms 293780 KB Output is correct
12 Correct 119 ms 293856 KB Output is correct
13 Correct 114 ms 293836 KB Output is correct
14 Correct 115 ms 293880 KB Output is correct
15 Correct 121 ms 293780 KB Output is correct
16 Correct 131 ms 294940 KB Output is correct
17 Correct 122 ms 294908 KB Output is correct
18 Correct 117 ms 294568 KB Output is correct
19 Correct 122 ms 294708 KB Output is correct
20 Correct 124 ms 294884 KB Output is correct
21 Correct 129 ms 294828 KB Output is correct
22 Correct 128 ms 294656 KB Output is correct
23 Correct 122 ms 294796 KB Output is correct
24 Correct 122 ms 294816 KB Output is correct
25 Correct 120 ms 294652 KB Output is correct
26 Correct 129 ms 294784 KB Output is correct
27 Correct 122 ms 294856 KB Output is correct
28 Correct 122 ms 294672 KB Output is correct
29 Correct 119 ms 294652 KB Output is correct
30 Correct 119 ms 294628 KB Output is correct
31 Correct 278 ms 314812 KB Output is correct
32 Correct 255 ms 314712 KB Output is correct
33 Correct 136 ms 306104 KB Output is correct
34 Correct 219 ms 310528 KB Output is correct
35 Correct 326 ms 315264 KB Output is correct
36 Correct 264 ms 314048 KB Output is correct
37 Correct 151 ms 306816 KB Output is correct
38 Correct 318 ms 314360 KB Output is correct
39 Correct 267 ms 315100 KB Output is correct
40 Correct 254 ms 311168 KB Output is correct
41 Correct 308 ms 312556 KB Output is correct
42 Correct 340 ms 313904 KB Output is correct
43 Correct 232 ms 310632 KB Output is correct
44 Correct 213 ms 309760 KB Output is correct
45 Correct 159 ms 306788 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 293892 KB Output is correct
2 Correct 114 ms 293832 KB Output is correct
3 Correct 113 ms 293900 KB Output is correct
4 Correct 115 ms 293816 KB Output is correct
5 Correct 121 ms 293872 KB Output is correct
6 Correct 114 ms 293816 KB Output is correct
7 Correct 119 ms 293828 KB Output is correct
8 Correct 117 ms 293884 KB Output is correct
9 Correct 124 ms 293888 KB Output is correct
10 Correct 118 ms 293776 KB Output is correct
11 Correct 116 ms 293780 KB Output is correct
12 Correct 119 ms 293856 KB Output is correct
13 Correct 114 ms 293836 KB Output is correct
14 Correct 115 ms 293880 KB Output is correct
15 Correct 121 ms 293780 KB Output is correct
16 Correct 115 ms 293776 KB Output is correct
17 Correct 129 ms 293804 KB Output is correct
18 Correct 110 ms 293820 KB Output is correct
19 Correct 111 ms 293856 KB Output is correct
20 Correct 120 ms 293792 KB Output is correct
21 Correct 109 ms 293864 KB Output is correct
22 Correct 109 ms 293812 KB Output is correct
23 Correct 121 ms 293864 KB Output is correct
24 Correct 143 ms 293840 KB Output is correct
25 Correct 110 ms 293768 KB Output is correct
26 Correct 110 ms 293808 KB Output is correct
27 Correct 122 ms 293812 KB Output is correct
28 Correct 117 ms 293880 KB Output is correct
29 Correct 109 ms 293844 KB Output is correct
30 Correct 110 ms 293792 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 293892 KB Output is correct
2 Correct 114 ms 293832 KB Output is correct
3 Correct 113 ms 293900 KB Output is correct
4 Correct 115 ms 293816 KB Output is correct
5 Correct 121 ms 293872 KB Output is correct
6 Correct 114 ms 293816 KB Output is correct
7 Correct 119 ms 293828 KB Output is correct
8 Correct 117 ms 293884 KB Output is correct
9 Correct 124 ms 293888 KB Output is correct
10 Correct 118 ms 293776 KB Output is correct
11 Correct 116 ms 293780 KB Output is correct
12 Correct 119 ms 293856 KB Output is correct
13 Correct 114 ms 293836 KB Output is correct
14 Correct 115 ms 293880 KB Output is correct
15 Correct 121 ms 293780 KB Output is correct
16 Correct 131 ms 294940 KB Output is correct
17 Correct 122 ms 294908 KB Output is correct
18 Correct 117 ms 294568 KB Output is correct
19 Correct 122 ms 294708 KB Output is correct
20 Correct 124 ms 294884 KB Output is correct
21 Correct 129 ms 294828 KB Output is correct
22 Correct 128 ms 294656 KB Output is correct
23 Correct 122 ms 294796 KB Output is correct
24 Correct 122 ms 294816 KB Output is correct
25 Correct 120 ms 294652 KB Output is correct
26 Correct 129 ms 294784 KB Output is correct
27 Correct 122 ms 294856 KB Output is correct
28 Correct 122 ms 294672 KB Output is correct
29 Correct 119 ms 294652 KB Output is correct
30 Correct 119 ms 294628 KB Output is correct
31 Correct 115 ms 293776 KB Output is correct
32 Correct 129 ms 293804 KB Output is correct
33 Correct 110 ms 293820 KB Output is correct
34 Correct 111 ms 293856 KB Output is correct
35 Correct 120 ms 293792 KB Output is correct
36 Correct 109 ms 293864 KB Output is correct
37 Correct 109 ms 293812 KB Output is correct
38 Correct 121 ms 293864 KB Output is correct
39 Correct 143 ms 293840 KB Output is correct
40 Correct 110 ms 293768 KB Output is correct
41 Correct 110 ms 293808 KB Output is correct
42 Correct 122 ms 293812 KB Output is correct
43 Correct 117 ms 293880 KB Output is correct
44 Correct 109 ms 293844 KB Output is correct
45 Correct 110 ms 293792 KB Output is correct
46 Correct 130 ms 294856 KB Output is correct
47 Correct 142 ms 294832 KB Output is correct
48 Correct 132 ms 294612 KB Output is correct
49 Correct 128 ms 294744 KB Output is correct
50 Correct 143 ms 294868 KB Output is correct
51 Correct 120 ms 294640 KB Output is correct
52 Correct 141 ms 294732 KB Output is correct
53 Correct 137 ms 294892 KB Output is correct
54 Correct 129 ms 294868 KB Output is correct
55 Correct 123 ms 294740 KB Output is correct
56 Correct 132 ms 294852 KB Output is correct
57 Correct 133 ms 294916 KB Output is correct
58 Correct 127 ms 294568 KB Output is correct
59 Correct 140 ms 294904 KB Output is correct
60 Correct 119 ms 294548 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 293892 KB Output is correct
2 Correct 114 ms 293832 KB Output is correct
3 Correct 113 ms 293900 KB Output is correct
4 Correct 115 ms 293816 KB Output is correct
5 Correct 121 ms 293872 KB Output is correct
6 Correct 114 ms 293816 KB Output is correct
7 Correct 119 ms 293828 KB Output is correct
8 Correct 117 ms 293884 KB Output is correct
9 Correct 124 ms 293888 KB Output is correct
10 Correct 118 ms 293776 KB Output is correct
11 Correct 116 ms 293780 KB Output is correct
12 Correct 119 ms 293856 KB Output is correct
13 Correct 114 ms 293836 KB Output is correct
14 Correct 115 ms 293880 KB Output is correct
15 Correct 121 ms 293780 KB Output is correct
16 Correct 131 ms 294940 KB Output is correct
17 Correct 122 ms 294908 KB Output is correct
18 Correct 117 ms 294568 KB Output is correct
19 Correct 122 ms 294708 KB Output is correct
20 Correct 124 ms 294884 KB Output is correct
21 Correct 129 ms 294828 KB Output is correct
22 Correct 128 ms 294656 KB Output is correct
23 Correct 122 ms 294796 KB Output is correct
24 Correct 122 ms 294816 KB Output is correct
25 Correct 120 ms 294652 KB Output is correct
26 Correct 129 ms 294784 KB Output is correct
27 Correct 122 ms 294856 KB Output is correct
28 Correct 122 ms 294672 KB Output is correct
29 Correct 119 ms 294652 KB Output is correct
30 Correct 119 ms 294628 KB Output is correct
31 Correct 278 ms 314812 KB Output is correct
32 Correct 255 ms 314712 KB Output is correct
33 Correct 136 ms 306104 KB Output is correct
34 Correct 219 ms 310528 KB Output is correct
35 Correct 326 ms 315264 KB Output is correct
36 Correct 264 ms 314048 KB Output is correct
37 Correct 151 ms 306816 KB Output is correct
38 Correct 318 ms 314360 KB Output is correct
39 Correct 267 ms 315100 KB Output is correct
40 Correct 254 ms 311168 KB Output is correct
41 Correct 308 ms 312556 KB Output is correct
42 Correct 340 ms 313904 KB Output is correct
43 Correct 232 ms 310632 KB Output is correct
44 Correct 213 ms 309760 KB Output is correct
45 Correct 159 ms 306788 KB Output is correct
46 Correct 115 ms 293776 KB Output is correct
47 Correct 129 ms 293804 KB Output is correct
48 Correct 110 ms 293820 KB Output is correct
49 Correct 111 ms 293856 KB Output is correct
50 Correct 120 ms 293792 KB Output is correct
51 Correct 109 ms 293864 KB Output is correct
52 Correct 109 ms 293812 KB Output is correct
53 Correct 121 ms 293864 KB Output is correct
54 Correct 143 ms 293840 KB Output is correct
55 Correct 110 ms 293768 KB Output is correct
56 Correct 110 ms 293808 KB Output is correct
57 Correct 122 ms 293812 KB Output is correct
58 Correct 117 ms 293880 KB Output is correct
59 Correct 109 ms 293844 KB Output is correct
60 Correct 110 ms 293792 KB Output is correct
61 Correct 130 ms 294856 KB Output is correct
62 Correct 142 ms 294832 KB Output is correct
63 Correct 132 ms 294612 KB Output is correct
64 Correct 128 ms 294744 KB Output is correct
65 Correct 143 ms 294868 KB Output is correct
66 Correct 120 ms 294640 KB Output is correct
67 Correct 141 ms 294732 KB Output is correct
68 Correct 137 ms 294892 KB Output is correct
69 Correct 129 ms 294868 KB Output is correct
70 Correct 123 ms 294740 KB Output is correct
71 Correct 132 ms 294852 KB Output is correct
72 Correct 133 ms 294916 KB Output is correct
73 Correct 127 ms 294568 KB Output is correct
74 Correct 140 ms 294904 KB Output is correct
75 Correct 119 ms 294548 KB Output is correct
76 Correct 683 ms 315688 KB Output is correct
77 Correct 769 ms 315140 KB Output is correct
78 Correct 151 ms 306784 KB Output is correct
79 Correct 502 ms 311236 KB Output is correct
80 Runtime error 1051 ms 524288 KB Execution killed with signal 11
81 Halted 0 ms 0 KB -