oj.uz

Submission #1017870

# Submission time Handle Problem Language Result Execution time Memory
1017870 2024-07-09T10:53:00 Z stefanopulos Sličnost (COI23_slicnost) C++17
100 / 100
 1415 ms 433492 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)
 
const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 100005; 
 
int n, k, q;
int A[mxN];
int B[mxN];
 
int poz[mxN];
 
int L[mxN];
int R[mxN];
 
int idx = 0;
int ls[250 * mxN], rs[250 * mxN], root[250 * mxN];
int mx[250 * mxN], sum[250 * mxN], cnt[250 * mxN];
void build(int& v, int tl, int tr){
    v = ++idx;
    if(tl == tr){
        mx[v] = sum[v] = 0;
        cnt[v] = 1;
        return;
    }
    int mid = (tl + tr) / 2;
    build(ls[v], tl, mid); build(rs[v], mid + 1, tr);

    sum[v] = sum[ls[v]] + sum[rs[v]];
    mx[v] = max(mx[ls[v]], mx[rs[v]] + sum[ls[v]]);
    cnt[v] = (mx[v] == mx[ls[v]] ? cnt[ls[v]] : 0) + (mx[v] == mx[rs[v]] + sum[ls[v]] ? cnt[rs[v]] : 0);
}

void update(int& v, int rv, int tl, int tr, int pos, int val){
    v = ++idx; ls[v] = ls[rv]; rs[v] = rs[rv]; mx[v] = mx[rv]; sum[v] = sum[rv]; cnt[v] = cnt[rv];
    if(tl == tr){
        mx[v] += val;
        sum[v] += val;
        return;
    }
    int mid = (tl + tr) / 2;
    if(pos <= mid)update(ls[v], ls[rv], tl, mid, pos, val);
    else update(rs[v], rs[rv], mid + 1, tr, pos, val);

    sum[v] = sum[ls[v]] + sum[rs[v]];
    mx[v] = max(mx[ls[v]], mx[rs[v]] + sum[ls[v]]);
    cnt[v] = (mx[v] == mx[ls[v]] ? cnt[ls[v]] : 0) + (mx[v] == mx[rs[v]] + sum[ls[v]] ? cnt[rs[v]] : 0);

}

struct SegTree{
    ll bor[4 * mxN][2];
    void update(int v, int tl, int tr, int pos, int val, ll cnt){
        if(tl == tr){
            bor[v][0] = val;
            bor[v][1] = cnt;
            return;
        }
        int mid = (tl + tr) / 2;
        if(pos <= mid)update(v * 2, tl, mid, pos, val, cnt);
        else update(v * 2 + 1, mid + 1, tr, pos, val, cnt);
        bor[v][0] = max(bor[v * 2][0], bor[v * 2 + 1][0]);
        bor[v][1] = (bor[v][0] == bor[v * 2][0] ? bor[v * 2][1] : 0) + (bor[v][0] == bor[v * 2 + 1][0] ? bor[v * 2 + 1][1] : 0);
    }
}drvo;

void calc(){

    idx = 0;
    build(root[k],1,n - k + 1);
    ff(i,1,k){
        int l = L[poz[A[i]]];
        int r = R[poz[A[i]]];
        update(root[k],root[k],1,n - k + 1,l,1);
        if(r < n - k + 1)update(root[k],root[k],1,n - k + 1,r + 1,-1);
    }
    
    drvo.update(1,1,n - k + 1,1,mx[root[k]],cnt[root[k]]);
    ff(i,k + 1,n){
        int l1 = L[poz[A[i - k]]];
        int r1 = R[poz[A[i - k]]];
        update(root[i],root[i - 1],1,n - k + 1,l1,-1);
        if(r1 < n - k + 1)update(root[i],root[i],1,n - k + 1,r1 + 1,1);
 
        int l2 = L[poz[A[i]]];
        int r2 = R[poz[A[i]]];
        update(root[i],root[i],1,n - k + 1,l2,1);
        if(r2 < n - k + 1)update(root[i],root[i],1,n - k + 1,r2 + 1,-1);

        drvo.update(1,1,n - k + 1,i - k + 1,mx[root[i]],cnt[root[i]]);

    }
 
}
 
