oj.uz

Submission #791577

# Submission time Handle Problem Language Result Execution time Memory
791577 2023-07-24T07:38:12 Z 반딧불(#10046) Sličnost (COI23_slicnost) C++17
67 / 100
 584 ms 203716 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[10'000'000];
    int nodeCnt;

    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 = ++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 = ++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;
        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);
        }
    }

    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++) tree.update(d, Update(d, ql, qr, -1));
        for(int d=out1+1; d<out2; d++) 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]);
        tree.printAns();
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:111:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  111 |     scanf("%d %d %d", &n, &k, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:112:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |     for(int i=1; i<=n; i++) scanf("%d", &a[i]);
      |                             ~~~~~^~~~~~~~~~~~~
Main.cpp:115:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
Main.cpp:136:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  136 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 195932 KB Output is correct
2 Correct 74 ms 195988 KB Output is correct
3 Correct 76 ms 195948 KB Output is correct
4 Correct 72 ms 195896 KB Output is correct
5 Correct 73 ms 195928 KB Output is correct
6 Correct 74 ms 195900 KB Output is correct
7 Correct 84 ms 195932 KB Output is correct
8 Correct 77 ms 196008 KB Output is correct
9 Correct 73 ms 195908 KB Output is correct
10 Correct 74 ms 195996 KB Output is correct
11 Correct 75 ms 195988 KB Output is correct
12 Correct 75 ms 195980 KB Output is correct
13 Correct 78 ms 195928 KB Output is correct
14 Correct 75 ms 196008 KB Output is correct
15 Correct 73 ms 195988 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 195932 KB Output is correct
2 Correct 74 ms 195988 KB Output is correct
3 Correct 76 ms 195948 KB Output is correct
4 Correct 72 ms 195896 KB Output is correct
5 Correct 73 ms 195928 KB Output is correct
6 Correct 74 ms 195900 KB Output is correct
7 Correct 84 ms 195932 KB Output is correct
8 Correct 77 ms 196008 KB Output is correct
9 Correct 73 ms 195908 KB Output is correct
10 Correct 74 ms 195996 KB Output is correct
11 Correct 75 ms 195988 KB Output is correct
12 Correct 75 ms 195980 KB Output is correct
13 Correct 78 ms 195928 KB Output is correct
14 Correct 75 ms 196008 KB Output is correct
15 Correct 73 ms 195988 KB Output is correct
16 Correct 76 ms 196416 KB Output is correct
17 Correct 78 ms 196360 KB Output is correct
18 Correct 75 ms 196432 KB Output is correct
19 Correct 86 ms 196456 KB Output is correct
20 Correct 79 ms 196404 KB Output is correct
21 Correct 92 ms 196408 KB Output is correct
22 Correct 76 ms 196376 KB Output is correct
23 Correct 80 ms 196444 KB Output is correct
24 Correct 84 ms 196368 KB Output is correct
25 Correct 85 ms 196376 KB Output is correct
26 Correct 91 ms 196400 KB Output is correct
27 Correct 87 ms 196364 KB Output is correct
28 Correct 80 ms 196452 KB Output is correct
29 Correct 78 ms 196428 KB Output is correct
30 Correct 76 ms 196428 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 195932 KB Output is correct
2 Correct 74 ms 195988 KB Output is correct
3 Correct 76 ms 195948 KB Output is correct
4 Correct 72 ms 195896 KB Output is correct
5 Correct 73 ms 195928 KB Output is correct
6 Correct 74 ms 195900 KB Output is correct
7 Correct 84 ms 195932 KB Output is correct
8 Correct 77 ms 196008 KB Output is correct
9 Correct 73 ms 195908 KB Output is correct
10 Correct 74 ms 195996 KB Output is correct
11 Correct 75 ms 195988 KB Output is correct
12 Correct 75 ms 195980 KB Output is correct
13 Correct 78 ms 195928 KB Output is correct
14 Correct 75 ms 196008 KB Output is correct
15 Correct 73 ms 195988 KB Output is correct
16 Correct 76 ms 196416 KB Output is correct
17 Correct 78 ms 196360 KB Output is correct
18 Correct 75 ms 196432 KB Output is correct
19 Correct 86 ms 196456 KB Output is correct
20 Correct 79 ms 196404 KB Output is correct
21 Correct 92 ms 196408 KB Output is correct
22 Correct 76 ms 196376 KB Output is correct
23 Correct 80 ms 196444 KB Output is correct
24 Correct 84 ms 196368 KB Output is correct
25 Correct 85 ms 196376 KB Output is correct
26 Correct 91 ms 196400 KB Output is correct
27 Correct 87 ms 196364 KB Output is correct
28 Correct 80 ms 196452 KB Output is correct
29 Correct 78 ms 196428 KB Output is correct
30 Correct 76 ms 196428 KB Output is correct
31 Correct 164 ms 201780 KB Output is correct
32 Correct 170 ms 201732 KB Output is correct
33 Correct 102 ms 201728 KB Output is correct
34 Correct 199 ms 201764 KB Output is correct
35 Correct 262 ms 201792 KB Output is correct
36 Correct 178 ms 201672 KB Output is correct
37 Correct 102 ms 201800 KB Output is correct
38 Correct 276 ms 201692 KB Output is correct
39 Correct 177 ms 201736 KB Output is correct
40 Correct 236 ms 201680 KB Output is correct
41 Correct 254 ms 201700 KB Output is correct
42 Correct 297 ms 201644 KB Output is correct
43 Correct 211 ms 201700 KB Output is correct
44 Correct 178 ms 201768 KB Output is correct
45 Correct 115 ms 201764 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 195932 KB Output is correct
2 Correct 74 ms 195988 KB Output is correct
3 Correct 76 ms 195948 KB Output is correct
4 Correct 72 ms 195896 KB Output is correct
5 Correct 73 ms 195928 KB Output is correct
6 Correct 74 ms 195900 KB Output is correct
7 Correct 84 ms 195932 KB Output is correct
8 Correct 77 ms 196008 KB Output is correct
9 Correct 73 ms 195908 KB Output is correct
10 Correct 74 ms 195996 KB Output is correct
11 Correct 75 ms 195988 KB Output is correct
12 Correct 75 ms 195980 KB Output is correct
13 Correct 78 ms 195928 KB Output is correct
14 Correct 75 ms 196008 KB Output is correct
15 Correct 73 ms 195988 KB Output is correct
16 Correct 77 ms 195948 KB Output is correct
17 Correct 72 ms 195888 KB Output is correct
18 Correct 78 ms 195904 KB Output is correct
19 Correct 73 ms 195916 KB Output is correct
20 Correct 75 ms 195912 KB Output is correct
21 Correct 75 ms 195916 KB Output is correct
22 Correct 78 ms 195932 KB Output is correct
23 Correct 75 ms 195972 KB Output is correct
24 Correct 75 ms 196004 KB Output is correct
25 Correct 85 ms 195968 KB Output is correct
26 Correct 73 ms 195932 KB Output is correct
27 Correct 77 ms 195928 KB Output is correct
28 Correct 78 ms 195984 KB Output is correct
29 Correct 78 ms 195908 KB Output is correct
30 Correct 77 ms 195988 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 195932 KB Output is correct
2 Correct 74 ms 195988 KB Output is correct
3 Correct 76 ms 195948 KB Output is correct
4 Correct 72 ms 195896 KB Output is correct
5 Correct 73 ms 195928 KB Output is correct
6 Correct 74 ms 195900 KB Output is correct
7 Correct 84 ms 195932 KB Output is correct
8 Correct 77 ms 196008 KB Output is correct
9 Correct 73 ms 195908 KB Output is correct
10 Correct 74 ms 195996 KB Output is correct
11 Correct 75 ms 195988 KB Output is correct
12 Correct 75 ms 195980 KB Output is correct
13 Correct 78 ms 195928 KB Output is correct
14 Correct 75 ms 196008 KB Output is correct
15 Correct 73 ms 195988 KB Output is correct
16 Correct 76 ms 196416 KB Output is correct
17 Correct 78 ms 196360 KB Output is correct
18 Correct 75 ms 196432 KB Output is correct
19 Correct 86 ms 196456 KB Output is correct
20 Correct 79 ms 196404 KB Output is correct
21 Correct 92 ms 196408 KB Output is correct
22 Correct 76 ms 196376 KB Output is correct
23 Correct 80 ms 196444 KB Output is correct
24 Correct 84 ms 196368 KB Output is correct
25 Correct 85 ms 196376 KB Output is correct
26 Correct 91 ms 196400 KB Output is correct
27 Correct 87 ms 196364 KB Output is correct
28 Correct 80 ms 196452 KB Output is correct
29 Correct 78 ms 196428 KB Output is correct
30 Correct 76 ms 196428 KB Output is correct
31 Correct 77 ms 195948 KB Output is correct
32 Correct 72 ms 195888 KB Output is correct
33 Correct 78 ms 195904 KB Output is correct
34 Correct 73 ms 195916 KB Output is correct
35 Correct 75 ms 195912 KB Output is correct
36 Correct 75 ms 195916 KB Output is correct
37 Correct 78 ms 195932 KB Output is correct
38 Correct 75 ms 195972 KB Output is correct
39 Correct 75 ms 196004 KB Output is correct
40 Correct 85 ms 195968 KB Output is correct
41 Correct 73 ms 195932 KB Output is correct
42 Correct 77 ms 195928 KB Output is correct
43 Correct 78 ms 195984 KB Output is correct
44 Correct 78 ms 195908 KB Output is correct
45 Correct 77 ms 195988 KB Output is correct
46 Correct 89 ms 196388 KB Output is correct
47 Correct 90 ms 196400 KB Output is correct
48 Correct 83 ms 196388 KB Output is correct
49 Correct 99 ms 196460 KB Output is correct
50 Correct 98 ms 196404 KB Output is correct
51 Correct 81 ms 196448 KB Output is correct
52 Correct 98 ms 196436 KB Output is correct
53 Correct 94 ms 196384 KB Output is correct
54 Correct 89 ms 196372 KB Output is correct
55 Correct 81 ms 196428 KB Output is correct
56 Correct 106 ms 196416 KB Output is correct
57 Correct 97 ms 196404 KB Output is correct
58 Correct 81 ms 196380 KB Output is correct
59 Correct 95 ms 196460 KB Output is correct
60 Correct 81 ms 196412 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 195932 KB Output is correct
2 Correct 74 ms 195988 KB Output is correct
3 Correct 76 ms 195948 KB Output is correct
4 Correct 72 ms 195896 KB Output is correct
5 Correct 73 ms 195928 KB Output is correct
6 Correct 74 ms 195900 KB Output is correct
7 Correct 84 ms 195932 KB Output is correct
8 Correct 77 ms 196008 KB Output is correct
9 Correct 73 ms 195908 KB Output is correct
10 Correct 74 ms 195996 KB Output is correct
11 Correct 75 ms 195988 KB Output is correct
12 Correct 75 ms 195980 KB Output is correct
13 Correct 78 ms 195928 KB Output is correct
14 Correct 75 ms 196008 KB Output is correct
15 Correct 73 ms 195988 KB Output is correct
16 Correct 76 ms 196416 KB Output is correct
17 Correct 78 ms 196360 KB Output is correct
18 Correct 75 ms 196432 KB Output is correct
19 Correct 86 ms 196456 KB Output is correct
20 Correct 79 ms 196404 KB Output is correct
21 Correct 92 ms 196408 KB Output is correct
22 Correct 76 ms 196376 KB Output is correct
23 Correct 80 ms 196444 KB Output is correct
24 Correct 84 ms 196368 KB Output is correct
25 Correct 85 ms 196376 KB Output is correct
26 Correct 91 ms 196400 KB Output is correct
27 Correct 87 ms 196364 KB Output is correct
28 Correct 80 ms 196452 KB Output is correct
29 Correct 78 ms 196428 KB Output is correct
30 Correct 76 ms 196428 KB Output is correct
31 Correct 164 ms 201780 KB Output is correct
32 Correct 170 ms 201732 KB Output is correct
33 Correct 102 ms 201728 KB Output is correct
34 Correct 199 ms 201764 KB Output is correct
35 Correct 262 ms 201792 KB Output is correct
36 Correct 178 ms 201672 KB Output is correct
37 Correct 102 ms 201800 KB Output is correct
38 Correct 276 ms 201692 KB Output is correct
39 Correct 177 ms 201736 KB Output is correct
40 Correct 236 ms 201680 KB Output is correct
41 Correct 254 ms 201700 KB Output is correct
42 Correct 297 ms 201644 KB Output is correct
43 Correct 211 ms 201700 KB Output is correct
44 Correct 178 ms 201768 KB Output is correct
45 Correct 115 ms 201764 KB Output is correct
46 Correct 77 ms 195948 KB Output is correct
47 Correct 72 ms 195888 KB Output is correct
48 Correct 78 ms 195904 KB Output is correct
49 Correct 73 ms 195916 KB Output is correct
50 Correct 75 ms 195912 KB Output is correct
51 Correct 75 ms 195916 KB Output is correct
52 Correct 78 ms 195932 KB Output is correct
53 Correct 75 ms 195972 KB Output is correct
54 Correct 75 ms 196004 KB Output is correct
55 Correct 85 ms 195968 KB Output is correct
56 Correct 73 ms 195932 KB Output is correct
57 Correct 77 ms 195928 KB Output is correct
58 Correct 78 ms 195984 KB Output is correct
59 Correct 78 ms 195908 KB Output is correct
60 Correct 77 ms 195988 KB Output is correct
61 Correct 89 ms 196388 KB Output is correct
62 Correct 90 ms 196400 KB Output is correct
63 Correct 83 ms 196388 KB Output is correct
64 Correct 99 ms 196460 KB Output is correct
65 Correct 98 ms 196404 KB Output is correct
66 Correct 81 ms 196448 KB Output is correct
67 Correct 98 ms 196436 KB Output is correct
68 Correct 94 ms 196384 KB Output is correct
69 Correct 89 ms 196372 KB Output is correct
70 Correct 81 ms 196428 KB Output is correct
71 Correct 106 ms 196416 KB Output is correct
72 Correct 97 ms 196404 KB Output is correct
73 Correct 81 ms 196380 KB Output is correct
74 Correct 95 ms 196460 KB Output is correct
75 Correct 81 ms 196412 KB Output is correct
76 Incorrect 584 ms 203716 KB Output isn't correct
77 Halted 0 ms 0 KB -