oj.uz

Submission #791716

# Submission time Handle Problem Language Result Execution time Memory
791716 2023-07-24T09:02:04 Z 이동현(#10049) Sličnost (COI23_slicnost) C++17
67 / 100
 779 ms 520404 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)12000000, 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 - 10000){
            tn -= SZ - 10000;
        }
    }
    
    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 106 ms 235100 KB Output is correct
2 Correct 100 ms 235176 KB Output is correct
3 Correct 97 ms 235076 KB Output is correct
4 Correct 90 ms 235084 KB Output is correct
5 Correct 111 ms 235168 KB Output is correct
6 Correct 89 ms 235136 KB Output is correct
7 Correct 91 ms 235164 KB Output is correct
8 Correct 107 ms 235180 KB Output is correct
9 Correct 91 ms 235060 KB Output is correct
10 Correct 116 ms 235076 KB Output is correct
11 Correct 118 ms 235072 KB Output is correct
12 Correct 95 ms 235088 KB Output is correct
13 Correct 91 ms 235160 KB Output is correct
14 Correct 108 ms 235140 KB Output is correct
15 Correct 108 ms 235092 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 235100 KB Output is correct
2 Correct 100 ms 235176 KB Output is correct
3 Correct 97 ms 235076 KB Output is correct
4 Correct 90 ms 235084 KB Output is correct
5 Correct 111 ms 235168 KB Output is correct
6 Correct 89 ms 235136 KB Output is correct
7 Correct 91 ms 235164 KB Output is correct
8 Correct 107 ms 235180 KB Output is correct
9 Correct 91 ms 235060 KB Output is correct
10 Correct 116 ms 235076 KB Output is correct
11 Correct 118 ms 235072 KB Output is correct
12 Correct 95 ms 235088 KB Output is correct
13 Correct 91 ms 235160 KB Output is correct
14 Correct 108 ms 235140 KB Output is correct
15 Correct 108 ms 235092 KB Output is correct
16 Correct 94 ms 236144 KB Output is correct
17 Correct 97 ms 236108 KB Output is correct
18 Correct 90 ms 235880 KB Output is correct
19 Correct 103 ms 235984 KB Output is correct
20 Correct 98 ms 236204 KB Output is correct
21 Correct 101 ms 236148 KB Output is correct
22 Correct 107 ms 235888 KB Output is correct
23 Correct 125 ms 236084 KB Output is correct
24 Correct 110 ms 236192 KB Output is correct
25 Correct 96 ms 236008 KB Output is correct
26 Correct 102 ms 236000 KB Output is correct
27 Correct 101 ms 236172 KB Output is correct
28 Correct 103 ms 235944 KB Output is correct
29 Correct 94 ms 235932 KB Output is correct
30 Correct 92 ms 235956 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 235100 KB Output is correct
2 Correct 100 ms 235176 KB Output is correct
3 Correct 97 ms 235076 KB Output is correct
4 Correct 90 ms 235084 KB Output is correct
5 Correct 111 ms 235168 KB Output is correct
6 Correct 89 ms 235136 KB Output is correct
7 Correct 91 ms 235164 KB Output is correct
8 Correct 107 ms 235180 KB Output is correct
9 Correct 91 ms 235060 KB Output is correct
10 Correct 116 ms 235076 KB Output is correct
11 Correct 118 ms 235072 KB Output is correct
12 Correct 95 ms 235088 KB Output is correct
13 Correct 91 ms 235160 KB Output is correct
14 Correct 108 ms 235140 KB Output is correct
15 Correct 108 ms 235092 KB Output is correct
16 Correct 94 ms 236144 KB Output is correct
17 Correct 97 ms 236108 KB Output is correct
18 Correct 90 ms 235880 KB Output is correct
19 Correct 103 ms 235984 KB Output is correct
20 Correct 98 ms 236204 KB Output is correct
21 Correct 101 ms 236148 KB Output is correct
22 Correct 107 ms 235888 KB Output is correct
23 Correct 125 ms 236084 KB Output is correct
24 Correct 110 ms 236192 KB Output is correct
25 Correct 96 ms 236008 KB Output is correct
26 Correct 102 ms 236000 KB Output is correct
27 Correct 101 ms 236172 KB Output is correct
28 Correct 103 ms 235944 KB Output is correct
29 Correct 94 ms 235932 KB Output is correct
30 Correct 92 ms 235956 KB Output is correct
31 Correct 281 ms 256104 KB Output is correct
32 Correct 229 ms 256036 KB Output is correct
33 Correct 125 ms 247324 KB Output is correct
34 Correct 219 ms 251872 KB Output is correct
35 Correct 312 ms 256536 KB Output is correct
36 Correct 261 ms 255400 KB Output is correct
37 Correct 130 ms 248056 KB Output is correct
38 Correct 286 ms 255676 KB Output is correct
39 Correct 243 ms 256492 KB Output is correct
40 Correct 233 ms 252412 KB Output is correct
41 Correct 256 ms 253788 KB Output is correct
42 Correct 335 ms 255212 KB Output is correct
43 Correct 217 ms 251832 KB Output is correct
44 Correct 183 ms 250960 KB Output is correct
45 Correct 151 ms 248092 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 235100 KB Output is correct
2 Correct 100 ms 235176 KB Output is correct
3 Correct 97 ms 235076 KB Output is correct
4 Correct 90 ms 235084 KB Output is correct
5 Correct 111 ms 235168 KB Output is correct
6 Correct 89 ms 235136 KB Output is correct
7 Correct 91 ms 235164 KB Output is correct
8 Correct 107 ms 235180 KB Output is correct
9 Correct 91 ms 235060 KB Output is correct
10 Correct 116 ms 235076 KB Output is correct
11 Correct 118 ms 235072 KB Output is correct
12 Correct 95 ms 235088 KB Output is correct
13 Correct 91 ms 235160 KB Output is correct
14 Correct 108 ms 235140 KB Output is correct
15 Correct 108 ms 235092 KB Output is correct
16 Correct 91 ms 235152 KB Output is correct
17 Correct 120 ms 235128 KB Output is correct
18 Correct 92 ms 235160 KB Output is correct
19 Correct 105 ms 235080 KB Output is correct
20 Correct 95 ms 235108 KB Output is correct
21 Correct 105 ms 235076 KB Output is correct
22 Correct 96 ms 235152 KB Output is correct
23 Correct 104 ms 235088 KB Output is correct
24 Correct 115 ms 235108 KB Output is correct
25 Correct 95 ms 235156 KB Output is correct
26 Correct 103 ms 235176 KB Output is correct
27 Correct 109 ms 235112 KB Output is correct
28 Correct 98 ms 235156 KB Output is correct
29 Correct 95 ms 235132 KB Output is correct
30 Correct 93 ms 235160 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 235100 KB Output is correct
2 Correct 100 ms 235176 KB Output is correct
3 Correct 97 ms 235076 KB Output is correct
4 Correct 90 ms 235084 KB Output is correct
5 Correct 111 ms 235168 KB Output is correct
6 Correct 89 ms 235136 KB Output is correct
7 Correct 91 ms 235164 KB Output is correct
8 Correct 107 ms 235180 KB Output is correct
9 Correct 91 ms 235060 KB Output is correct
10 Correct 116 ms 235076 KB Output is correct
11 Correct 118 ms 235072 KB Output is correct
12 Correct 95 ms 235088 KB Output is correct
13 Correct 91 ms 235160 KB Output is correct
14 Correct 108 ms 235140 KB Output is correct
15 Correct 108 ms 235092 KB Output is correct
16 Correct 94 ms 236144 KB Output is correct
17 Correct 97 ms 236108 KB Output is correct
18 Correct 90 ms 235880 KB Output is correct
19 Correct 103 ms 235984 KB Output is correct
20 Correct 98 ms 236204 KB Output is correct
21 Correct 101 ms 236148 KB Output is correct
22 Correct 107 ms 235888 KB Output is correct
23 Correct 125 ms 236084 KB Output is correct
24 Correct 110 ms 236192 KB Output is correct
25 Correct 96 ms 236008 KB Output is correct
26 Correct 102 ms 236000 KB Output is correct
27 Correct 101 ms 236172 KB Output is correct
28 Correct 103 ms 235944 KB Output is correct
29 Correct 94 ms 235932 KB Output is correct
30 Correct 92 ms 235956 KB Output is correct
31 Correct 91 ms 235152 KB Output is correct
32 Correct 120 ms 235128 KB Output is correct
33 Correct 92 ms 235160 KB Output is correct
34 Correct 105 ms 235080 KB Output is correct
35 Correct 95 ms 235108 KB Output is correct
36 Correct 105 ms 235076 KB Output is correct
37 Correct 96 ms 235152 KB Output is correct
38 Correct 104 ms 235088 KB Output is correct
39 Correct 115 ms 235108 KB Output is correct
40 Correct 95 ms 235156 KB Output is correct
41 Correct 103 ms 235176 KB Output is correct
42 Correct 109 ms 235112 KB Output is correct
43 Correct 98 ms 235156 KB Output is correct
44 Correct 95 ms 235132 KB Output is correct
45 Correct 93 ms 235160 KB Output is correct
46 Correct 116 ms 236232 KB Output is correct
47 Correct 120 ms 236120 KB Output is correct
48 Correct 107 ms 235864 KB Output is correct
49 Correct 107 ms 236020 KB Output is correct
50 Correct 135 ms 236204 KB Output is correct
51 Correct 103 ms 236032 KB Output is correct
52 Correct 104 ms 236108 KB Output is correct
53 Correct 111 ms 236212 KB Output is correct
54 Correct 110 ms 236172 KB Output is correct
55 Correct 103 ms 236000 KB Output is correct
56 Correct 115 ms 236188 KB Output is correct
57 Correct 112 ms 236208 KB Output is correct
58 Correct 115 ms 235940 KB Output is correct
59 Correct 112 ms 236156 KB Output is correct
60 Correct 100 ms 235852 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 235100 KB Output is correct
2 Correct 100 ms 235176 KB Output is correct
3 Correct 97 ms 235076 KB Output is correct
4 Correct 90 ms 235084 KB Output is correct
5 Correct 111 ms 235168 KB Output is correct
6 Correct 89 ms 235136 KB Output is correct
7 Correct 91 ms 235164 KB Output is correct
8 Correct 107 ms 235180 KB Output is correct
9 Correct 91 ms 235060 KB Output is correct
10 Correct 116 ms 235076 KB Output is correct
11 Correct 118 ms 235072 KB Output is correct
12 Correct 95 ms 235088 KB Output is correct
13 Correct 91 ms 235160 KB Output is correct
14 Correct 108 ms 235140 KB Output is correct
15 Correct 108 ms 235092 KB Output is correct
16 Correct 94 ms 236144 KB Output is correct
17 Correct 97 ms 236108 KB Output is correct
18 Correct 90 ms 235880 KB Output is correct
19 Correct 103 ms 235984 KB Output is correct
20 Correct 98 ms 236204 KB Output is correct
21 Correct 101 ms 236148 KB Output is correct
22 Correct 107 ms 235888 KB Output is correct
23 Correct 125 ms 236084 KB Output is correct
24 Correct 110 ms 236192 KB Output is correct
25 Correct 96 ms 236008 KB Output is correct
26 Correct 102 ms 236000 KB Output is correct
27 Correct 101 ms 236172 KB Output is correct
28 Correct 103 ms 235944 KB Output is correct
29 Correct 94 ms 235932 KB Output is correct
30 Correct 92 ms 235956 KB Output is correct
31 Correct 281 ms 256104 KB Output is correct
32 Correct 229 ms 256036 KB Output is correct
33 Correct 125 ms 247324 KB Output is correct
34 Correct 219 ms 251872 KB Output is correct
35 Correct 312 ms 256536 KB Output is correct
36 Correct 261 ms 255400 KB Output is correct
37 Correct 130 ms 248056 KB Output is correct
38 Correct 286 ms 255676 KB Output is correct
39 Correct 243 ms 256492 KB Output is correct
40 Correct 233 ms 252412 KB Output is correct
41 Correct 256 ms 253788 KB Output is correct
42 Correct 335 ms 255212 KB Output is correct
43 Correct 217 ms 251832 KB Output is correct
44 Correct 183 ms 250960 KB Output is correct
45 Correct 151 ms 248092 KB Output is correct
46 Correct 91 ms 235152 KB Output is correct
47 Correct 120 ms 235128 KB Output is correct
48 Correct 92 ms 235160 KB Output is correct
49 Correct 105 ms 235080 KB Output is correct
50 Correct 95 ms 235108 KB Output is correct
51 Correct 105 ms 235076 KB Output is correct
52 Correct 96 ms 235152 KB Output is correct
53 Correct 104 ms 235088 KB Output is correct
54 Correct 115 ms 235108 KB Output is correct
55 Correct 95 ms 235156 KB Output is correct
56 Correct 103 ms 235176 KB Output is correct
57 Correct 109 ms 235112 KB Output is correct
58 Correct 98 ms 235156 KB Output is correct
59 Correct 95 ms 235132 KB Output is correct
60 Correct 93 ms 235160 KB Output is correct
61 Correct 116 ms 236232 KB Output is correct
62 Correct 120 ms 236120 KB Output is correct
63 Correct 107 ms 235864 KB Output is correct
64 Correct 107 ms 236020 KB Output is correct
65 Correct 135 ms 236204 KB Output is correct
66 Correct 103 ms 236032 KB Output is correct
67 Correct 104 ms 236108 KB Output is correct
68 Correct 111 ms 236212 KB Output is correct
69 Correct 110 ms 236172 KB Output is correct
70 Correct 103 ms 236000 KB Output is correct
71 Correct 115 ms 236188 KB Output is correct
72 Correct 112 ms 236208 KB Output is correct
73 Correct 115 ms 235940 KB Output is correct
74 Correct 112 ms 236156 KB Output is correct
75 Correct 100 ms 235852 KB Output is correct
76 Correct 640 ms 256976 KB Output is correct
77 Correct 718 ms 256428 KB Output is correct
78 Correct 130 ms 248116 KB Output is correct
79 Correct 560 ms 252628 KB Output is correct
80 Runtime error 779 ms 520404 KB Execution killed with signal 6
81 Halted 0 ms 0 KB -