oj.uz

Submission #980480

# Submission time Handle Problem Language Result Execution time Memory
980480 2024-05-12T07:52:36 Z AlperenT_ Sličnost (COI23_slicnost) C++17
67 / 100
 3000 ms 524288 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define PII pair<pii , pii>
#define ld long double
#define ll long long
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= b;i++)
#define per(i , a , b) for(int i=a;i >= b;i--)
using namespace std ;
const int maxn = 1e5 +10  , N = 1e5 +1  , maxq = 202   , inf = 1e9  , maxk = 2022  , mod =1e9+7 ;
struct node{
    int mx, t, s , l , r ;
    node(){
        mx = s = l = r=  t =0 ;  
    }
};
node seg[200 * maxn] ;
void mrg(int p){
    int l = seg[p].l , r= seg[p].r ;
    seg[p].s = seg[l].s + seg[r].s ;
    seg[p].mx = max(seg[l].mx , seg[l].s + seg[r].mx) ;
    if(seg[p].mx == seg[l].mx)seg[p].t += seg[l].t ;
    if(seg[p].mx == seg[l].s + seg[r].mx)seg[p].t += seg[r].t ;
}
int c =1 ,root[maxn] , p[maxn]  , pos[maxn]  , n , k , q ;

int  bui(int l = 1, int r =n-k+1){
    int mid = (l+r)/2 ;
    if(l == r){
        seg[c].t = 1; 
        c++;
        return c-1;
    }
    int id = c ;c++;
    seg[id].l = bui(l,mid);
    seg[id].r = bui(mid+1,r);
    mrg(id) ;
    return id ;
}
int upd(int x ,int w , int p , int l  ,int r){
    int id = c , mid = (l+r)/2 ; c++ ;
    if(l == r){
        w += seg[p].s;
        seg[id].mx = seg[id].s = w ;
        seg[id].t = 1; 
        return id ;
    }
    seg[id].l = seg[p].l ;
    seg[id].r = seg[p].r ; 
    if(x <= mid)seg[id].l = upd(x,w,seg[p].l , l ,mid);
    else seg[id].r = upd(x,w,seg[p].r ,mid+1,r);
    mrg(id) ;
    return id ;
}
map <int ,ll> mp ;
void add_(int x ,int y){
    mp[x] += y; 
}
void rem_(int x, int y){
    mp[x] -= y ;
    if(mp[x] == 0){
        mp.erase(x) ;
    }
}
void add(int x , int r){
    rem_(seg[root[r]].mx , seg[root[r]].t) ; 
    if(x+1 <= n-k+1)root[r]= upd(x+1, -1 , root[r] , 1 , n-k+1);
    root[r] = upd(max(1 ,x-k+1), 1 , root[r] , 1, n-k+1);
    add_(seg[root[r]].mx , seg[root[r]].t) ; 
}
void rem(int x , int r){
    rem_(seg[root[r]].mx , seg[root[r]].t) ; 
    if(x+1 <= n-k+1)root[r]= upd(x+1, 1 , root[r] , 1 , n-k+1);
    root[r] = upd(max(1 ,x-k+1), -1 , root[r] , 1, n-k+1);
    add_(seg[root[r]].mx , seg[root[r]].t) ; 
}
void cp(){
    cout << (*mp.rbegin()).F << " " << (*mp.rbegin()).S << "\n"; 
}
void ch(int i){
    cout << seg[root[i]].mx << " "<< seg[root[i]].t << "<--\n"; 
}

