oj.uz

Submission #978779

# Submission time Handle Problem Language Result Execution time Memory
978779 2024-05-09T16:52:14 Z stefanopulos Sličnost (COI23_slicnost) C++17
24 / 100
 3000 ms 8464 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 bor[4 * mxN][2];
int lenj[4 * mxN];
void build(int v, int tl, int tr){
    lenj[v] = 0;
    if(tl == tr){
        bor[v][0] = 0;
        bor[v][1] = 1;
        return;
    }
    int mid = (tl + tr) / 2;
    build(v * 2, tl, mid); build(v * 2 + 1, mid + 1, tr);
    bor[v][0] = max(bor[v * 2][0], bor[v * 2 + 1][0]);
    bor[v][1] = (bor[v * 2][0] == bor[v][0] ? bor[v * 2][1] : 0) +
                (bor[v * 2 + 1][0] == bor[v][0] ? bor[v * 2 + 1][1] : 0);
}

void propagate(int v, int tl, int tr){
    if(lenj[v] != 0){
        bor[v][0] += lenj[v];
        if(tl != tr){
            lenj[v * 2] += lenj[v];
            lenj[v * 2 + 1] += lenj[v];
        }
        lenj[v] = 0;
    }
}

void lazyupd(int v, int tl, int tr, int l, int r, int val){
    propagate(v, tl, tr);
    if(tl > tr || tl > r || l > tr)return;
    if(tl >= l && tr <= r){
        lenj[v] += val;
        propagate(v, tl, tr);
        return;
    }
    int mid = (tl + tr) / 2;
    lazyupd(v * 2, tl, mid, l, r, val); lazyupd(v * 2 + 1, mid + 1, tr, l, r, val);
    bor[v][0] = max(bor[v * 2][0], bor[v * 2 + 1][0]);
    bor[v][1] = (bor[v * 2][0] == bor[v][0] ? bor[v * 2][1] : 0) +
                (bor[v * 2 + 1][0] == bor[v][0] ? bor[v * 2 + 1][1] : 0);
}

void calc(){

    build(1,1,n - k + 1);
    ff(i,1,k){
        int l = L[poz[A[i]]];
        int r = R[poz[A[i]]];
        lazyupd(1,1,n - k + 1,l,r,1);
    }
    
    int mx = bor[1][0], br = bor[1][1];
    ff(i,k + 1,n){
        int l1 = L[poz[A[i - k]]];
        int r1 = R[poz[A[i - k]]];
        lazyupd(1,1,n - k + 1,l1,r1,-1);

        int l2 = L[poz[A[i]]];
        int r2 = R[poz[A[i]]];
        lazyupd(1,1,n - k + 1,l2,r2,1);

        if(bor[1][0] > mx){
            mx = bor[1][0];
            br = bor[1][1];
        }
        else if(bor[1][0] == mx)br += bor[1][1];

    }

    cout << mx << " " << 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 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4576 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4576 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 3 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 5 ms 4688 KB Output is correct
21 Correct 4 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 5 ms 4440 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 4 ms 4444 KB Output is correct
26 Correct 5 ms 4652 KB Output is correct
27 Correct 6 ms 4444 KB Output is correct
28 Correct 3 ms 4652 KB Output is correct
29 Correct 3 ms 4444 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4576 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 3 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 5 ms 4688 KB Output is correct
21 Correct 4 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 5 ms 4440 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 4 ms 4444 KB Output is correct
26 Correct 5 ms 4652 KB Output is correct
27 Correct 6 ms 4444 KB Output is correct
28 Correct 3 ms 4652 KB Output is correct
29 Correct 3 ms 4444 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 67 ms 8028 KB Output is correct
32 Correct 65 ms 8464 KB Output is correct
33 Correct 13 ms 5980 KB Output is correct
34 Correct 64 ms 8216 KB Output is correct
35 Correct 122 ms 8028 KB Output is correct
36 Correct 81 ms 8276 KB Output is correct
37 Correct 15 ms 5980 KB Output is correct
38 Correct 132 ms 8188 KB Output is correct
39 Incorrect 83 ms 8024 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #4
7.0 / 7.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4576 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 3 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 5 ms 4688 KB Output is correct
21 Correct 4 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 5 ms 4440 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 4 ms 4444 KB Output is correct
26 Correct 5 ms 4652 KB Output is correct
27 Correct 6 ms 4444 KB Output is correct
28 Correct 3 ms 4652 KB Output is correct
29 Correct 3 ms 4444 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 3 ms 4440 KB Output is correct
32 Correct 3 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 4 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 2 ms 4444 KB Output is correct
38 Correct 4 ms 4444 KB Output is correct
39 Correct 3 ms 4444 KB Output is correct
40 Correct 2 ms 4444 KB Output is correct
41 Correct 3 ms 4444 KB Output is correct
42 Correct 3 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 3 ms 4444 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Execution timed out 3032 ms 4700 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 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4576 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 3 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 4 ms 4444 KB Output is correct
20 Correct 5 ms 4688 KB Output is correct
21 Correct 4 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 5 ms 4440 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 4 ms 4444 KB Output is correct
26 Correct 5 ms 4652 KB Output is correct
27 Correct 6 ms 4444 KB Output is correct
28 Correct 3 ms 4652 KB Output is correct
29 Correct 3 ms 4444 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 67 ms 8028 KB Output is correct
32 Correct 65 ms 8464 KB Output is correct
33 Correct 13 ms 5980 KB Output is correct
34 Correct 64 ms 8216 KB Output is correct
35 Correct 122 ms 8028 KB Output is correct
36 Correct 81 ms 8276 KB Output is correct
37 Correct 15 ms 5980 KB Output is correct
38 Correct 132 ms 8188 KB Output is correct
39 Incorrect 83 ms 8024 KB Output isn't correct
40 Halted 0 ms 0 KB -