Submission #336221

#	Time	Username	Problem	Language	Result	Execution time	Memory
336221		YJU	Rope (JOI17_rope)	C++14	0 / 100	32 ms	47468 KiB

rope

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e6+5;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll u[N],n,m,cnt[N],ans[N],dp[N],s[N];
vector<pll> v[2][N];

ll seg[2][4*N];

void ins(ll sid,ll id,ll l,ll r,ll to,ll d){
	if(l==r-1){seg[sid][id]+=d;return ;}
	ll mid=(l+r)/2;
	if(to<mid){
		ins(sid,id*2,l,mid,to,d);
	}else{
		ins(sid,id*2+1,mid,r,to,d);
	}
	seg[sid][id]=max(seg[sid][id*2],seg[sid][id*2+1]);
}

void add(ll sid,pll A){
	if(A.X==A.Y){
		v[sid][A.X].pb(A);
	}else{
		v[sid][A.X].pb(A);
		v[sid][A.Y].pb(A);
	}
	ins(sid,1,1,m+1,A.X,1);
	ins(sid,1,1,m+1,A.Y,1);
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	REP1(i,n){
		cin>>u[i];
		++cnt[u[i]];
		pll tmp=mp(u[i-1],u[i]);
		add(i&1,tmp);
		if(i==n)add((i+1)&1,mp(u[i],u[i+1]));
	}
	REP1(i,m){
		for(auto j:v[0][i]){
			ins(0,1,1,m+1,j.X,-1);
			ins(0,1,1,m+1,j.Y,-1);
		}
		for(auto j:v[1][i]){
			ins(1,1,1,m+1,j.X,-1);
			ins(1,1,1,m+1,j.Y,-1);
		}
		ans[i]=n-cnt[i]-max(0LL,max(seg[0][1],seg[1][1]));
		for(auto j:v[0][i]){
			ins(0,1,1,m+1,j.X,1);
			ins(0,1,1,m+1,j.Y,1);
		}
		for(auto j:v[1][i]){
			ins(1,1,1,m+1,j.X,1);
			ins(1,1,1,m+1,j.Y,1);
		}
	}
	REP1(i,m)cout<<ans[i]<<"\n";
	return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 30
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 20