Submission #336247

#	Time	Username	Problem	Language	Result	Execution time	Memory
336247		YJU	Rope (JOI17_rope)	C++14	100 / 100	1666 ms	85868 KiB

rope

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef int 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];
vector<pair<ll,pll> > v[N];

ll seg[2*N][2];

void ins(ll sid,ll id,ll l,ll r,ll to,ll d){
	for(to+=m,seg[to][sid]+=d;to>1;to>>=1){
		seg[to>>1][sid]=max(seg[to][sid],seg[to^1][sid]);
	}
}

void add(ll sid,pll A){
	if(A.X==A.Y){
		if(A.X)v[A.X].pb(mp(sid,A));
	}else{
		if(A.X)v[A.X].pb(mp(sid,A));
		if(A.Y)v[A.Y].pb(mp(sid,A));
	}
	if(A.X)ins(sid,1,1,m+1,A.X,1);
	if(A.Y)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[i]){
			if(j.Y.X)ins(j.X,1,1,m+1,j.Y.X,-1);
			if(j.Y.Y)ins(j.X,1,1,m+1,j.Y.Y,-1);
		}
		cout<<n-cnt[i]-max(0,max(seg[1][0],seg[1][1]))<<"\n";
		for(auto j:v[i]){
			if(j.Y.X)ins(j.X,1,1,m+1,j.Y.X,1);
			if(j.Y.Y)ins(j.X,1,1,m+1,j.Y.Y,1);
		}
	}
	return 0;
}

Compilation message (stderr)

rope.cpp:12:18: warning: overflow in conversion from 'long long int' to 'll' {aka 'int'} changes value from '1152921504606846976' to '0' [-Woverflow]
   12 | const ll INF=(1LL<<60);
      |              ~~~~^~~~~

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