oj.uz

답안 #791708

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
791708 2023-07-24T09:00:02 Z 이동현(#10049) Sličnost (COI23_slicnost) C++17
67 / 100
 1448 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();

        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

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 391632 KB Output is correct
2 Correct 169 ms 391684 KB Output is correct
3 Correct 164 ms 391616 KB Output is correct
4 Correct 167 ms 391680 KB Output is correct
5 Correct 164 ms 391656 KB Output is correct
6 Correct 160 ms 391624 KB Output is correct
7 Correct 157 ms 391632 KB Output is correct
8 Correct 159 ms 391628 KB Output is correct
9 Correct 164 ms 391720 KB Output is correct
10 Correct 153 ms 391764 KB Output is correct
11 Correct 153 ms 391640 KB Output is correct
12 Correct 152 ms 391620 KB Output is correct
13 Correct 151 ms 391648 KB Output is correct
14 Correct 159 ms 391660 KB Output is correct
15 Correct 156 ms 391636 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 391632 KB Output is correct
2 Correct 169 ms 391684 KB Output is correct
3 Correct 164 ms 391616 KB Output is correct
4 Correct 167 ms 391680 KB Output is correct
5 Correct 164 ms 391656 KB Output is correct
6 Correct 160 ms 391624 KB Output is correct
7 Correct 157 ms 391632 KB Output is correct
8 Correct 159 ms 391628 KB Output is correct
9 Correct 164 ms 391720 KB Output is correct
10 Correct 153 ms 391764 KB Output is correct
11 Correct 153 ms 391640 KB Output is correct
12 Correct 152 ms 391620 KB Output is correct
13 Correct 151 ms 391648 KB Output is correct
14 Correct 159 ms 391660 KB Output is correct
15 Correct 156 ms 391636 KB Output is correct
16 Correct 157 ms 392652 KB Output is correct
17 Correct 157 ms 392716 KB Output is correct
18 Correct 163 ms 392488 KB Output is correct
19 Correct 171 ms 392552 KB Output is correct
20 Correct 161 ms 392784 KB Output is correct
21 Correct 174 ms 392724 KB Output is correct
22 Correct 150 ms 392496 KB Output is correct
23 Correct 169 ms 392636 KB Output is correct
24 Correct 156 ms 392696 KB Output is correct
25 Correct 163 ms 392540 KB Output is correct
26 Correct 169 ms 392612 KB Output is correct
27 Correct 164 ms 392624 KB Output is correct
28 Correct 156 ms 392476 KB Output is correct
29 Correct 158 ms 392540 KB Output is correct
30 Correct 163 ms 392480 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 391632 KB Output is correct
2 Correct 169 ms 391684 KB Output is correct
3 Correct 164 ms 391616 KB Output is correct
4 Correct 167 ms 391680 KB Output is correct
5 Correct 164 ms 391656 KB Output is correct
6 Correct 160 ms 391624 KB Output is correct
7 Correct 157 ms 391632 KB Output is correct
8 Correct 159 ms 391628 KB Output is correct
9 Correct 164 ms 391720 KB Output is correct
10 Correct 153 ms 391764 KB Output is correct
11 Correct 153 ms 391640 KB Output is correct
12 Correct 152 ms 391620 KB Output is correct
13 Correct 151 ms 391648 KB Output is correct
14 Correct 159 ms 391660 KB Output is correct
15 Correct 156 ms 391636 KB Output is correct
16 Correct 157 ms 392652 KB Output is correct
17 Correct 157 ms 392716 KB Output is correct
18 Correct 163 ms 392488 KB Output is correct
19 Correct 171 ms 392552 KB Output is correct
20 Correct 161 ms 392784 KB Output is correct
21 Correct 174 ms 392724 KB Output is correct
22 Correct 150 ms 392496 KB Output is correct
23 Correct 169 ms 392636 KB Output is correct
24 Correct 156 ms 392696 KB Output is correct
25 Correct 163 ms 392540 KB Output is correct
26 Correct 169 ms 392612 KB Output is correct
27 Correct 164 ms 392624 KB Output is correct
28 Correct 156 ms 392476 KB Output is correct
29 Correct 158 ms 392540 KB Output is correct
30 Correct 163 ms 392480 KB Output is correct
31 Correct 291 ms 412700 KB Output is correct
32 Correct 283 ms 412624 KB Output is correct
33 Correct 169 ms 403884 KB Output is correct
34 Correct 254 ms 408336 KB Output is correct
35 Correct 371 ms 413172 KB Output is correct
36 Correct 310 ms 411840 KB Output is correct
37 Correct 179 ms 404660 KB Output is correct
38 Correct 397 ms 412120 KB Output is correct
39 Correct 316 ms 412984 KB Output is correct
40 Correct 321 ms 409052 KB Output is correct
41 Correct 323 ms 410264 KB Output is correct
42 Correct 386 ms 411704 KB Output is correct
43 Correct 262 ms 408428 KB Output is correct
44 Correct 221 ms 407520 KB Output is correct
45 Correct 196 ms 404600 KB Output is correct

Subtask #4
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 391632 KB Output is correct
2 Correct 169 ms 391684 KB Output is correct
3 Correct 164 ms 391616 KB Output is correct
4 Correct 167 ms 391680 KB Output is correct
5 Correct 164 ms 391656 KB Output is correct
6 Correct 160 ms 391624 KB Output is correct
7 Correct 157 ms 391632 KB Output is correct
8 Correct 159 ms 391628 KB Output is correct
9 Correct 164 ms 391720 KB Output is correct
10 Correct 153 ms 391764 KB Output is correct
11 Correct 153 ms 391640 KB Output is correct
12 Correct 152 ms 391620 KB Output is correct
13 Correct 151 ms 391648 KB Output is correct
14 Correct 159 ms 391660 KB Output is correct
15 Correct 156 ms 391636 KB Output is correct
16 Correct 144 ms 391688 KB Output is correct
17 Correct 141 ms 391628 KB Output is correct
18 Correct 162 ms 391692 KB Output is correct
19 Correct 155 ms 391620 KB Output is correct
20 Correct 143 ms 391660 KB Output is correct
21 Correct 156 ms 391736 KB Output is correct
22 Correct 139 ms 391652 KB Output is correct
23 Correct 144 ms 391664 KB Output is correct
24 Correct 146 ms 391628 KB Output is correct
25 Correct 142 ms 391628 KB Output is correct
26 Correct 140 ms 391640 KB Output is correct
27 Correct 141 ms 391668 KB Output is correct
28 Correct 141 ms 391676 KB Output is correct
29 Correct 158 ms 391684 KB Output is correct
30 Correct 147 ms 391612 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 391632 KB Output is correct
2 Correct 169 ms 391684 KB Output is correct
3 Correct 164 ms 391616 KB Output is correct
4 Correct 167 ms 391680 KB Output is correct
5 Correct 164 ms 391656 KB Output is correct
6 Correct 160 ms 391624 KB Output is correct
7 Correct 157 ms 391632 KB Output is correct
8 Correct 159 ms 391628 KB Output is correct
9 Correct 164 ms 391720 KB Output is correct
10 Correct 153 ms 391764 KB Output is correct
11 Correct 153 ms 391640 KB Output is correct
12 Correct 152 ms 391620 KB Output is correct
13 Correct 151 ms 391648 KB Output is correct
14 Correct 159 ms 391660 KB Output is correct
15 Correct 156 ms 391636 KB Output is correct
16 Correct 157 ms 392652 KB Output is correct
17 Correct 157 ms 392716 KB Output is correct
18 Correct 163 ms 392488 KB Output is correct
19 Correct 171 ms 392552 KB Output is correct
20 Correct 161 ms 392784 KB Output is correct
21 Correct 174 ms 392724 KB Output is correct
22 Correct 150 ms 392496 KB Output is correct
23 Correct 169 ms 392636 KB Output is correct
24 Correct 156 ms 392696 KB Output is correct
25 Correct 163 ms 392540 KB Output is correct
26 Correct 169 ms 392612 KB Output is correct
27 Correct 164 ms 392624 KB Output is correct
28 Correct 156 ms 392476 KB Output is correct
29 Correct 158 ms 392540 KB Output is correct
30 Correct 163 ms 392480 KB Output is correct
31 Correct 144 ms 391688 KB Output is correct
32 Correct 141 ms 391628 KB Output is correct
33 Correct 162 ms 391692 KB Output is correct
34 Correct 155 ms 391620 KB Output is correct
35 Correct 143 ms 391660 KB Output is correct
36 Correct 156 ms 391736 KB Output is correct
37 Correct 139 ms 391652 KB Output is correct
38 Correct 144 ms 391664 KB Output is correct
39 Correct 146 ms 391628 KB Output is correct
40 Correct 142 ms 391628 KB Output is correct
41 Correct 140 ms 391640 KB Output is correct
42 Correct 141 ms 391668 KB Output is correct
43 Correct 141 ms 391676 KB Output is correct
44 Correct 158 ms 391684 KB Output is correct
45 Correct 147 ms 391612 KB Output is correct
46 Correct 161 ms 392692 KB Output is correct
47 Correct 156 ms 392764 KB Output is correct
48 Correct 172 ms 392408 KB Output is correct
49 Correct 167 ms 392512 KB Output is correct
50 Correct 181 ms 392824 KB Output is correct
51 Correct 159 ms 392484 KB Output is correct
52 Correct 162 ms 392624 KB Output is correct
53 Correct 184 ms 392760 KB Output is correct
54 Correct 169 ms 392820 KB Output is correct
55 Correct 162 ms 392540 KB Output is correct
56 Correct 175 ms 392752 KB Output is correct
57 Correct 191 ms 392760 KB Output is correct
58 Correct 156 ms 392416 KB Output is correct
59 Correct 168 ms 392700 KB Output is correct
60 Correct 161 ms 392428 KB Output is correct

Subtask #6
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 391632 KB Output is correct
2 Correct 169 ms 391684 KB Output is correct
3 Correct 164 ms 391616 KB Output is correct
4 Correct 167 ms 391680 KB Output is correct
5 Correct 164 ms 391656 KB Output is correct
6 Correct 160 ms 391624 KB Output is correct
7 Correct 157 ms 391632 KB Output is correct
8 Correct 159 ms 391628 KB Output is correct
9 Correct 164 ms 391720 KB Output is correct
10 Correct 153 ms 391764 KB Output is correct
11 Correct 153 ms 391640 KB Output is correct
12 Correct 152 ms 391620 KB Output is correct
13 Correct 151 ms 391648 KB Output is correct
14 Correct 159 ms 391660 KB Output is correct
15 Correct 156 ms 391636 KB Output is correct
16 Correct 157 ms 392652 KB Output is correct
17 Correct 157 ms 392716 KB Output is correct
18 Correct 163 ms 392488 KB Output is correct
19 Correct 171 ms 392552 KB Output is correct
20 Correct 161 ms 392784 KB Output is correct
21 Correct 174 ms 392724 KB Output is correct
22 Correct 150 ms 392496 KB Output is correct
23 Correct 169 ms 392636 KB Output is correct
24 Correct 156 ms 392696 KB Output is correct
25 Correct 163 ms 392540 KB Output is correct
26 Correct 169 ms 392612 KB Output is correct
27 Correct 164 ms 392624 KB Output is correct
28 Correct 156 ms 392476 KB Output is correct
29 Correct 158 ms 392540 KB Output is correct
30 Correct 163 ms 392480 KB Output is correct
31 Correct 291 ms 412700 KB Output is correct
32 Correct 283 ms 412624 KB Output is correct
33 Correct 169 ms 403884 KB Output is correct
34 Correct 254 ms 408336 KB Output is correct
35 Correct 371 ms 413172 KB Output is correct
36 Correct 310 ms 411840 KB Output is correct
37 Correct 179 ms 404660 KB Output is correct
38 Correct 397 ms 412120 KB Output is correct
39 Correct 316 ms 412984 KB Output is correct
40 Correct 321 ms 409052 KB Output is correct
41 Correct 323 ms 410264 KB Output is correct
42 Correct 386 ms 411704 KB Output is correct
43 Correct 262 ms 408428 KB Output is correct
44 Correct 221 ms 407520 KB Output is correct
45 Correct 196 ms 404600 KB Output is correct
46 Correct 144 ms 391688 KB Output is correct
47 Correct 141 ms 391628 KB Output is correct
48 Correct 162 ms 391692 KB Output is correct
49 Correct 155 ms 391620 KB Output is correct
50 Correct 143 ms 391660 KB Output is correct
51 Correct 156 ms 391736 KB Output is correct
52 Correct 139 ms 391652 KB Output is correct
53 Correct 144 ms 391664 KB Output is correct
54 Correct 146 ms 391628 KB Output is correct
55 Correct 142 ms 391628 KB Output is correct
56 Correct 140 ms 391640 KB Output is correct
57 Correct 141 ms 391668 KB Output is correct
58 Correct 141 ms 391676 KB Output is correct
59 Correct 158 ms 391684 KB Output is correct
60 Correct 147 ms 391612 KB Output is correct
61 Correct 161 ms 392692 KB Output is correct
62 Correct 156 ms 392764 KB Output is correct
63 Correct 172 ms 392408 KB Output is correct
64 Correct 167 ms 392512 KB Output is correct
65 Correct 181 ms 392824 KB Output is correct
66 Correct 159 ms 392484 KB Output is correct
67 Correct 162 ms 392624 KB Output is correct
68 Correct 184 ms 392760 KB Output is correct
69 Correct 169 ms 392820 KB Output is correct
70 Correct 162 ms 392540 KB Output is correct
71 Correct 175 ms 392752 KB Output is correct
72 Correct 191 ms 392760 KB Output is correct
73 Correct 156 ms 392416 KB Output is correct
74 Correct 168 ms 392700 KB Output is correct
75 Correct 161 ms 392428 KB Output is correct
76 Correct 720 ms 413448 KB Output is correct
77 Correct 758 ms 412952 KB Output is correct
78 Correct 206 ms 404720 KB Output is correct
79 Correct 531 ms 409148 KB Output is correct
80 Runtime error 1448 ms 524288 KB Execution killed with signal 11
81 Halted 0 ms 0 KB -