oj.uz

Submission #980476

# Submission time Handle Problem Language Result Execution time Memory
980476 2024-05-12T07:51:23 Z AlperenT_ Sličnost (COI23_slicnost) C++17
67 / 100
 1456 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[160 * 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 83 ms 314540 KB Output is correct
2 Correct 57 ms 314452 KB Output is correct
3 Correct 56 ms 314568 KB Output is correct
4 Correct 57 ms 314448 KB Output is correct
5 Correct 58 ms 314528 KB Output is correct
6 Correct 57 ms 314584 KB Output is correct
7 Correct 58 ms 314452 KB Output is correct
8 Correct 57 ms 314452 KB Output is correct
9 Correct 57 ms 314564 KB Output is correct
10 Correct 59 ms 314448 KB Output is correct
11 Correct 60 ms 314464 KB Output is correct
12 Correct 58 ms 314568 KB Output is correct
13 Correct 60 ms 314584 KB Output is correct
14 Correct 66 ms 314448 KB Output is correct
15 Correct 59 ms 314340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 314540 KB Output is correct
2 Correct 57 ms 314452 KB Output is correct
3 Correct 56 ms 314568 KB Output is correct
4 Correct 57 ms 314448 KB Output is correct
5 Correct 58 ms 314528 KB Output is correct
6 Correct 57 ms 314584 KB Output is correct
7 Correct 58 ms 314452 KB Output is correct
8 Correct 57 ms 314452 KB Output is correct
9 Correct 57 ms 314564 KB Output is correct
10 Correct 59 ms 314448 KB Output is correct
11 Correct 60 ms 314464 KB Output is correct
12 Correct 58 ms 314568 KB Output is correct
13 Correct 60 ms 314584 KB Output is correct
14 Correct 66 ms 314448 KB Output is correct
15 Correct 59 ms 314340 KB Output is correct
16 Correct 61 ms 314448 KB Output is correct
17 Correct 65 ms 314592 KB Output is correct
18 Correct 63 ms 314452 KB Output is correct
19 Correct 61 ms 314560 KB Output is correct
20 Correct 64 ms 314452 KB Output is correct
21 Correct 61 ms 314492 KB Output is correct
22 Correct 66 ms 314544 KB Output is correct
23 Correct 63 ms 314604 KB Output is correct
24 Correct 65 ms 314404 KB Output is correct
25 Correct 62 ms 314416 KB Output is correct
26 Correct 66 ms 314476 KB Output is correct
27 Correct 64 ms 314732 KB Output is correct
28 Correct 64 ms 314452 KB Output is correct
29 Correct 61 ms 314448 KB Output is correct
30 Correct 62 ms 314464 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 314540 KB Output is correct
2 Correct 57 ms 314452 KB Output is correct
3 Correct 56 ms 314568 KB Output is correct
4 Correct 57 ms 314448 KB Output is correct
5 Correct 58 ms 314528 KB Output is correct
6 Correct 57 ms 314584 KB Output is correct
7 Correct 58 ms 314452 KB Output is correct
8 Correct 57 ms 314452 KB Output is correct
9 Correct 57 ms 314564 KB Output is correct
10 Correct 59 ms 314448 KB Output is correct
11 Correct 60 ms 314464 KB Output is correct
12 Correct 58 ms 314568 KB Output is correct
13 Correct 60 ms 314584 KB Output is correct
14 Correct 66 ms 314448 KB Output is correct
15 Correct 59 ms 314340 KB Output is correct
16 Correct 61 ms 314448 KB Output is correct
17 Correct 65 ms 314592 KB Output is correct
18 Correct 63 ms 314452 KB Output is correct
19 Correct 61 ms 314560 KB Output is correct
20 Correct 64 ms 314452 KB Output is correct
21 Correct 61 ms 314492 KB Output is correct
22 Correct 66 ms 314544 KB Output is correct
23 Correct 63 ms 314604 KB Output is correct
24 Correct 65 ms 314404 KB Output is correct
25 Correct 62 ms 314416 KB Output is correct
26 Correct 66 ms 314476 KB Output is correct
27 Correct 64 ms 314732 KB Output is correct
28 Correct 64 ms 314452 KB Output is correct
29 Correct 61 ms 314448 KB Output is correct
30 Correct 62 ms 314464 KB Output is correct
31 Correct 197 ms 314752 KB Output is correct
32 Correct 199 ms 314712 KB Output is correct
33 Correct 74 ms 314708 KB Output is correct
34 Correct 152 ms 314764 KB Output is correct
35 Correct 252 ms 314748 KB Output is correct
36 Correct 144 ms 314580 KB Output is correct
37 Correct 96 ms 314608 KB Output is correct
38 Correct 243 ms 314708 KB Output is correct
39 Correct 165 ms 314752 KB Output is correct
40 Correct 175 ms 314764 KB Output is correct
41 Correct 259 ms 314960 KB Output is correct
42 Correct 231 ms 314628 KB Output is correct
43 Correct 179 ms 314752 KB Output is correct
44 Correct 124 ms 314736 KB Output is correct
45 Correct 90 ms 314756 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 314540 KB Output is correct
2 Correct 57 ms 314452 KB Output is correct
3 Correct 56 ms 314568 KB Output is correct
4 Correct 57 ms 314448 KB Output is correct
5 Correct 58 ms 314528 KB Output is correct
6 Correct 57 ms 314584 KB Output is correct
7 Correct 58 ms 314452 KB Output is correct
8 Correct 57 ms 314452 KB Output is correct
9 Correct 57 ms 314564 KB Output is correct
10 Correct 59 ms 314448 KB Output is correct
11 Correct 60 ms 314464 KB Output is correct
12 Correct 58 ms 314568 KB Output is correct
13 Correct 60 ms 314584 KB Output is correct
14 Correct 66 ms 314448 KB Output is correct
15 Correct 59 ms 314340 KB Output is correct
16 Correct 60 ms 314452 KB Output is correct
17 Correct 61 ms 314508 KB Output is correct
18 Correct 58 ms 314448 KB Output is correct
19 Correct 62 ms 314440 KB Output is correct
20 Correct 58 ms 314356 KB Output is correct
21 Correct 64 ms 314500 KB Output is correct
22 Correct 57 ms 314560 KB Output is correct
23 Correct 58 ms 314552 KB Output is correct
24 Correct 59 ms 314340 KB Output is correct
25 Correct 61 ms 314556 KB Output is correct
26 Correct 58 ms 314448 KB Output is correct
27 Correct 58 ms 314452 KB Output is correct
28 Correct 62 ms 314452 KB Output is correct
29 Correct 66 ms 314452 KB Output is correct
30 Correct 58 ms 314564 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 314540 KB Output is correct
2 Correct 57 ms 314452 KB Output is correct
3 Correct 56 ms 314568 KB Output is correct
4 Correct 57 ms 314448 KB Output is correct
5 Correct 58 ms 314528 KB Output is correct
6 Correct 57 ms 314584 KB Output is correct
7 Correct 58 ms 314452 KB Output is correct
8 Correct 57 ms 314452 KB Output is correct
9 Correct 57 ms 314564 KB Output is correct
10 Correct 59 ms 314448 KB Output is correct
11 Correct 60 ms 314464 KB Output is correct
12 Correct 58 ms 314568 KB Output is correct
13 Correct 60 ms 314584 KB Output is correct
14 Correct 66 ms 314448 KB Output is correct
15 Correct 59 ms 314340 KB Output is correct
16 Correct 61 ms 314448 KB Output is correct
17 Correct 65 ms 314592 KB Output is correct
18 Correct 63 ms 314452 KB Output is correct
19 Correct 61 ms 314560 KB Output is correct
20 Correct 64 ms 314452 KB Output is correct
21 Correct 61 ms 314492 KB Output is correct
22 Correct 66 ms 314544 KB Output is correct
23 Correct 63 ms 314604 KB Output is correct
24 Correct 65 ms 314404 KB Output is correct
25 Correct 62 ms 314416 KB Output is correct
26 Correct 66 ms 314476 KB Output is correct
27 Correct 64 ms 314732 KB Output is correct
28 Correct 64 ms 314452 KB Output is correct
29 Correct 61 ms 314448 KB Output is correct
30 Correct 62 ms 314464 KB Output is correct
31 Correct 60 ms 314452 KB Output is correct
32 Correct 61 ms 314508 KB Output is correct
33 Correct 58 ms 314448 KB Output is correct
34 Correct 62 ms 314440 KB Output is correct
35 Correct 58 ms 314356 KB Output is correct
36 Correct 64 ms 314500 KB Output is correct
37 Correct 57 ms 314560 KB Output is correct
38 Correct 58 ms 314552 KB Output is correct
39 Correct 59 ms 314340 KB Output is correct
40 Correct 61 ms 314556 KB Output is correct
41 Correct 58 ms 314448 KB Output is correct
42 Correct 58 ms 314452 KB Output is correct
43 Correct 62 ms 314452 KB Output is correct
44 Correct 66 ms 314452 KB Output is correct
45 Correct 58 ms 314564 KB Output is correct
46 Correct 75 ms 314556 KB Output is correct
47 Correct 71 ms 314448 KB Output is correct
48 Correct 61 ms 314448 KB Output is correct
49 Correct 72 ms 314448 KB Output is correct
50 Correct 76 ms 314452 KB Output is correct
51 Correct 60 ms 314452 KB Output is correct
52 Correct 72 ms 314452 KB Output is correct
53 Correct 79 ms 314452 KB Output is correct
54 Correct 70 ms 314876 KB Output is correct
55 Correct 63 ms 314452 KB Output is correct
56 Correct 80 ms 314532 KB Output is correct
57 Correct 72 ms 314448 KB Output is correct
58 Correct 62 ms 314448 KB Output is correct
59 Correct 74 ms 314564 KB Output is correct
60 Correct 60 ms 314452 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 314540 KB Output is correct
2 Correct 57 ms 314452 KB Output is correct
3 Correct 56 ms 314568 KB Output is correct
4 Correct 57 ms 314448 KB Output is correct
5 Correct 58 ms 314528 KB Output is correct
6 Correct 57 ms 314584 KB Output is correct
7 Correct 58 ms 314452 KB Output is correct
8 Correct 57 ms 314452 KB Output is correct
9 Correct 57 ms 314564 KB Output is correct
10 Correct 59 ms 314448 KB Output is correct
11 Correct 60 ms 314464 KB Output is correct
12 Correct 58 ms 314568 KB Output is correct
13 Correct 60 ms 314584 KB Output is correct
14 Correct 66 ms 314448 KB Output is correct
15 Correct 59 ms 314340 KB Output is correct
16 Correct 61 ms 314448 KB Output is correct
17 Correct 65 ms 314592 KB Output is correct
18 Correct 63 ms 314452 KB Output is correct
19 Correct 61 ms 314560 KB Output is correct
20 Correct 64 ms 314452 KB Output is correct
21 Correct 61 ms 314492 KB Output is correct
22 Correct 66 ms 314544 KB Output is correct
23 Correct 63 ms 314604 KB Output is correct
24 Correct 65 ms 314404 KB Output is correct
25 Correct 62 ms 314416 KB Output is correct
26 Correct 66 ms 314476 KB Output is correct
27 Correct 64 ms 314732 KB Output is correct
28 Correct 64 ms 314452 KB Output is correct
29 Correct 61 ms 314448 KB Output is correct
30 Correct 62 ms 314464 KB Output is correct
31 Correct 197 ms 314752 KB Output is correct
32 Correct 199 ms 314712 KB Output is correct
33 Correct 74 ms 314708 KB Output is correct
34 Correct 152 ms 314764 KB Output is correct
35 Correct 252 ms 314748 KB Output is correct
36 Correct 144 ms 314580 KB Output is correct
37 Correct 96 ms 314608 KB Output is correct
38 Correct 243 ms 314708 KB Output is correct
39 Correct 165 ms 314752 KB Output is correct
40 Correct 175 ms 314764 KB Output is correct
41 Correct 259 ms 314960 KB Output is correct
42 Correct 231 ms 314628 KB Output is correct
43 Correct 179 ms 314752 KB Output is correct
44 Correct 124 ms 314736 KB Output is correct
45 Correct 90 ms 314756 KB Output is correct
46 Correct 60 ms 314452 KB Output is correct
47 Correct 61 ms 314508 KB Output is correct
48 Correct 58 ms 314448 KB Output is correct
49 Correct 62 ms 314440 KB Output is correct
50 Correct 58 ms 314356 KB Output is correct
51 Correct 64 ms 314500 KB Output is correct
52 Correct 57 ms 314560 KB Output is correct
53 Correct 58 ms 314552 KB Output is correct
54 Correct 59 ms 314340 KB Output is correct
55 Correct 61 ms 314556 KB Output is correct
56 Correct 58 ms 314448 KB Output is correct
57 Correct 58 ms 314452 KB Output is correct
58 Correct 62 ms 314452 KB Output is correct
59 Correct 66 ms 314452 KB Output is correct
60 Correct 58 ms 314564 KB Output is correct
61 Correct 75 ms 314556 KB Output is correct
62 Correct 71 ms 314448 KB Output is correct
63 Correct 61 ms 314448 KB Output is correct
64 Correct 72 ms 314448 KB Output is correct
65 Correct 76 ms 314452 KB Output is correct
66 Correct 60 ms 314452 KB Output is correct
67 Correct 72 ms 314452 KB Output is correct
68 Correct 79 ms 314452 KB Output is correct
69 Correct 70 ms 314876 KB Output is correct
70 Correct 63 ms 314452 KB Output is correct
71 Correct 80 ms 314532 KB Output is correct
72 Correct 72 ms 314448 KB Output is correct
73 Correct 62 ms 314448 KB Output is correct
74 Correct 74 ms 314564 KB Output is correct
75 Correct 60 ms 314452 KB Output is correct
76 Runtime error 1456 ms 524288 KB Execution killed with signal 9
77 Halted 0 ms 0 KB -