oj.uz

Submission #907234

# Submission time Handle Problem Language Result Execution time Memory
907234 2024-01-15T09:54:31 Z bachhoangxuan Rope (JOI17_rope) C++17
100 / 100
 2116 ms 94764 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=1000005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int n,m,c[maxn],num[maxn];
vector<int> pos[maxn];

int tree[4*maxn];
void build(int l,int r,int id){
    if(l==r){
        tree[id]=num[l];
        return;
    }
    int mid=(l+r)>>1;
    build(l,mid,id<<1);build(mid+1,r,id<<1|1);
    tree[id]=max(tree[id<<1],tree[id<<1|1]);
}
void update(int l,int r,int id,int p,int val){
    if(l==r){
        tree[id]+=val;
        return;
    }
    int mid=(l+r)>>1;
    if(p<=mid) update(l,mid,id<<1,p,val);
    else update(mid+1,r,id<<1|1,p,val);
    tree[id]=max(tree[id<<1],tree[id<<1|1]);
}

void solve(){
    cin >> n >> m;
    for(int i=0;i<n;i++) cin >> c[i],pos[c[i]].push_back(i);
    for(int i=1;i<=m;i++) num[i]=(int)pos[i].size();
    build(1,m,1);
    auto add = [&](int x,int val){
        update(1,m,1,x,val);
    };
    for(int i=1;i<=m;i++){
        int res=0,cnt=num[i];
        add(i,-cnt);
        {//Even
            for(int x:pos[i]) if((x^1)<n && c[x^1]!=i) add(c[x^1],-1);
            res=max(res,cnt+tree[1]);
            for(int x:pos[i]) if((x^1)<n && c[x^1]!=i) add(c[x^1],1);
        }
        {//Odd
            for(int x:pos[i]){
                int y=((x+1)^1)-1;
                if(y<n && y>=0 && c[y]!=i) add(c[y],-1);
            }
            res=max(res,cnt+tree[1]);
            for(int x:pos[i]){
                int y=((x+1)^1)-1;
                if(y<n && y>=0 && c[y]!=i) add(c[y],1);
            }
        }
        add(i,cnt);
        cout << n-res << '\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 26968 KB Output is correct
2 Correct 7 ms 26972 KB Output is correct
3 Correct 8 ms 26972 KB Output is correct
4 Correct 9 ms 26968 KB Output is correct
5 Correct 9 ms 26972 KB Output is correct
6 Correct 8 ms 26972 KB Output is correct
7 Correct 8 ms 27104 KB Output is correct
8 Correct 10 ms 26972 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 8 ms 26968 KB Output is correct
11 Correct 7 ms 26972 KB Output is correct
12 Correct 8 ms 27136 KB Output is correct
13 Correct 7 ms 27084 KB Output is correct
14 Correct 8 ms 27104 KB Output is correct
15 Correct 8 ms 26972 KB Output is correct
16 Correct 7 ms 26968 KB Output is correct
17 Correct 9 ms 26972 KB Output is correct
18 Correct 8 ms 27140 KB Output is correct
19 Correct 9 ms 26972 KB Output is correct
20 Correct 8 ms 27088 KB Output is correct
21 Correct 8 ms 26972 KB Output is correct
22 Correct 8 ms 26972 KB Output is correct
23 Correct 8 ms 27224 KB Output is correct
24 Correct 9 ms 26972 KB Output is correct
25 Correct 8 ms 27136 KB Output is correct
26 Correct 7 ms 26972 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 26968 KB Output is correct
2 Correct 7 ms 26972 KB Output is correct
3 Correct 8 ms 26972 KB Output is correct
4 Correct 9 ms 26968 KB Output is correct
5 Correct 9 ms 26972 KB Output is correct
6 Correct 8 ms 26972 KB Output is correct
7 Correct 8 ms 27104 KB Output is correct
8 Correct 10 ms 26972 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 8 ms 26968 KB Output is correct
11 Correct 7 ms 26972 KB Output is correct
12 Correct 8 ms 27136 KB Output is correct
13 Correct 7 ms 27084 KB Output is correct
14 Correct 8 ms 27104 KB Output is correct
15 Correct 8 ms 26972 KB Output is correct
16 Correct 7 ms 26968 KB Output is correct
17 Correct 9 ms 26972 KB Output is correct
18 Correct 8 ms 27140 KB Output is correct
19 Correct 9 ms 26972 KB Output is correct
20 Correct 8 ms 27088 KB Output is correct
21 Correct 8 ms 26972 KB Output is correct
22 Correct 8 ms 26972 KB Output is correct
23 Correct 8 ms 27224 KB Output is correct
24 Correct 9 ms 26972 KB Output is correct
25 Correct 8 ms 27136 KB Output is correct
26 Correct 7 ms 26972 KB Output is correct
27 Correct 28 ms 28252 KB Output is correct
28 Correct 19 ms 27996 KB Output is correct
29 Correct 22 ms 28340 KB Output is correct
30 Correct 19 ms 28004 KB Output is correct
31 Correct 27 ms 28248 KB Output is correct
32 Correct 18 ms 28064 KB Output is correct
33 Correct 22 ms 28252 KB Output is correct
34 Correct 19 ms 28236 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 26968 KB Output is correct
2 Correct 7 ms 26972 KB Output is correct
3 Correct 8 ms 26972 KB Output is correct
4 Correct 9 ms 26968 KB Output is correct
5 Correct 9 ms 26972 KB Output is correct
6 Correct 8 ms 26972 KB Output is correct
7 Correct 8 ms 27104 KB Output is correct
8 Correct 10 ms 26972 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 8 ms 26968 KB Output is correct
11 Correct 7 ms 26972 KB Output is correct
12 Correct 8 ms 27136 KB Output is correct
13 Correct 7 ms 27084 KB Output is correct
14 Correct 8 ms 27104 KB Output is correct
15 Correct 8 ms 26972 KB Output is correct
16 Correct 7 ms 26968 KB Output is correct
17 Correct 9 ms 26972 KB Output is correct
18 Correct 8 ms 27140 KB Output is correct
19 Correct 9 ms 26972 KB Output is correct
20 Correct 8 ms 27088 KB Output is correct
21 Correct 8 ms 26972 KB Output is correct
22 Correct 8 ms 26972 KB Output is correct
23 Correct 8 ms 27224 KB Output is correct
24 Correct 9 ms 26972 KB Output is correct
25 Correct 8 ms 27136 KB Output is correct
26 Correct 7 ms 26972 KB Output is correct
27 Correct 28 ms 28252 KB Output is correct
28 Correct 19 ms 27996 KB Output is correct
29 Correct 22 ms 28340 KB Output is correct
30 Correct 19 ms 28004 KB Output is correct
31 Correct 27 ms 28248 KB Output is correct
32 Correct 18 ms 28064 KB Output is correct
33 Correct 22 ms 28252 KB Output is correct
34 Correct 19 ms 28236 KB Output is correct
35 Correct 40 ms 28252 KB Output is correct
36 Correct 42 ms 28540 KB Output is correct
37 Correct 45 ms 28252 KB Output is correct
38 Correct 43 ms 28260 KB Output is correct
39 Correct 47 ms 28252 KB Output is correct
40 Correct 33 ms 28456 KB Output is correct
41 Correct 32 ms 28248 KB Output is correct
42 Correct 30 ms 28248 KB Output is correct
43 Correct 29 ms 28248 KB Output is correct
44 Correct 41 ms 28412 KB Output is correct
45 Correct 33 ms 28436 KB Output is correct
46 Correct 30 ms 28252 KB Output is correct
47 Correct 40 ms 28452 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 26968 KB Output is correct
2 Correct 7 ms 26972 KB Output is correct
3 Correct 8 ms 26972 KB Output is correct
4 Correct 9 ms 26968 KB Output is correct
5 Correct 9 ms 26972 KB Output is correct
6 Correct 8 ms 26972 KB Output is correct
7 Correct 8 ms 27104 KB Output is correct
8 Correct 10 ms 26972 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 8 ms 26968 KB Output is correct
11 Correct 7 ms 26972 KB Output is correct
12 Correct 8 ms 27136 KB Output is correct
13 Correct 7 ms 27084 KB Output is correct
14 Correct 8 ms 27104 KB Output is correct
15 Correct 8 ms 26972 KB Output is correct
16 Correct 7 ms 26968 KB Output is correct
17 Correct 9 ms 26972 KB Output is correct
18 Correct 8 ms 27140 KB Output is correct
19 Correct 9 ms 26972 KB Output is correct
20 Correct 8 ms 27088 KB Output is correct
21 Correct 8 ms 26972 KB Output is correct
22 Correct 8 ms 26972 KB Output is correct
23 Correct 8 ms 27224 KB Output is correct
24 Correct 9 ms 26972 KB Output is correct
25 Correct 8 ms 27136 KB Output is correct
26 Correct 7 ms 26972 KB Output is correct
27 Correct 28 ms 28252 KB Output is correct
28 Correct 19 ms 27996 KB Output is correct
29 Correct 22 ms 28340 KB Output is correct
30 Correct 19 ms 28004 KB Output is correct
31 Correct 27 ms 28248 KB Output is correct
32 Correct 18 ms 28064 KB Output is correct
33 Correct 22 ms 28252 KB Output is correct
34 Correct 19 ms 28236 KB Output is correct
35 Correct 40 ms 28252 KB Output is correct
36 Correct 42 ms 28540 KB Output is correct
37 Correct 45 ms 28252 KB Output is correct
38 Correct 43 ms 28260 KB Output is correct
39 Correct 47 ms 28252 KB Output is correct
40 Correct 33 ms 28456 KB Output is correct
41 Correct 32 ms 28248 KB Output is correct
42 Correct 30 ms 28248 KB Output is correct
43 Correct 29 ms 28248 KB Output is correct
44 Correct 41 ms 28412 KB Output is correct
45 Correct 33 ms 28436 KB Output is correct
46 Correct 30 ms 28252 KB Output is correct
47 Correct 40 ms 28452 KB Output is correct
48 Correct 617 ms 47072 KB Output is correct
49 Correct 576 ms 47360 KB Output is correct
50 Correct 479 ms 46924 KB Output is correct
51 Correct 541 ms 47064 KB Output is correct
52 Correct 505 ms 44548 KB Output is correct
53 Correct 389 ms 45468 KB Output is correct
54 Correct 379 ms 43616 KB Output is correct
55 Correct 358 ms 43108 KB Output is correct
56 Correct 348 ms 42320 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 26968 KB Output is correct
2 Correct 7 ms 26972 KB Output is correct
3 Correct 8 ms 26972 KB Output is correct
4 Correct 9 ms 26968 KB Output is correct
5 Correct 9 ms 26972 KB Output is correct
6 Correct 8 ms 26972 KB Output is correct
7 Correct 8 ms 27104 KB Output is correct
8 Correct 10 ms 26972 KB Output is correct
9 Correct 7 ms 26972 KB Output is correct
10 Correct 8 ms 26968 KB Output is correct
11 Correct 7 ms 26972 KB Output is correct
12 Correct 8 ms 27136 KB Output is correct
13 Correct 7 ms 27084 KB Output is correct
14 Correct 8 ms 27104 KB Output is correct
15 Correct 8 ms 26972 KB Output is correct
16 Correct 7 ms 26968 KB Output is correct
17 Correct 9 ms 26972 KB Output is correct
18 Correct 8 ms 27140 KB Output is correct
19 Correct 9 ms 26972 KB Output is correct
20 Correct 8 ms 27088 KB Output is correct
21 Correct 8 ms 26972 KB Output is correct
22 Correct 8 ms 26972 KB Output is correct
23 Correct 8 ms 27224 KB Output is correct
24 Correct 9 ms 26972 KB Output is correct
25 Correct 8 ms 27136 KB Output is correct
26 Correct 7 ms 26972 KB Output is correct
27 Correct 28 ms 28252 KB Output is correct
28 Correct 19 ms 27996 KB Output is correct
29 Correct 22 ms 28340 KB Output is correct
30 Correct 19 ms 28004 KB Output is correct
31 Correct 27 ms 28248 KB Output is correct
32 Correct 18 ms 28064 KB Output is correct
33 Correct 22 ms 28252 KB Output is correct
34 Correct 19 ms 28236 KB Output is correct
35 Correct 40 ms 28252 KB Output is correct
36 Correct 42 ms 28540 KB Output is correct
37 Correct 45 ms 28252 KB Output is correct
38 Correct 43 ms 28260 KB Output is correct
39 Correct 47 ms 28252 KB Output is correct
40 Correct 33 ms 28456 KB Output is correct
41 Correct 32 ms 28248 KB Output is correct
42 Correct 30 ms 28248 KB Output is correct
43 Correct 29 ms 28248 KB Output is correct
44 Correct 41 ms 28412 KB Output is correct
45 Correct 33 ms 28436 KB Output is correct
46 Correct 30 ms 28252 KB Output is correct
47 Correct 40 ms 28452 KB Output is correct
48 Correct 617 ms 47072 KB Output is correct
49 Correct 576 ms 47360 KB Output is correct
50 Correct 479 ms 46924 KB Output is correct
51 Correct 541 ms 47064 KB Output is correct
52 Correct 505 ms 44548 KB Output is correct
53 Correct 389 ms 45468 KB Output is correct
54 Correct 379 ms 43616 KB Output is correct
55 Correct 358 ms 43108 KB Output is correct
56 Correct 348 ms 42320 KB Output is correct
57 Correct 2116 ms 94764 KB Output is correct
58 Correct 1822 ms 85612 KB Output is correct
59 Correct 1694 ms 85764 KB Output is correct
60 Correct 1902 ms 90596 KB Output is correct
61 Correct 2011 ms 90648 KB Output is correct
62 Correct 964 ms 68480 KB Output is correct
63 Correct 1330 ms 74252 KB Output is correct
64 Correct 1127 ms 70008 KB Output is correct
65 Correct 721 ms 59660 KB Output is correct