oj.uz

Submission #980507

# Submission time Handle Problem Language Result Execution time Memory
980507 2024-05-12T08:07:28 Z AlperenT_ Sličnost (COI23_slicnost) C++17
24 / 100
 398 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 nw ;
vector<node> seg ;
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.pb(nw) ;
        seg[c].t = 1; 
        c++;
        return c-1;
    }
    int id = c ;c++;
    seg.pb(nw);
    seg[id].l = bui(l,mid);
    seg[id].r = bui(mid+1,r);
    mrg(id) ;
    return id ;
}
int upd(int x ,int w , int x2 , int w2 , int p , int l  ,int r){
    int id = c , mid = (l+r)/2 ; c++ ;
    seg.pb(nw);
    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(x <= mid || x2 <= mid)seg[id].l = upd(x,w,x2,w2,seg[p].l , l ,mid);
    if(x > mid || x2 > mid)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);
    seg.pb(nw) ;
    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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 6408 KB Output is correct
17 Correct 6 ms 6600 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 313 ms 331088 KB Output is correct
20 Correct 28 ms 41648 KB Output is correct
21 Correct 84 ms 165740 KB Output is correct
22 Correct 3 ms 4044 KB Output is correct
23 Correct 27 ms 42532 KB Output is correct
24 Correct 27 ms 41920 KB Output is correct
25 Correct 219 ms 329608 KB Output is correct
26 Correct 223 ms 330632 KB Output is correct
27 Correct 99 ms 166256 KB Output is correct
28 Correct 185 ms 330560 KB Output is correct
29 Correct 92 ms 165844 KB Output is correct
30 Correct 5 ms 7372 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 6408 KB Output is correct
17 Correct 6 ms 6600 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 313 ms 331088 KB Output is correct
20 Correct 28 ms 41648 KB Output is correct
21 Correct 84 ms 165740 KB Output is correct
22 Correct 3 ms 4044 KB Output is correct
23 Correct 27 ms 42532 KB Output is correct
24 Correct 27 ms 41920 KB Output is correct
25 Correct 219 ms 329608 KB Output is correct
26 Correct 223 ms 330632 KB Output is correct
27 Correct 99 ms 166256 KB Output is correct
28 Correct 185 ms 330560 KB Output is correct
29 Correct 92 ms 165844 KB Output is correct
30 Correct 5 ms 7372 KB Output is correct
31 Correct 120 ms 84388 KB Output is correct
32 Correct 182 ms 167300 KB Output is correct
33 Correct 17 ms 3792 KB Output is correct
34 Runtime error 377 ms 524288 KB Execution killed with signal 9
35 Halted 0 ms 0 KB -

Subtask #4
7.0 / 7.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 6408 KB Output is correct
17 Correct 6 ms 6600 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 313 ms 331088 KB Output is correct
20 Correct 28 ms 41648 KB Output is correct
21 Correct 84 ms 165740 KB Output is correct
22 Correct 3 ms 4044 KB Output is correct
23 Correct 27 ms 42532 KB Output is correct
24 Correct 27 ms 41920 KB Output is correct
25 Correct 219 ms 329608 KB Output is correct
26 Correct 223 ms 330632 KB Output is correct
27 Correct 99 ms 166256 KB Output is correct
28 Correct 185 ms 330560 KB Output is correct
29 Correct 92 ms 165844 KB Output is correct
30 Correct 5 ms 7372 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 828 KB Output is correct
35 Correct 1 ms 828 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 1176 KB Output is correct
38 Correct 1 ms 824 KB Output is correct
39 Correct 1 ms 828 KB Output is correct
40 Correct 1 ms 828 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 0 ms 596 KB Output is correct
44 Correct 1 ms 1172 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 14 ms 10948 KB Output is correct
47 Correct 14 ms 12232 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Runtime error 398 ms 524288 KB Execution killed with signal 9
50 Halted 0 ms 0 KB -

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 6408 KB Output is correct
17 Correct 6 ms 6600 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 313 ms 331088 KB Output is correct
20 Correct 28 ms 41648 KB Output is correct
21 Correct 84 ms 165740 KB Output is correct
22 Correct 3 ms 4044 KB Output is correct
23 Correct 27 ms 42532 KB Output is correct
24 Correct 27 ms 41920 KB Output is correct
25 Correct 219 ms 329608 KB Output is correct
26 Correct 223 ms 330632 KB Output is correct
27 Correct 99 ms 166256 KB Output is correct
28 Correct 185 ms 330560 KB Output is correct
29 Correct 92 ms 165844 KB Output is correct
30 Correct 5 ms 7372 KB Output is correct
31 Correct 120 ms 84388 KB Output is correct
32 Correct 182 ms 167300 KB Output is correct
33 Correct 17 ms 3792 KB Output is correct
34 Runtime error 377 ms 524288 KB Execution killed with signal 9
35 Halted 0 ms 0 KB -