oj.uz

답안 #791601

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
791601 2023-07-24T07:55:41 Z 반딧불(#10046) Sličnost (COI23_slicnost) C++17
100 / 100
 1446 ms 399232 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct Update{
    int t, l, r, v;
    Update(){}
    Update(int t, int l, int r, int v): t(t), l(l), r(r), v(v){}

    bool operator<(const Update &nxt)const{
        return t<nxt.t;
    }
};

struct PST{
    struct Node{
        int lc, rc;
        int val, maxSum, maxCnt; /// �� ������ ���� +��, �� ���������� �ִ�

        Node(){
            lc = rc = 0;
            val = maxSum = 0, maxCnt = 1;
        }
        Node(int lc, int rc, int val, int maxSum, int maxCnt):
            lc(lc), rc(rc), val(val), maxSum(maxSum), maxCnt(maxCnt){}
    } nodes[20'000'000];
    int nodeCnt, nodeEnd;

    void init(int i, int l, int r){
        if(l==r) return;
        int m = (l+r)>>1;
        nodes[i].lc = ++nodeCnt;
        init(nodes[i].lc, l, m);
        nodes[i].rc = ++nodeCnt;
        init(nodes[i].rc, m+1, r);
        nodes[i].maxCnt = nodes[nodes[i].lc].maxCnt + nodes[nodes[i].rc].maxCnt;
    }

    int update(int i, int l, int r, int s, int e, int v){
        if(s<=l && r<=e){
            int tmp = (i > nodeEnd ? i : ++nodeCnt);
            nodes[tmp] = nodes[i];
            nodes[tmp].val += v;
            if(l==r) nodes[tmp].maxSum = nodes[tmp].val;
            else{
                nodes[tmp].maxSum = nodes[tmp].val + max(nodes[nodes[tmp].lc].maxSum, nodes[nodes[tmp].rc].maxSum);
                nodes[tmp].maxCnt = (nodes[nodes[tmp].lc].maxSum >= nodes[nodes[tmp].rc].maxSum ? nodes[nodes[tmp].lc].maxCnt : 0) +
                              (nodes[nodes[tmp].rc].maxSum >= nodes[nodes[tmp].lc].maxSum ? nodes[nodes[tmp].rc].maxCnt : 0);
            }
            return tmp;
        }
        int m = (l+r)>>1;
        int tmp = (i > nodeEnd ? i : ++nodeCnt);
        nodes[tmp] = nodes[i];
        if(s<=m) nodes[tmp].lc = update(nodes[tmp].lc, l, m, s, e, v);
        if(m<e)  nodes[tmp].rc = update(nodes[tmp].rc, m+1, r, s, e, v);
        nodes[tmp].maxSum = nodes[tmp].val + max(nodes[nodes[tmp].lc].maxSum, nodes[nodes[tmp].rc].maxSum);
        nodes[tmp].maxCnt = (nodes[nodes[tmp].lc].maxSum >= nodes[nodes[tmp].rc].maxSum ? nodes[nodes[tmp].lc].maxCnt : 0) +
                      (nodes[nodes[tmp].rc].maxSum >= nodes[nodes[tmp].lc].maxSum ? nodes[nodes[tmp].rc].maxCnt : 0);
        return tmp;
    }

    int root[200002];
    int L;
    map<int, ll> mp;

    inline void mpAdd(int x, ll v){
        mp[x] += v;
    }

    inline void mpErase(int x, ll v){
        mp[x] -= v;
        if(!mp[x]) mp.erase(x);
    }

    void init(int _L, vector<Update> &vec){
        L = _L;
        root[0] = ++nodeCnt;
        init(root[0], 1, L);

        int pnt = 0;
        nodeEnd = INT_MAX;
        for(int t=1; t<=L*2; t++){
            root[t] = root[t-1];
            while(pnt < (int)vec.size() && vec[pnt].t == t){
                root[t] = update(root[t], 1, L, vec[pnt].l, vec[pnt].r, vec[pnt].v);
//                printf("Root %d: add %d %d %d\n", vec[pnt].t, vec[pnt].l, vec[pnt].r, vec[pnt].v);
                pnt++;
            }
            if(t%2) mpAdd(nodes[root[t]].maxSum, nodes[root[t]].maxCnt);
        }
        nodeEnd = nodeCnt;
    }

    void update(int t, Update p){
        if(t%2) mpErase(nodes[root[t]].maxSum, nodes[root[t]].maxCnt);
        root[t] = update(root[t], 1, L, p.l, p.r, p.v);
        if(t%2) mpAdd(nodes[root[t]].maxSum, nodes[root[t]].maxCnt);
    }

    void printAns(){
        printf("%d %lld\n", mp.rbegin()->first, mp.rbegin()->second);
    }
} tree;

int n, k, q;
int a[100002], idx[100002];
int in[100002], out[100002];

int main(){
    scanf("%d %d %d", &n, &k, &q);
    for(int i=1; i<=n; i++) scanf("%d", &a[i]);
    for(int i=1; i<=n; i++){
        int x;
        scanf("%d", &x);
        idx[x] = i;
    }

    /// �ʱ� ���� ���� �����
    vector<Update> updateVec;
    for(int i=1; i<=n; i++){
        in[i] = max(1, i-k+1);
        out[i] = min(i, n-k+1);
    }
    for(int i=1; i<=n; i++){
        updateVec.push_back(Update(in[i]*2-1, in[idx[a[i]]], out[idx[a[i]]], 1));
        updateVec.push_back(Update(out[i]*2, in[idx[a[i]]], out[idx[a[i]]], -1));
    }
    sort(updateVec.begin(), updateVec.end());
    tree.init(n-k+1, updateVec);
    tree.printAns();

    /// ���� ó���ϱ�
    while(q--){
        int x;
        scanf("%d", &x);
        /// x�� x+1�� ������ �۾�
        int in1 = in[x]*2-1, in2 = in[x+1]*2-1;
        int out1 = out[x]*2, out2 = out[x+1]*2;
        int ql = in[idx[a[x]]], qr = out[idx[a[x]]];

        for(int d=in1; d<in2; d++) if(d&1) tree.update(d, Update(d, ql, qr, -1));
        for(int d=out1+1; d<out2; d++) if(d&1) tree.update(d, Update(d, ql, qr, 1));

        /// x+1�� x�� ������ �۾�
        ql = in[idx[a[x+1]]], qr = out[idx[a[x+1]]];
        for(int d=in1; d<in2; d++) if(d&1) tree.update(d, Update(d, ql, qr, 1));
        for(int d=out1+1; d<out2; d++) if(d&1) tree.update(d, Update(d, ql, qr, -1));

        /// �� ��ȯ
        swap(a[x], a[x+1]);
        if(tree.nodeCnt > 19'000'000) while(1) printf("");
        tree.printAns();
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:154:55: warning: zero-length gnu_printf format string [-Wformat-zero-length]
  154 |         if(tree.nodeCnt > 19'000'000) while(1) printf("");
      |                                                       ^~
Main.cpp:113:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |     scanf("%d %d %d", &n, &k, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:114:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |     for(int i=1; i<=n; i++) scanf("%d", &a[i]);
      |                             ~~~~~^~~~~~~~~~~~~
Main.cpp:117:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
Main.cpp:138:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  138 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 391628 KB Output is correct
2 Correct 143 ms 391684 KB Output is correct
3 Correct 145 ms 391684 KB Output is correct
4 Correct 143 ms 391628 KB Output is correct
5 Correct 145 ms 391592 KB Output is correct
6 Correct 148 ms 391588 KB Output is correct
7 Correct 144 ms 391588 KB Output is correct
8 Correct 148 ms 391604 KB Output is correct
9 Correct 144 ms 391656 KB Output is correct
10 Correct 146 ms 391700 KB Output is correct
11 Correct 145 ms 391688 KB Output is correct
12 Correct 148 ms 391696 KB Output is correct
13 Correct 166 ms 391636 KB Output is correct
14 Correct 144 ms 391680 KB Output is correct
15 Correct 150 ms 391664 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 391628 KB Output is correct
2 Correct 143 ms 391684 KB Output is correct
3 Correct 145 ms 391684 KB Output is correct
4 Correct 143 ms 391628 KB Output is correct
5 Correct 145 ms 391592 KB Output is correct
6 Correct 148 ms 391588 KB Output is correct
7 Correct 144 ms 391588 KB Output is correct
8 Correct 148 ms 391604 KB Output is correct
9 Correct 144 ms 391656 KB Output is correct
10 Correct 146 ms 391700 KB Output is correct
11 Correct 145 ms 391688 KB Output is correct
12 Correct 148 ms 391696 KB Output is correct
13 Correct 166 ms 391636 KB Output is correct
14 Correct 144 ms 391680 KB Output is correct
15 Correct 150 ms 391664 KB Output is correct
16 Correct 156 ms 392244 KB Output is correct
17 Correct 146 ms 392140 KB Output is correct
18 Correct 145 ms 392060 KB Output is correct
19 Correct 175 ms 392092 KB Output is correct
20 Correct 154 ms 392176 KB Output is correct
21 Correct 155 ms 392152 KB Output is correct
22 Correct 161 ms 392136 KB Output is correct
23 Correct 163 ms 392128 KB Output is correct
24 Correct 149 ms 392116 KB Output is correct
25 Correct 148 ms 392144 KB Output is correct
26 Correct 151 ms 392140 KB Output is correct
27 Correct 151 ms 392040 KB Output is correct
28 Correct 150 ms 392140 KB Output is correct
29 Correct 150 ms 392140 KB Output is correct
30 Correct 147 ms 392060 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 391628 KB Output is correct
2 Correct 143 ms 391684 KB Output is correct
3 Correct 145 ms 391684 KB Output is correct
4 Correct 143 ms 391628 KB Output is correct
5 Correct 145 ms 391592 KB Output is correct
6 Correct 148 ms 391588 KB Output is correct
7 Correct 144 ms 391588 KB Output is correct
8 Correct 148 ms 391604 KB Output is correct
9 Correct 144 ms 391656 KB Output is correct
10 Correct 146 ms 391700 KB Output is correct
11 Correct 145 ms 391688 KB Output is correct
12 Correct 148 ms 391696 KB Output is correct
13 Correct 166 ms 391636 KB Output is correct
14 Correct 144 ms 391680 KB Output is correct
15 Correct 150 ms 391664 KB Output is correct
16 Correct 156 ms 392244 KB Output is correct
17 Correct 146 ms 392140 KB Output is correct
18 Correct 145 ms 392060 KB Output is correct
19 Correct 175 ms 392092 KB Output is correct
20 Correct 154 ms 392176 KB Output is correct
21 Correct 155 ms 392152 KB Output is correct
22 Correct 161 ms 392136 KB Output is correct
23 Correct 163 ms 392128 KB Output is correct
24 Correct 149 ms 392116 KB Output is correct
25 Correct 148 ms 392144 KB Output is correct
26 Correct 151 ms 392140 KB Output is correct
27 Correct 151 ms 392040 KB Output is correct
28 Correct 150 ms 392140 KB Output is correct
29 Correct 150 ms 392140 KB Output is correct
30 Correct 147 ms 392060 KB Output is correct
31 Correct 245 ms 397364 KB Output is correct
32 Correct 246 ms 397380 KB Output is correct
33 Correct 168 ms 397444 KB Output is correct
34 Correct 301 ms 397448 KB Output is correct
35 Correct 334 ms 397368 KB Output is correct
36 Correct 249 ms 397364 KB Output is correct
37 Correct 179 ms 397568 KB Output is correct
38 Correct 329 ms 397356 KB Output is correct
39 Correct 263 ms 397424 KB Output is correct
40 Correct 310 ms 397348 KB Output is correct
41 Correct 350 ms 397412 KB Output is correct
42 Correct 378 ms 397412 KB Output is correct
43 Correct 297 ms 397344 KB Output is correct
44 Correct 249 ms 397384 KB Output is correct
45 Correct 183 ms 397428 KB Output is correct

Subtask #4
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 391628 KB Output is correct
2 Correct 143 ms 391684 KB Output is correct
3 Correct 145 ms 391684 KB Output is correct
4 Correct 143 ms 391628 KB Output is correct
5 Correct 145 ms 391592 KB Output is correct
6 Correct 148 ms 391588 KB Output is correct
7 Correct 144 ms 391588 KB Output is correct
8 Correct 148 ms 391604 KB Output is correct
9 Correct 144 ms 391656 KB Output is correct
10 Correct 146 ms 391700 KB Output is correct
11 Correct 145 ms 391688 KB Output is correct
12 Correct 148 ms 391696 KB Output is correct
13 Correct 166 ms 391636 KB Output is correct
14 Correct 144 ms 391680 KB Output is correct
15 Correct 150 ms 391664 KB Output is correct
16 Correct 144 ms 391628 KB Output is correct
17 Correct 144 ms 391652 KB Output is correct
18 Correct 144 ms 391616 KB Output is correct
19 Correct 144 ms 391600 KB Output is correct
20 Correct 144 ms 391644 KB Output is correct
21 Correct 145 ms 391704 KB Output is correct
22 Correct 149 ms 391680 KB Output is correct
23 Correct 144 ms 391624 KB Output is correct
24 Correct 147 ms 391700 KB Output is correct
25 Correct 150 ms 391612 KB Output is correct
26 Correct 145 ms 391632 KB Output is correct
27 Correct 150 ms 391632 KB Output is correct
28 Correct 146 ms 391708 KB Output is correct
29 Correct 155 ms 391804 KB Output is correct
30 Correct 162 ms 391664 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 391628 KB Output is correct
2 Correct 143 ms 391684 KB Output is correct
3 Correct 145 ms 391684 KB Output is correct
4 Correct 143 ms 391628 KB Output is correct
5 Correct 145 ms 391592 KB Output is correct
6 Correct 148 ms 391588 KB Output is correct
7 Correct 144 ms 391588 KB Output is correct
8 Correct 148 ms 391604 KB Output is correct
9 Correct 144 ms 391656 KB Output is correct
10 Correct 146 ms 391700 KB Output is correct
11 Correct 145 ms 391688 KB Output is correct
12 Correct 148 ms 391696 KB Output is correct
13 Correct 166 ms 391636 KB Output is correct
14 Correct 144 ms 391680 KB Output is correct
15 Correct 150 ms 391664 KB Output is correct
16 Correct 156 ms 392244 KB Output is correct
17 Correct 146 ms 392140 KB Output is correct
18 Correct 145 ms 392060 KB Output is correct
19 Correct 175 ms 392092 KB Output is correct
20 Correct 154 ms 392176 KB Output is correct
21 Correct 155 ms 392152 KB Output is correct
22 Correct 161 ms 392136 KB Output is correct
23 Correct 163 ms 392128 KB Output is correct
24 Correct 149 ms 392116 KB Output is correct
25 Correct 148 ms 392144 KB Output is correct
26 Correct 151 ms 392140 KB Output is correct
27 Correct 151 ms 392040 KB Output is correct
28 Correct 150 ms 392140 KB Output is correct
29 Correct 150 ms 392140 KB Output is correct
30 Correct 147 ms 392060 KB Output is correct
31 Correct 144 ms 391628 KB Output is correct
32 Correct 144 ms 391652 KB Output is correct
33 Correct 144 ms 391616 KB Output is correct
34 Correct 144 ms 391600 KB Output is correct
35 Correct 144 ms 391644 KB Output is correct
36 Correct 145 ms 391704 KB Output is correct
37 Correct 149 ms 391680 KB Output is correct
38 Correct 144 ms 391624 KB Output is correct
39 Correct 147 ms 391700 KB Output is correct
40 Correct 150 ms 391612 KB Output is correct
41 Correct 145 ms 391632 KB Output is correct
42 Correct 150 ms 391632 KB Output is correct
43 Correct 146 ms 391708 KB Output is correct
44 Correct 155 ms 391804 KB Output is correct
45 Correct 162 ms 391664 KB Output is correct
46 Correct 154 ms 392148 KB Output is correct
47 Correct 153 ms 392124 KB Output is correct
48 Correct 164 ms 392156 KB Output is correct
49 Correct 159 ms 392196 KB Output is correct
50 Correct 161 ms 392160 KB Output is correct
51 Correct 155 ms 392104 KB Output is correct
52 Correct 154 ms 392204 KB Output is correct
53 Correct 193 ms 392092 KB Output is correct
54 Correct 160 ms 392164 KB Output is correct
55 Correct 158 ms 392192 KB Output is correct
56 Correct 162 ms 392156 KB Output is correct
57 Correct 160 ms 392136 KB Output is correct
58 Correct 147 ms 392140 KB Output is correct
59 Correct 160 ms 392140 KB Output is correct
60 Correct 151 ms 392168 KB Output is correct

Subtask #6
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 391628 KB Output is correct
2 Correct 143 ms 391684 KB Output is correct
3 Correct 145 ms 391684 KB Output is correct
4 Correct 143 ms 391628 KB Output is correct
5 Correct 145 ms 391592 KB Output is correct
6 Correct 148 ms 391588 KB Output is correct
7 Correct 144 ms 391588 KB Output is correct
8 Correct 148 ms 391604 KB Output is correct
9 Correct 144 ms 391656 KB Output is correct
10 Correct 146 ms 391700 KB Output is correct
11 Correct 145 ms 391688 KB Output is correct
12 Correct 148 ms 391696 KB Output is correct
13 Correct 166 ms 391636 KB Output is correct
14 Correct 144 ms 391680 KB Output is correct
15 Correct 150 ms 391664 KB Output is correct
16 Correct 156 ms 392244 KB Output is correct
17 Correct 146 ms 392140 KB Output is correct
18 Correct 145 ms 392060 KB Output is correct
19 Correct 175 ms 392092 KB Output is correct
20 Correct 154 ms 392176 KB Output is correct
21 Correct 155 ms 392152 KB Output is correct
22 Correct 161 ms 392136 KB Output is correct
23 Correct 163 ms 392128 KB Output is correct
24 Correct 149 ms 392116 KB Output is correct
25 Correct 148 ms 392144 KB Output is correct
26 Correct 151 ms 392140 KB Output is correct
27 Correct 151 ms 392040 KB Output is correct
28 Correct 150 ms 392140 KB Output is correct
29 Correct 150 ms 392140 KB Output is correct
30 Correct 147 ms 392060 KB Output is correct
31 Correct 245 ms 397364 KB Output is correct
32 Correct 246 ms 397380 KB Output is correct
33 Correct 168 ms 397444 KB Output is correct
34 Correct 301 ms 397448 KB Output is correct
35 Correct 334 ms 397368 KB Output is correct
36 Correct 249 ms 397364 KB Output is correct
37 Correct 179 ms 397568 KB Output is correct
38 Correct 329 ms 397356 KB Output is correct
39 Correct 263 ms 397424 KB Output is correct
40 Correct 310 ms 397348 KB Output is correct
41 Correct 350 ms 397412 KB Output is correct
42 Correct 378 ms 397412 KB Output is correct
43 Correct 297 ms 397344 KB Output is correct
44 Correct 249 ms 397384 KB Output is correct
45 Correct 183 ms 397428 KB Output is correct
46 Correct 144 ms 391628 KB Output is correct
47 Correct 144 ms 391652 KB Output is correct
48 Correct 144 ms 391616 KB Output is correct
49 Correct 144 ms 391600 KB Output is correct
50 Correct 144 ms 391644 KB Output is correct
51 Correct 145 ms 391704 KB Output is correct
52 Correct 149 ms 391680 KB Output is correct
53 Correct 144 ms 391624 KB Output is correct
54 Correct 147 ms 391700 KB Output is correct
55 Correct 150 ms 391612 KB Output is correct
56 Correct 145 ms 391632 KB Output is correct
57 Correct 150 ms 391632 KB Output is correct
58 Correct 146 ms 391708 KB Output is correct
59 Correct 155 ms 391804 KB Output is correct
60 Correct 162 ms 391664 KB Output is correct
61 Correct 154 ms 392148 KB Output is correct
62 Correct 153 ms 392124 KB Output is correct
63 Correct 164 ms 392156 KB Output is correct
64 Correct 159 ms 392196 KB Output is correct
65 Correct 161 ms 392160 KB Output is correct
66 Correct 155 ms 392104 KB Output is correct
67 Correct 154 ms 392204 KB Output is correct
68 Correct 193 ms 392092 KB Output is correct
69 Correct 160 ms 392164 KB Output is correct
70 Correct 158 ms 392192 KB Output is correct
71 Correct 162 ms 392156 KB Output is correct
72 Correct 160 ms 392136 KB Output is correct
73 Correct 147 ms 392140 KB Output is correct
74 Correct 160 ms 392140 KB Output is correct
75 Correct 151 ms 392168 KB Output is correct
76 Correct 589 ms 398448 KB Output is correct
77 Correct 689 ms 398076 KB Output is correct
78 Correct 205 ms 397788 KB Output is correct
79 Correct 650 ms 398264 KB Output is correct
80 Correct 1146 ms 398424 KB Output is correct
81 Correct 231 ms 398496 KB Output is correct
82 Correct 507 ms 399128 KB Output is correct
83 Correct 1160 ms 398540 KB Output is correct
84 Correct 787 ms 399232 KB Output is correct
85 Correct 335 ms 398440 KB Output is correct
86 Correct 1409 ms 398824 KB Output is correct
87 Correct 1446 ms 399120 KB Output is correct
88 Correct 338 ms 398920 KB Output is correct
89 Correct 1238 ms 398752 KB Output is correct
90 Correct 324 ms 398312 KB Output is correct