signed main(){
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n >> k >> q ;
    rep(i ,1, n){
        cin >> p[i] ;
    } 
    rep(i ,1, n){
        int x; 
        cin >> x; 
        pos[x] = i;
    }
    rep(i ,1, n)p[i] = pos[p[i]] ;
    root[1] = bui();
    add_(0 , n-k+1);
    rep(i ,1 ,k){
        add(p[i] , 1) ;
    }
    rep(i ,2 , n-k+1){
        add_(seg[root[i-1]].mx , seg[root[i-1]].t) ; 
        root[i] = root[i-1] ;
        add(p[i+k-1], i) ;
        rem(p[i-1] , i) ;
    }
    cp();
    while(q--){
        int t ;
        cin>>t;
        if(t >= k){
            int f = t-k+1 ;
            add(p[t+1] , f) ;
            rem(p[t] , f); 
        }
        if(t+k <= n){
            add(p[t] , t+1);
            rem(p[t+1] , t+1);
        }
        swap(p[t] , p[t+1]); 
        cp(); 
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 392660 KB Output is correct
2 Correct 94 ms 392784 KB Output is correct
3 Correct 95 ms 392788 KB Output is correct
4 Correct 94 ms 392644 KB Output is correct
5 Correct 89 ms 392696 KB Output is correct
6 Correct 94 ms 392828 KB Output is correct
7 Correct 99 ms 392860 KB Output is correct
8 Correct 100 ms 392708 KB Output is correct
9 Correct 98 ms 392636 KB Output is correct
10 Correct 96 ms 392628 KB Output is correct
11 Correct 100 ms 392692 KB Output is correct
12 Correct 95 ms 392860 KB Output is correct
13 Correct 98 ms 392636 KB Output is correct
14 Correct 96 ms 392736 KB Output is correct
15 Correct 97 ms 392868 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 392660 KB Output is correct
2 Correct 94 ms 392784 KB Output is correct
3 Correct 95 ms 392788 KB Output is correct
4 Correct 94 ms 392644 KB Output is correct
5 Correct 89 ms 392696 KB Output is correct
6 Correct 94 ms 392828 KB Output is correct
7 Correct 99 ms 392860 KB Output is correct
8 Correct 100 ms 392708 KB Output is correct
9 Correct 98 ms 392636 KB Output is correct
10 Correct 96 ms 392628 KB Output is correct
11 Correct 100 ms 392692 KB Output is correct
12 Correct 95 ms 392860 KB Output is correct
13 Correct 98 ms 392636 KB Output is correct
14 Correct 96 ms 392736 KB Output is correct
15 Correct 97 ms 392868 KB Output is correct
16 Correct 103 ms 392908 KB Output is correct
17 Correct 100 ms 392788 KB Output is correct
18 Correct 99 ms 392860 KB Output is correct
19 Correct 97 ms 392804 KB Output is correct
20 Correct 108 ms 392672 KB Output is correct
21 Correct 102 ms 393068 KB Output is correct
22 Correct 105 ms 392864 KB Output is correct
23 Correct 105 ms 392696 KB Output is correct
24 Correct 93 ms 392884 KB Output is correct
25 Correct 94 ms 392836 KB Output is correct
26 Correct 105 ms 392828 KB Output is correct
27 Correct 111 ms 392784 KB Output is correct
28 Correct 102 ms 392680 KB Output is correct
29 Correct 109 ms 392824 KB Output is correct
30 Correct 101 ms 392756 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 392660 KB Output is correct
2 Correct 94 ms 392784 KB Output is correct
3 Correct 95 ms 392788 KB Output is correct
4 Correct 94 ms 392644 KB Output is correct
5 Correct 89 ms 392696 KB Output is correct
6 Correct 94 ms 392828 KB Output is correct
7 Correct 99 ms 392860 KB Output is correct
8 Correct 100 ms 392708 KB Output is correct
9 Correct 98 ms 392636 KB Output is correct
10 Correct 96 ms 392628 KB Output is correct
11 Correct 100 ms 392692 KB Output is correct
12 Correct 95 ms 392860 KB Output is correct
13 Correct 98 ms 392636 KB Output is correct
14 Correct 96 ms 392736 KB Output is correct
15 Correct 97 ms 392868 KB Output is correct
16 Correct 103 ms 392908 KB Output is correct
17 Correct 100 ms 392788 KB Output is correct
18 Correct 99 ms 392860 KB Output is correct
19 Correct 97 ms 392804 KB Output is correct
20 Correct 108 ms 392672 KB Output is correct
21 Correct 102 ms 393068 KB Output is correct
22 Correct 105 ms 392864 KB Output is correct
23 Correct 105 ms 392696 KB Output is correct
24 Correct 93 ms 392884 KB Output is correct
25 Correct 94 ms 392836 KB Output is correct
26 Correct 105 ms 392828 KB Output is correct
27 Correct 111 ms 392784 KB Output is correct
28 Correct 102 ms 392680 KB Output is correct
29 Correct 109 ms 392824 KB Output is correct
30 Correct 101 ms 392756 KB Output is correct
31 Correct 244 ms 392800 KB Output is correct
32 Correct 242 ms 392956 KB Output is correct
33 Correct 113 ms 392976 KB Output is correct
34 Correct 184 ms 392832 KB Output is correct
35 Correct 293 ms 393036 KB Output is correct
36 Correct 210 ms 392796 KB Output is correct
37 Correct 120 ms 393036 KB Output is correct
38 Correct 295 ms 393036 KB Output is correct
39 Correct 196 ms 393036 KB Output is correct
40 Correct 227 ms 393044 KB Output is correct
41 Correct 238 ms 393040 KB Output is correct
42 Correct 288 ms 392892 KB Output is correct
43 Correct 218 ms 392856 KB Output is correct
44 Correct 171 ms 393044 KB Output is correct
45 Correct 127 ms 392868 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 392660 KB Output is correct
2 Correct 94 ms 392784 KB Output is correct
3 Correct 95 ms 392788 KB Output is correct
4 Correct 94 ms 392644 KB Output is correct
5 Correct 89 ms 392696 KB Output is correct
6 Correct 94 ms 392828 KB Output is correct
7 Correct 99 ms 392860 KB Output is correct
8 Correct 100 ms 392708 KB Output is correct
9 Correct 98 ms 392636 KB Output is correct
10 Correct 96 ms 392628 KB Output is correct
11 Correct 100 ms 392692 KB Output is correct
12 Correct 95 ms 392860 KB Output is correct
13 Correct 98 ms 392636 KB Output is correct
14 Correct 96 ms 392736 KB Output is correct
15 Correct 97 ms 392868 KB Output is correct
16 Correct 95 ms 392724 KB Output is correct
17 Correct 98 ms 392772 KB Output is correct
18 Correct 99 ms 392676 KB Output is correct
19 Correct 103 ms 392636 KB Output is correct
20 Correct 103 ms 392720 KB Output is correct
21 Correct 104 ms 392820 KB Output is correct
22 Correct 103 ms 392700 KB Output is correct
23 Correct 99 ms 392852 KB Output is correct
24 Correct 101 ms 392744 KB Output is correct
25 Correct 101 ms 392652 KB Output is correct
26 Correct 109 ms 392772 KB Output is correct
27 Correct 100 ms 392844 KB Output is correct
28 Correct 113 ms 392772 KB Output is correct
29 Correct 113 ms 392644 KB Output is correct
30 Correct 110 ms 392640 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 392660 KB Output is correct
2 Correct 94 ms 392784 KB Output is correct
3 Correct 95 ms 392788 KB Output is correct
4 Correct 94 ms 392644 KB Output is correct
5 Correct 89 ms 392696 KB Output is correct
6 Correct 94 ms 392828 KB Output is correct
7 Correct 99 ms 392860 KB Output is correct
8 Correct 100 ms 392708 KB Output is correct
9 Correct 98 ms 392636 KB Output is correct
10 Correct 96 ms 392628 KB Output is correct
11 Correct 100 ms 392692 KB Output is correct
12 Correct 95 ms 392860 KB Output is correct
13 Correct 98 ms 392636 KB Output is correct
14 Correct 96 ms 392736 KB Output is correct
15 Correct 97 ms 392868 KB Output is correct
16 Correct 103 ms 392908 KB Output is correct
17 Correct 100 ms 392788 KB Output is correct
18 Correct 99 ms 392860 KB Output is correct
19 Correct 97 ms 392804 KB Output is correct
20 Correct 108 ms 392672 KB Output is correct
21 Correct 102 ms 393068 KB Output is correct
22 Correct 105 ms 392864 KB Output is correct
23 Correct 105 ms 392696 KB Output is correct
24 Correct 93 ms 392884 KB Output is correct
25 Correct 94 ms 392836 KB Output is correct
26 Correct 105 ms 392828 KB Output is correct
27 Correct 111 ms 392784 KB Output is correct
28 Correct 102 ms 392680 KB Output is correct
29 Correct 109 ms 392824 KB Output is correct
30 Correct 101 ms 392756 KB Output is correct
31 Correct 95 ms 392724 KB Output is correct
32 Correct 98 ms 392772 KB Output is correct
33 Correct 99 ms 392676 KB Output is correct
34 Correct 103 ms 392636 KB Output is correct
35 Correct 103 ms 392720 KB Output is correct
36 Correct 104 ms 392820 KB Output is correct
37 Correct 103 ms 392700 KB Output is correct
38 Correct 99 ms 392852 KB Output is correct
39 Correct 101 ms 392744 KB Output is correct
40 Correct 101 ms 392652 KB Output is correct
41 Correct 109 ms 392772 KB Output is correct
42 Correct 100 ms 392844 KB Output is correct
43 Correct 113 ms 392772 KB Output is correct
44 Correct 113 ms 392644 KB Output is correct
45 Correct 110 ms 392640 KB Output is correct
46 Correct 115 ms 392772 KB Output is correct
47 Correct 123 ms 393164 KB Output is correct
48 Correct 105 ms 392788 KB Output is correct
49 Correct 106 ms 392824 KB Output is correct
50 Correct 112 ms 392684 KB Output is correct
51 Correct 102 ms 392852 KB Output is correct
52 Correct 119 ms 392708 KB Output is correct
53 Correct 115 ms 392740 KB Output is correct
54 Correct 113 ms 392780 KB Output is correct
55 Correct 108 ms 392888 KB Output is correct
56 Correct 115 ms 392840 KB Output is correct
57 Correct 117 ms 392772 KB Output is correct
58 Correct 108 ms 392764 KB Output is correct
59 Correct 113 ms 392872 KB Output is correct
60 Correct 103 ms 392720 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 392660 KB Output is correct
2 Correct 94 ms 392784 KB Output is correct
3 Correct 95 ms 392788 KB Output is correct
4 Correct 94 ms 392644 KB Output is correct
5 Correct 89 ms 392696 KB Output is correct
6 Correct 94 ms 392828 KB Output is correct
7 Correct 99 ms 392860 KB Output is correct
8 Correct 100 ms 392708 KB Output is correct
9 Correct 98 ms 392636 KB Output is correct
10 Correct 96 ms 392628 KB Output is correct
11 Correct 100 ms 392692 KB Output is correct
12 Correct 95 ms 392860 KB Output is correct
13 Correct 98 ms 392636 KB Output is correct
14 Correct 96 ms 392736 KB Output is correct
15 Correct 97 ms 392868 KB Output is correct
16 Correct 103 ms 392908 KB Output is correct
17 Correct 100 ms 392788 KB Output is correct
18 Correct 99 ms 392860 KB Output is correct
19 Correct 97 ms 392804 KB Output is correct
20 Correct 108 ms 392672 KB Output is correct
21 Correct 102 ms 393068 KB Output is correct
22 Correct 105 ms 392864 KB Output is correct
23 Correct 105 ms 392696 KB Output is correct
24 Correct 93 ms 392884 KB Output is correct
25 Correct 94 ms 392836 KB Output is correct
26 Correct 105 ms 392828 KB Output is correct
27 Correct 111 ms 392784 KB Output is correct
28 Correct 102 ms 392680 KB Output is correct
29 Correct 109 ms 392824 KB Output is correct
30 Correct 101 ms 392756 KB Output is correct
31 Correct 244 ms 392800 KB Output is correct
32 Correct 242 ms 392956 KB Output is correct
33 Correct 113 ms 392976 KB Output is correct
34 Correct 184 ms 392832 KB Output is correct
35 Correct 293 ms 393036 KB Output is correct
36 Correct 210 ms 392796 KB Output is correct
37 Correct 120 ms 393036 KB Output is correct
38 Correct 295 ms 393036 KB Output is correct
39 Correct 196 ms 393036 KB Output is correct
40 Correct 227 ms 393044 KB Output is correct
41 Correct 238 ms 393040 KB Output is correct
42 Correct 288 ms 392892 KB Output is correct
43 Correct 218 ms 392856 KB Output is correct
44 Correct 171 ms 393044 KB Output is correct
45 Correct 127 ms 392868 KB Output is correct
46 Correct 95 ms 392724 KB Output is correct
47 Correct 98 ms 392772 KB Output is correct
48 Correct 99 ms 392676 KB Output is correct
49 Correct 103 ms 392636 KB Output is correct
50 Correct 103 ms 392720 KB Output is correct
51 Correct 104 ms 392820 KB Output is correct
52 Correct 103 ms 392700 KB Output is correct
53 Correct 99 ms 392852 KB Output is correct
54 Correct 101 ms 392744 KB Output is correct
55 Correct 101 ms 392652 KB Output is correct
56 Correct 109 ms 392772 KB Output is correct
57 Correct 100 ms 392844 KB Output is correct
58 Correct 113 ms 392772 KB Output is correct
59 Correct 113 ms 392644 KB Output is correct
60 Correct 110 ms 392640 KB Output is correct
61 Correct 115 ms 392772 KB Output is correct
62 Correct 123 ms 393164 KB Output is correct
63 Correct 105 ms 392788 KB Output is correct
64 Correct 106 ms 392824 KB Output is correct
65 Correct 112 ms 392684 KB Output is correct
66 Correct 102 ms 392852 KB Output is correct
67 Correct 119 ms 392708 KB Output is correct
68 Correct 115 ms 392740 KB Output is correct
69 Correct 113 ms 392780 KB Output is correct
70 Correct 108 ms 392888 KB Output is correct
71 Correct 115 ms 392840 KB Output is correct
72 Correct 117 ms 392772 KB Output is correct
73 Correct 108 ms 392764 KB Output is correct
74 Correct 113 ms 392872 KB Output is correct
75 Correct 103 ms 392720 KB Output is correct
76 Execution timed out 3070 ms 524288 KB Time limit exceeded
77 Halted 0 ms 0 KB -