Submission #907230

#	Time	Username	Problem	Language	Result	Execution time	Memory
907230		bachhoangxuan	Rope (JOI17_rope)	C++17	80 / 100	2557 ms	142692 KiB

rope

// 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];

void solve(){
    cin >> n >> m;
    for(int i=0;i<n;i++) cin >> c[i],pos[c[i]].push_back(i);
    set<pii> s;
    for(int i=1;i<=m;i++){
        num[i]=(int)pos[i].size();
        s.insert({num[i],i});
    }
    auto add = [&](int x,int val){
        s.erase({num[x],x});
        num[x]+=val;
        s.insert({num[x],x});
    };
    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+s.rbegin()->fi);
            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+s.rbegin()->fi);
            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 / 15
• Subtask 2: 30 / 30
• Subtask 3: 10 / 10
• Subtask 4: 25 / 25
• Subtask 5: 0 / 20