oj.uz

Submission #980515

# Submission time Handle Problem Language Result Execution time Memory
980515 2024-05-12T08:11:16 Z AlperenT_ Sličnost (COI23_slicnost) C++17
100 / 100
 1138 ms 395896 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 nw ;
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 ;
}
inline int ff(int l , int r , int x, int y){
    if((l <= x&& x <= r) || (l <= y && y <= r))return 1 ;
    return 0 ;
}
int upd(int x ,int w , int x2 , int w2 , int p , int l  ,int r){
    int id = c , mid = (l+r)/2 ; c++ ;
    if(l == r){
        int su = seg[p].s ;
        if(x==l){
            su += w;
        }
        if(x2==l){
            su += w2 ;
        }
        seg[id].mx = seg[id].s = su;
        seg[id].t = 1; 
        return id ;
    }
    seg[id].l = seg[p].l ;
    seg[id].r = seg[p].r ; 
    if(ff(l , mid , x , x2))seg[id].l = upd(x,w,x2,w2,seg[p].l , l ,mid);
    if(ff(mid+1, r , x ,x2))seg[id].r = upd(x,w,x2,w2,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) ; 
    root[r]= upd((x+1 <= n-k+1 ? x+1 : max(1 ,x-k+1)) , (x+1 <= n-k+1 ? -1 : 0) , 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) ; 
    root[r]= upd((x+1 <= n-k+1 ? x+1 : max(1 ,x-k+1)) , (x+1 <= n-k+1 ? 1 : 0) , 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"; 
}
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 209 ms 392900 KB Output is correct
2 Correct 106 ms 392784 KB Output is correct
3 Correct 98 ms 392684 KB Output is correct
4 Correct 106 ms 392736 KB Output is correct
5 Correct 101 ms 392692 KB Output is correct
6 Correct 106 ms 392636 KB Output is correct
7 Correct 99 ms 392652 KB Output is correct
8 Correct 97 ms 392828 KB Output is correct
9 Correct 97 ms 392684 KB Output is correct
10 Correct 99 ms 392856 KB Output is correct
11 Correct 97 ms 392788 KB Output is correct
12 Correct 96 ms 392780 KB Output is correct
13 Correct 96 ms 392728 KB Output is correct
14 Correct 109 ms 392856 KB Output is correct
15 Correct 95 ms 392652 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 392900 KB Output is correct
2 Correct 106 ms 392784 KB Output is correct
3 Correct 98 ms 392684 KB Output is correct
4 Correct 106 ms 392736 KB Output is correct
5 Correct 101 ms 392692 KB Output is correct
6 Correct 106 ms 392636 KB Output is correct
7 Correct 99 ms 392652 KB Output is correct
8 Correct 97 ms 392828 KB Output is correct
9 Correct 97 ms 392684 KB Output is correct
10 Correct 99 ms 392856 KB Output is correct
11 Correct 97 ms 392788 KB Output is correct
12 Correct 96 ms 392780 KB Output is correct
13 Correct 96 ms 392728 KB Output is correct
14 Correct 109 ms 392856 KB Output is correct
15 Correct 95 ms 392652 KB Output is correct
16 Correct 99 ms 392736 KB Output is correct
17 Correct 97 ms 392784 KB Output is correct
18 Correct 95 ms 392784 KB Output is correct
19 Correct 99 ms 392784 KB Output is correct
20 Correct 101 ms 392644 KB Output is correct
21 Correct 103 ms 392756 KB Output is correct
22 Correct 102 ms 392856 KB Output is correct
23 Correct 102 ms 392788 KB Output is correct
24 Correct 99 ms 392668 KB Output is correct
25 Correct 100 ms 392804 KB Output is correct
26 Correct 103 ms 392788 KB Output is correct
27 Correct 107 ms 392820 KB Output is correct
28 Correct 100 ms 392784 KB Output is correct
29 Correct 103 ms 392784 KB Output is correct
30 Correct 100 ms 392692 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 392900 KB Output is correct
2 Correct 106 ms 392784 KB Output is correct
3 Correct 98 ms 392684 KB Output is correct
4 Correct 106 ms 392736 KB Output is correct
5 Correct 101 ms 392692 KB Output is correct
6 Correct 106 ms 392636 KB Output is correct
7 Correct 99 ms 392652 KB Output is correct
8 Correct 97 ms 392828 KB Output is correct
9 Correct 97 ms 392684 KB Output is correct
10 Correct 99 ms 392856 KB Output is correct
11 Correct 97 ms 392788 KB Output is correct
12 Correct 96 ms 392780 KB Output is correct
13 Correct 96 ms 392728 KB Output is correct
14 Correct 109 ms 392856 KB Output is correct
15 Correct 95 ms 392652 KB Output is correct
16 Correct 99 ms 392736 KB Output is correct
17 Correct 97 ms 392784 KB Output is correct
18 Correct 95 ms 392784 KB Output is correct
19 Correct 99 ms 392784 KB Output is correct
20 Correct 101 ms 392644 KB Output is correct
21 Correct 103 ms 392756 KB Output is correct
22 Correct 102 ms 392856 KB Output is correct
23 Correct 102 ms 392788 KB Output is correct
24 Correct 99 ms 392668 KB Output is correct
25 Correct 100 ms 392804 KB Output is correct
26 Correct 103 ms 392788 KB Output is correct
27 Correct 107 ms 392820 KB Output is correct
28 Correct 100 ms 392784 KB Output is correct
29 Correct 103 ms 392784 KB Output is correct
30 Correct 100 ms 392692 KB Output is correct
31 Correct 193 ms 392888 KB Output is correct
32 Correct 201 ms 392788 KB Output is correct
33 Correct 111 ms 392836 KB Output is correct
34 Correct 197 ms 393292 KB Output is correct
35 Correct 272 ms 392788 KB Output is correct
36 Correct 187 ms 392788 KB Output is correct
37 Correct 134 ms 392912 KB Output is correct
38 Correct 269 ms 393036 KB Output is correct
39 Correct 199 ms 392784 KB Output is correct
40 Correct 223 ms 393292 KB Output is correct
41 Correct 282 ms 393048 KB Output is correct
42 Correct 287 ms 393036 KB Output is correct
43 Correct 223 ms 393040 KB Output is correct
44 Correct 184 ms 392832 KB Output is correct
45 Correct 133 ms 392816 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 392900 KB Output is correct
2 Correct 106 ms 392784 KB Output is correct
3 Correct 98 ms 392684 KB Output is correct
4 Correct 106 ms 392736 KB Output is correct
5 Correct 101 ms 392692 KB Output is correct
6 Correct 106 ms 392636 KB Output is correct
7 Correct 99 ms 392652 KB Output is correct
8 Correct 97 ms 392828 KB Output is correct
9 Correct 97 ms 392684 KB Output is correct
10 Correct 99 ms 392856 KB Output is correct
11 Correct 97 ms 392788 KB Output is correct
12 Correct 96 ms 392780 KB Output is correct
13 Correct 96 ms 392728 KB Output is correct
14 Correct 109 ms 392856 KB Output is correct
15 Correct 95 ms 392652 KB Output is correct
16 Correct 102 ms 392788 KB Output is correct
17 Correct 96 ms 392640 KB Output is correct
18 Correct 95 ms 392788 KB Output is correct
19 Correct 106 ms 392740 KB Output is correct
20 Correct 95 ms 392784 KB Output is correct
21 Correct 95 ms 392788 KB Output is correct
22 Correct 97 ms 392848 KB Output is correct
23 Correct 95 ms 392784 KB Output is correct
24 Correct 97 ms 392644 KB Output is correct
25 Correct 105 ms 393044 KB Output is correct
26 Correct 97 ms 392740 KB Output is correct
27 Correct 95 ms 392784 KB Output is correct
28 Correct 95 ms 392784 KB Output is correct
29 Correct 97 ms 392788 KB Output is correct
30 Correct 95 ms 392744 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 392900 KB Output is correct
2 Correct 106 ms 392784 KB Output is correct
3 Correct 98 ms 392684 KB Output is correct
4 Correct 106 ms 392736 KB Output is correct
5 Correct 101 ms 392692 KB Output is correct
6 Correct 106 ms 392636 KB Output is correct
7 Correct 99 ms 392652 KB Output is correct
8 Correct 97 ms 392828 KB Output is correct
9 Correct 97 ms 392684 KB Output is correct
10 Correct 99 ms 392856 KB Output is correct
11 Correct 97 ms 392788 KB Output is correct
12 Correct 96 ms 392780 KB Output is correct
13 Correct 96 ms 392728 KB Output is correct
14 Correct 109 ms 392856 KB Output is correct
15 Correct 95 ms 392652 KB Output is correct
16 Correct 99 ms 392736 KB Output is correct
17 Correct 97 ms 392784 KB Output is correct
18 Correct 95 ms 392784 KB Output is correct
19 Correct 99 ms 392784 KB Output is correct
20 Correct 101 ms 392644 KB Output is correct
21 Correct 103 ms 392756 KB Output is correct
22 Correct 102 ms 392856 KB Output is correct
23 Correct 102 ms 392788 KB Output is correct
24 Correct 99 ms 392668 KB Output is correct
25 Correct 100 ms 392804 KB Output is correct
26 Correct 103 ms 392788 KB Output is correct
27 Correct 107 ms 392820 KB Output is correct
28 Correct 100 ms 392784 KB Output is correct
29 Correct 103 ms 392784 KB Output is correct
30 Correct 100 ms 392692 KB Output is correct
31 Correct 102 ms 392788 KB Output is correct
32 Correct 96 ms 392640 KB Output is correct
33 Correct 95 ms 392788 KB Output is correct
34 Correct 106 ms 392740 KB Output is correct
35 Correct 95 ms 392784 KB Output is correct
36 Correct 95 ms 392788 KB Output is correct
37 Correct 97 ms 392848 KB Output is correct
38 Correct 95 ms 392784 KB Output is correct
39 Correct 97 ms 392644 KB Output is correct
40 Correct 105 ms 393044 KB Output is correct
41 Correct 97 ms 392740 KB Output is correct
42 Correct 95 ms 392784 KB Output is correct
43 Correct 95 ms 392784 KB Output is correct
44 Correct 97 ms 392788 KB Output is correct
45 Correct 95 ms 392744 KB Output is correct
46 Correct 104 ms 392824 KB Output is correct
47 Correct 104 ms 392728 KB Output is correct
48 Correct 104 ms 392788 KB Output is correct
49 Correct 103 ms 392788 KB Output is correct
50 Correct 109 ms 392784 KB Output is correct
51 Correct 102 ms 392864 KB Output is correct
52 Correct 104 ms 392868 KB Output is correct
53 Correct 113 ms 392760 KB Output is correct
54 Correct 109 ms 392696 KB Output is correct
55 Correct 104 ms 392756 KB Output is correct
56 Correct 111 ms 392788 KB Output is correct
57 Correct 111 ms 392784 KB Output is correct
58 Correct 101 ms 392784 KB Output is correct
59 Correct 110 ms 392688 KB Output is correct
60 Correct 104 ms 392816 KB Output is correct

Subtask #6
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 392900 KB Output is correct
2 Correct 106 ms 392784 KB Output is correct
3 Correct 98 ms 392684 KB Output is correct
4 Correct 106 ms 392736 KB Output is correct
5 Correct 101 ms 392692 KB Output is correct
6 Correct 106 ms 392636 KB Output is correct
7 Correct 99 ms 392652 KB Output is correct
8 Correct 97 ms 392828 KB Output is correct
9 Correct 97 ms 392684 KB Output is correct
10 Correct 99 ms 392856 KB Output is correct
11 Correct 97 ms 392788 KB Output is correct
12 Correct 96 ms 392780 KB Output is correct
13 Correct 96 ms 392728 KB Output is correct
14 Correct 109 ms 392856 KB Output is correct
15 Correct 95 ms 392652 KB Output is correct
16 Correct 99 ms 392736 KB Output is correct
17 Correct 97 ms 392784 KB Output is correct
18 Correct 95 ms 392784 KB Output is correct
19 Correct 99 ms 392784 KB Output is correct
20 Correct 101 ms 392644 KB Output is correct
21 Correct 103 ms 392756 KB Output is correct
22 Correct 102 ms 392856 KB Output is correct
23 Correct 102 ms 392788 KB Output is correct
24 Correct 99 ms 392668 KB Output is correct
25 Correct 100 ms 392804 KB Output is correct
26 Correct 103 ms 392788 KB Output is correct
27 Correct 107 ms 392820 KB Output is correct
28 Correct 100 ms 392784 KB Output is correct
29 Correct 103 ms 392784 KB Output is correct
30 Correct 100 ms 392692 KB Output is correct
31 Correct 193 ms 392888 KB Output is correct
32 Correct 201 ms 392788 KB Output is correct
33 Correct 111 ms 392836 KB Output is correct
34 Correct 197 ms 393292 KB Output is correct
35 Correct 272 ms 392788 KB Output is correct
36 Correct 187 ms 392788 KB Output is correct
37 Correct 134 ms 392912 KB Output is correct
38 Correct 269 ms 393036 KB Output is correct
39 Correct 199 ms 392784 KB Output is correct
40 Correct 223 ms 393292 KB Output is correct
41 Correct 282 ms 393048 KB Output is correct
42 Correct 287 ms 393036 KB Output is correct
43 Correct 223 ms 393040 KB Output is correct
44 Correct 184 ms 392832 KB Output is correct
45 Correct 133 ms 392816 KB Output is correct
46 Correct 102 ms 392788 KB Output is correct
47 Correct 96 ms 392640 KB Output is correct
48 Correct 95 ms 392788 KB Output is correct
49 Correct 106 ms 392740 KB Output is correct
50 Correct 95 ms 392784 KB Output is correct
51 Correct 95 ms 392788 KB Output is correct
52 Correct 97 ms 392848 KB Output is correct
53 Correct 95 ms 392784 KB Output is correct
54 Correct 97 ms 392644 KB Output is correct
55 Correct 105 ms 393044 KB Output is correct
56 Correct 97 ms 392740 KB Output is correct
57 Correct 95 ms 392784 KB Output is correct
58 Correct 95 ms 392784 KB Output is correct
59 Correct 97 ms 392788 KB Output is correct
60 Correct 95 ms 392744 KB Output is correct
61 Correct 104 ms 392824 KB Output is correct
62 Correct 104 ms 392728 KB Output is correct
63 Correct 104 ms 392788 KB Output is correct
64 Correct 103 ms 392788 KB Output is correct
65 Correct 109 ms 392784 KB Output is correct
66 Correct 102 ms 392864 KB Output is correct
67 Correct 104 ms 392868 KB Output is correct
68 Correct 113 ms 392760 KB Output is correct
69 Correct 109 ms 392696 KB Output is correct
70 Correct 104 ms 392756 KB Output is correct
71 Correct 111 ms 392788 KB Output is correct
72 Correct 111 ms 392784 KB Output is correct
73 Correct 101 ms 392784 KB Output is correct
74 Correct 110 ms 392688 KB Output is correct
75 Correct 104 ms 392816 KB Output is correct
76 Correct 619 ms 393788 KB Output is correct
77 Correct 641 ms 393300 KB Output is correct
78 Correct 128 ms 393812 KB Output is correct
79 Correct 491 ms 393808 KB Output is correct
80 Correct 1064 ms 395452 KB Output is correct
81 Correct 174 ms 395520 KB Output is correct
82 Correct 413 ms 395896 KB Output is correct
83 Correct 995 ms 395612 KB Output is correct
84 Correct 666 ms 395680 KB Output is correct
85 Correct 264 ms 395592 KB Output is correct
86 Correct 1138 ms 395280 KB Output is correct
87 Correct 1131 ms 395604 KB Output is correct
88 Correct 257 ms 395496 KB Output is correct
89 Correct 909 ms 395392 KB Output is correct
90 Correct 246 ms 395508 KB Output is correct