oj.uz

Submission #1017811

# Submission time Handle Problem Language Result Execution time Memory
1017811 2024-07-09T10:22:42 Z stefanopulos Sličnost (COI23_slicnost) C++17
57 / 100
 3000 ms 145488 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[100 * mxN], rs[100 * mxN], root[100 * mxN];
int mx[100 * mxN], sum[100 * mxN], cnt[100 * 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);

}

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);
    }
    
    int najv = mx[root[k]]; ll br = 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);

        if(mx[root[i]] > najv){
            najv = mx[root[i]];
            br = cnt[root[i]];
        }
        else if(mx[root[i]] == najv)br += cnt[root[i]];
    }
 
    cout << najv << " " << br << '\n';
 
}
 
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();
 
    while(q--){
        int t;
        cin >> t;
 
        swap(A[t], A[t + 1]);
        calc();
 
    }
 
    return 0;
}
/*
 
4 3 0
2 4 1 3
1 2 3 4
 
// probati bojenje sahovski
*/

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 5724 KB Output is correct
17 Correct 8 ms 5724 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 5 ms 3412 KB Output is correct
20 Correct 10 ms 5724 KB Output is correct
21 Correct 7 ms 5468 KB Output is correct
22 Correct 2 ms 1628 KB Output is correct
23 Correct 9 ms 5724 KB Output is correct
24 Correct 8 ms 5724 KB Output is correct
25 Correct 6 ms 3676 KB Output is correct
26 Correct 6 ms 4188 KB Output is correct
27 Correct 8 ms 5212 KB Output is correct
28 Correct 5 ms 3420 KB Output is correct
29 Correct 4 ms 2908 KB Output is correct
30 Correct 2 ms 1628 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 5724 KB Output is correct
17 Correct 8 ms 5724 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 5 ms 3412 KB Output is correct
20 Correct 10 ms 5724 KB Output is correct
21 Correct 7 ms 5468 KB Output is correct
22 Correct 2 ms 1628 KB Output is correct
23 Correct 9 ms 5724 KB Output is correct
24 Correct 8 ms 5724 KB Output is correct
25 Correct 6 ms 3676 KB Output is correct
26 Correct 6 ms 4188 KB Output is correct
27 Correct 8 ms 5212 KB Output is correct
28 Correct 5 ms 3420 KB Output is correct
29 Correct 4 ms 2908 KB Output is correct
30 Correct 2 ms 1628 KB Output is correct
31 Correct 246 ms 141792 KB Output is correct
32 Correct 247 ms 141652 KB Output is correct
33 Correct 13 ms 5208 KB Output is correct
34 Correct 151 ms 77652 KB Output is correct
35 Correct 293 ms 145488 KB Output is correct
36 Correct 179 ms 134016 KB Output is correct
37 Correct 50 ms 33624 KB Output is correct
38 Correct 290 ms 138944 KB Output is correct
39 Correct 210 ms 144460 KB Output is correct
40 Correct 174 ms 90196 KB Output is correct
41 Correct 209 ms 102968 KB Output is correct
42 Correct 267 ms 130132 KB Output is correct
43 Correct 147 ms 81748 KB Output is correct
44 Correct 125 ms 67344 KB Output is correct
45 Correct 57 ms 34720 KB Output is correct

Subtask #4
7.0 / 7.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 5724 KB Output is correct
17 Correct 8 ms 5724 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 5 ms 3412 KB Output is correct
20 Correct 10 ms 5724 KB Output is correct
21 Correct 7 ms 5468 KB Output is correct
22 Correct 2 ms 1628 KB Output is correct
23 Correct 9 ms 5724 KB Output is correct
24 Correct 8 ms 5724 KB Output is correct
25 Correct 6 ms 3676 KB Output is correct
26 Correct 6 ms 4188 KB Output is correct
27 Correct 8 ms 5212 KB Output is correct
28 Correct 5 ms 3420 KB Output is correct
29 Correct 4 ms 2908 KB Output is correct
30 Correct 2 ms 1628 KB Output is correct
31 Correct 6 ms 348 KB Output is correct
32 Correct 6 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 6 ms 584 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 4 ms 348 KB Output is correct
38 Correct 5 ms 348 KB Output is correct
39 Correct 5 ms 348 KB Output is correct
40 Correct 3 ms 348 KB Output is correct
41 Correct 6 ms 348 KB Output is correct
42 Correct 6 ms 348 KB Output is correct
43 Correct 2 ms 348 KB Output is correct
44 Correct 5 ms 348 KB Output is correct
45 Correct 2 ms 348 KB Output is correct
46 Execution timed out 3086 ms 5904 KB Time limit exceeded
47 Halted 0 ms 0 KB -

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 5724 KB Output is correct
17 Correct 8 ms 5724 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 5 ms 3412 KB Output is correct
20 Correct 10 ms 5724 KB Output is correct
21 Correct 7 ms 5468 KB Output is correct
22 Correct 2 ms 1628 KB Output is correct
23 Correct 9 ms 5724 KB Output is correct
24 Correct 8 ms 5724 KB Output is correct
25 Correct 6 ms 3676 KB Output is correct
26 Correct 6 ms 4188 KB Output is correct
27 Correct 8 ms 5212 KB Output is correct
28 Correct 5 ms 3420 KB Output is correct
29 Correct 4 ms 2908 KB Output is correct
30 Correct 2 ms 1628 KB Output is correct
31 Correct 246 ms 141792 KB Output is correct
32 Correct 247 ms 141652 KB Output is correct
33 Correct 13 ms 5208 KB Output is correct
34 Correct 151 ms 77652 KB Output is correct
35 Correct 293 ms 145488 KB Output is correct
36 Correct 179 ms 134016 KB Output is correct
37 Correct 50 ms 33624 KB Output is correct
38 Correct 290 ms 138944 KB Output is correct
39 Correct 210 ms 144460 KB Output is correct
40 Correct 174 ms 90196 KB Output is correct
41 Correct 209 ms 102968 KB Output is correct
42 Correct 267 ms 130132 KB Output is correct
43 Correct 147 ms 81748 KB Output is correct
44 Correct 125 ms 67344 KB Output is correct
45 Correct 57 ms 34720 KB Output is correct
46 Correct 6 ms 348 KB Output is correct
47 Correct 6 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 3 ms 348 KB Output is correct
50 Correct 6 ms 584 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 4 ms 348 KB Output is correct
53 Correct 5 ms 348 KB Output is correct
54 Correct 5 ms 348 KB Output is correct
55 Correct 3 ms 348 KB Output is correct
56 Correct 6 ms 348 KB Output is correct
57 Correct 6 ms 348 KB Output is correct
58 Correct 2 ms 348 KB Output is correct
59 Correct 5 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Execution timed out 3086 ms 5904 KB Time limit exceeded
62 Halted 0 ms 0 KB -