int main(){
    cin.tie(0)->sync_with_stdio(0);
 
    cin >> n >> k >> q;
    ff(i,1,n)cin >> A[i];
    ff(i,1,n)cin >> B[i], poz[B[i]] = i;
 
    ff(i,1,n){
        L[i] = max(1, i - k + 1);
        R[i] = min(i, n - k + 1);
    }
 
    calc();
 
    int najv = drvo.bor[1][0]; ll br = drvo.bor[1][1];
    cout << najv << " " << br << '\n';
    while(q--){
        int t;
        cin >> t;

        if(t - k + 1 >= 1){
            int x = t;
            if(mx[root[x]] == najv)br -= cnt[root[x]];

            int l1 = L[poz[A[t]]];
            int r1 = R[poz[A[t]]];
            update(root[x],root[x],1,n - k + 1,l1,-1);
            if(r1 < n - k + 1)update(root[x],root[x],1,n - k + 1,r1 + 1,1);

            int l2 = L[poz[A[t + 1]]];
            int r2 = R[poz[A[t + 1]]];
            update(root[x],root[x],1,n - k + 1,l2,1);
            if(r2 < n - k + 1)update(root[x],root[x],1,n - k + 1,r2 + 1,-1);

            drvo.update(1,1,n - k + 1,x - k + 1,mx[root[x]],cnt[root[x]]);

        }
 
        if(t + k <= n){
            int x = t + k;
            if(mx[root[x]] == najv)br -= cnt[root[x]];

            int l1 = L[poz[A[t + 1]]];
            int r1 = R[poz[A[t + 1]]];
            update(root[x],root[x],1,n - k + 1,l1,-1);
            if(r1 < n - k + 1)update(root[x],root[x],1,n - k + 1,r1 + 1,1);

            int l2 = L[poz[A[t]]];
            int r2 = R[poz[A[t]]];
            update(root[x],root[x],1,n - k + 1,l2,1);
            if(r2 < n - k + 1)update(root[x],root[x],1,n - k + 1,r2 + 1,-1);

            drvo.update(1,1,n - k + 1,x - k + 1,mx[root[x]],cnt[root[x]]);

        }

        swap(A[t], A[t + 1]);

        najv = drvo.bor[1][0]; br = drvo.bor[1][1];
        cout << najv << " " << br << '\n';
 
    }
 
    return 0;
}
/*
 
4 3 0
2 4 1 3
1 2 3 4


5 3 1
1 4 3 2 5
4 5 1 2 3
3


 
// probati bojenje sahovski
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14680 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14680 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 8 ms 23128 KB Output is correct
17 Correct 8 ms 23064 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 5 ms 16984 KB Output is correct
20 Correct 8 ms 23168 KB Output is correct
21 Correct 7 ms 23132 KB Output is correct
22 Correct 3 ms 16892 KB Output is correct
23 Correct 9 ms 23132 KB Output is correct
24 Correct 7 ms 23132 KB Output is correct
25 Correct 6 ms 19036 KB Output is correct
26 Correct 6 ms 21080 KB Output is correct
27 Correct 8 ms 23132 KB Output is correct
28 Correct 5 ms 19036 KB Output is correct
29 Correct 5 ms 16728 KB Output is correct
30 Correct 4 ms 16732 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14680 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 8 ms 23128 KB Output is correct
17 Correct 8 ms 23064 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 5 ms 16984 KB Output is correct
20 Correct 8 ms 23168 KB Output is correct
21 Correct 7 ms 23132 KB Output is correct
22 Correct 3 ms 16892 KB Output is correct
23 Correct 9 ms 23132 KB Output is correct
24 Correct 7 ms 23132 KB Output is correct
25 Correct 6 ms 19036 KB Output is correct
26 Correct 6 ms 21080 KB Output is correct
27 Correct 8 ms 23132 KB Output is correct
28 Correct 5 ms 19036 KB Output is correct
29 Correct 5 ms 16728 KB Output is correct
30 Correct 4 ms 16732 KB Output is correct
31 Correct 228 ms 153940 KB Output is correct
32 Correct 226 ms 152912 KB Output is correct
33 Correct 12 ms 13404 KB Output is correct
34 Correct 134 ms 87140 KB Output is correct
35 Correct 291 ms 156756 KB Output is correct
36 Correct 177 ms 145236 KB Output is correct
37 Correct 43 ms 47700 KB Output is correct
38 Correct 263 ms 150096 KB Output is correct
39 Correct 204 ms 155728 KB Output is correct
40 Correct 169 ms 99672 KB Output is correct
41 Correct 191 ms 114512 KB Output is correct
42 Correct 252 ms 141436 KB Output is correct
43 Correct 143 ms 91548 KB Output is correct
44 Correct 108 ms 76884 KB Output is correct
45 Correct 48 ms 49744 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14680 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 2 ms 14832 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 14684 KB Output is correct
20 Correct 1 ms 14684 KB Output is correct
21 Correct 1 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14812 KB Output is correct
24 Correct 2 ms 14684 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 2 ms 14684 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 1 ms 14684 KB Output is correct
29 Correct 1 ms 14684 KB Output is correct
30 Correct 2 ms 14684 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14680 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 8 ms 23128 KB Output is correct
17 Correct 8 ms 23064 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 5 ms 16984 KB Output is correct
20 Correct 8 ms 23168 KB Output is correct
21 Correct 7 ms 23132 KB Output is correct
22 Correct 3 ms 16892 KB Output is correct
23 Correct 9 ms 23132 KB Output is correct
24 Correct 7 ms 23132 KB Output is correct
25 Correct 6 ms 19036 KB Output is correct
26 Correct 6 ms 21080 KB Output is correct
27 Correct 8 ms 23132 KB Output is correct
28 Correct 5 ms 19036 KB Output is correct
29 Correct 5 ms 16728 KB Output is correct
30 Correct 4 ms 16732 KB Output is correct
31 Correct 2 ms 14680 KB Output is correct
32 Correct 2 ms 14832 KB Output is correct
33 Correct 1 ms 10588 KB Output is correct
34 Correct 1 ms 14684 KB Output is correct
35 Correct 1 ms 14684 KB Output is correct
36 Correct 1 ms 14684 KB Output is correct
37 Correct 2 ms 14684 KB Output is correct
38 Correct 2 ms 14812 KB Output is correct
39 Correct 2 ms 14684 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 2 ms 14684 KB Output is correct
42 Correct 2 ms 14684 KB Output is correct
43 Correct 1 ms 14684 KB Output is correct
44 Correct 1 ms 14684 KB Output is correct
45 Correct 2 ms 14684 KB Output is correct
46 Correct 20 ms 33372 KB Output is correct
47 Correct 21 ms 33472 KB Output is correct
48 Correct 2 ms 10584 KB Output is correct
49 Correct 11 ms 23132 KB Output is correct
50 Correct 25 ms 33372 KB Output is correct
51 Correct 5 ms 16732 KB Output is correct
52 Correct 13 ms 25060 KB Output is correct
53 Correct 25 ms 33360 KB Output is correct
54 Correct 19 ms 33368 KB Output is correct
55 Correct 10 ms 23128 KB Output is correct
56 Correct 24 ms 33360 KB Output is correct
57 Correct 24 ms 33368 KB Output is correct
58 Correct 6 ms 19036 KB Output is correct
59 Correct 17 ms 27292 KB Output is correct
60 Correct 7 ms 18940 KB Output is correct

Subtask #6
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14680 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 8 ms 23128 KB Output is correct
17 Correct 8 ms 23064 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 5 ms 16984 KB Output is correct
20 Correct 8 ms 23168 KB Output is correct
21 Correct 7 ms 23132 KB Output is correct
22 Correct 3 ms 16892 KB Output is correct
23 Correct 9 ms 23132 KB Output is correct
24 Correct 7 ms 23132 KB Output is correct
25 Correct 6 ms 19036 KB Output is correct
26 Correct 6 ms 21080 KB Output is correct
27 Correct 8 ms 23132 KB Output is correct
28 Correct 5 ms 19036 KB Output is correct
29 Correct 5 ms 16728 KB Output is correct
30 Correct 4 ms 16732 KB Output is correct
31 Correct 228 ms 153940 KB Output is correct
32 Correct 226 ms 152912 KB Output is correct
33 Correct 12 ms 13404 KB Output is correct
34 Correct 134 ms 87140 KB Output is correct
35 Correct 291 ms 156756 KB Output is correct
36 Correct 177 ms 145236 KB Output is correct
37 Correct 43 ms 47700 KB Output is correct
38 Correct 263 ms 150096 KB Output is correct
39 Correct 204 ms 155728 KB Output is correct
40 Correct 169 ms 99672 KB Output is correct
41 Correct 191 ms 114512 KB Output is correct
42 Correct 252 ms 141436 KB Output is correct
43 Correct 143 ms 91548 KB Output is correct
44 Correct 108 ms 76884 KB Output is correct
45 Correct 48 ms 49744 KB Output is correct
46 Correct 2 ms 14680 KB Output is correct
47 Correct 2 ms 14832 KB Output is correct
48 Correct 1 ms 10588 KB Output is correct
49 Correct 1 ms 14684 KB Output is correct
50 Correct 1 ms 14684 KB Output is correct
51 Correct 1 ms 14684 KB Output is correct
52 Correct 2 ms 14684 KB Output is correct
53 Correct 2 ms 14812 KB Output is correct
54 Correct 2 ms 14684 KB Output is correct
55 Correct 2 ms 14684 KB Output is correct
56 Correct 2 ms 14684 KB Output is correct
57 Correct 2 ms 14684 KB Output is correct
58 Correct 1 ms 14684 KB Output is correct
59 Correct 1 ms 14684 KB Output is correct
60 Correct 2 ms 14684 KB Output is correct
61 Correct 20 ms 33372 KB Output is correct
62 Correct 21 ms 33472 KB Output is correct
63 Correct 2 ms 10584 KB Output is correct
64 Correct 11 ms 23132 KB Output is correct
65 Correct 25 ms 33372 KB Output is correct
66 Correct 5 ms 16732 KB Output is correct
67 Correct 13 ms 25060 KB Output is correct
68 Correct 25 ms 33360 KB Output is correct
69 Correct 19 ms 33368 KB Output is correct
70 Correct 10 ms 23128 KB Output is correct
71 Correct 24 ms 33360 KB Output is correct
72 Correct 24 ms 33368 KB Output is correct
73 Correct 6 ms 19036 KB Output is correct
74 Correct 17 ms 27292 KB Output is correct
75 Correct 7 ms 18940 KB Output is correct
76 Correct 921 ms 425808 KB Output is correct
77 Correct 985 ms 431284 KB Output is correct
78 Correct 26 ms 15964 KB Output is correct
79 Correct 480 ms 183472 KB Output is correct
80 Correct 1340 ms 433492 KB Output is correct
81 Correct 101 ms 76372 KB Output is correct
82 Correct 540 ms 266844 KB Output is correct
83 Correct 1312 ms 416400 KB Output is correct
84 Correct 900 ms 420364 KB Output is correct
85 Correct 274 ms 181972 KB Output is correct
86 Correct 1415 ms 413196 KB Output is correct
87 Correct 1380 ms 405852 KB Output is correct
88 Correct 185 ms 103252 KB Output is correct
89 Correct 1012 ms 303804 KB Output is correct
90 Correct 169 ms 96336 KB Output is correct