Submission #813384

#	Time	Username	Problem	Language	Result	Execution time	Memory
813384		Vladden	Fibonacci representations (CEOI18_fib)	C++14	65 / 100	4048 ms	119440 KiB

fib

#include <iostream>
#include <algorithm>
#include <set>
#include <cstring>
using namespace std;
const int N = 1e5+7;
typedef long long ll;
const ll MOD = 1e9+7;
const int INF = 2e9;
const int MAXA = 1e9+1e6;
int A[N];
ll X(int n){
	if (n<0){
		return 0;
	}
	return (n+2)/2;
}
struct tnode{
	tnode *l,*r;
	int mi, mx, sum;
	ll dp[2][2];
	tnode(int _sum){
		sum = _sum;
		l = nullptr;
		r = nullptr;
		memset(dp,0,sizeof(dp));
		mi = INF, mx = -INF;
	}
	void merge(tnode &pl,tnode &pr){
		sum = pl.sum+pr.sum;
		mi = min(pl.mi,pr.mi);
		mx = max(pl.mx,pr.mx);
		if (pl.sum==0){
			for(int l = 0;l<2;l+=1){
				for(int r = 0;r<2;r+=1){
					dp[l][r] = pr.dp[l][r];
				}
			}
			return;
		}
		if (pr.sum==0){
			for(int l = 0;l<2;l+=1){
				for(int r = 0;r<2;r+=1){
					dp[l][r] = pl.dp[l][r];
				}
			}
			return;
		}
		for(int l = 0;l<2;l+=1){
			for(int r = 0;r<2;r+=1){
				dp[l][r] = (pl.dp[l][0]+pl.dp[l][1])*pr.dp[0][r] +
				 (pl.dp[l][0]*X(pr.mi-2-pl.mx-1)+pl.dp[l][1]*X(pr.mi-2-(pl.mx-1)-1))%MOD*pr.dp[1][r];
				dp[l][r] %= MOD;
			}
		}
	}
	void update(int tl,int tr,int pos,int val){
		if (tl>pos || tr<pos){
			return;
		}
		if (tl==tr){
			sum += val;
			memset(dp,0,sizeof(dp));
			if (sum==0){
				mi = INF, mx = -INF;
			}
			else{
				mi = mx = tl;
				dp[0][0] = 1;
				if (tl>=2){
					dp[1][1] = 1;
				}
			}
			return;
		}
		if (l==nullptr){
			l = new tnode(0);
		}
		if (r==nullptr){
			r = new tnode(0);
		}
		int tm = (tl+tr)/2;
		l->update(tl,tm,pos,val);
		r->update(tm+1,tr,pos,val);
		merge(*l,*r);
		if (l->sum==0){
			delete l;
			l = nullptr;
		}
		if (r->sum==0){
			delete r;
			r = nullptr;
		}
	}
	int get(int tl,int tr,int pos){
		if (tl>pos || tr<pos){
			return 0;
		}
		if (tl==tr){
			return sum;
		}
		int tm = (tl+tr)/2;
		int ret = 0;
		if (l!=nullptr) ret += l->get(tl,tm,pos);
		if (r!=nullptr) ret += r->get(tm+1,tr,pos);
		return ret;
	}
};
multiset<int> S;
tnode *root;
set<int> chg;
void add(int v,int qnt){
	if (qnt>0){
		chg.insert(v);
	}
	for(int i = 0;i<-qnt;i+=1){
		S.erase(S.lower_bound(v));
	}
	for(int i = 0;i<qnt;i+=1){
		S.insert(v);
	}
	root->update(0,MAXA,v+1,qnt);
}
void normalize(int nn){
	chg.clear();
	chg.insert(nn);
	while(1){
		bool flag = false;
		while(!chg.empty()){
			int vb = *chg.rbegin();
			for(int v = vb+1;v>=vb-1;v-=1){
				if (!S.count(v)){
					continue;
				}
				if (S.count(v-1)){
					add(v,-1);
					add(v-1,-1);
					add(v+1,1);
					flag = true;
					break;
				}
				else if (v>=2 && S.count(v)>=2){
					add(v,-2);
					add(v+1,1);
					add(v-2,1);
					flag = true;
					break;
				}
				else if (S.count(v)==2 && v==1){
					add(1,-2);
					add(0,1);
					add(2,1);
					flag = true;
					break;
				}
				else if (S.count(v)==2 && v==0){
					add(0,-2);
					add(1,1);
					flag = true;
					break;
				}
			}
			if (flag){
				break;
			}
			if (!flag){
				chg.erase(prev(chg.end()));
			}
		}
		if (!flag){
			break;
		}
	}
}
 
ll solve(int v){
	normalize(v);
	ll ret = 0;
	for(int l = 0;l<2;l+=1){
		for(int r = 0;r<2;r+=1){
			ret += root->dp[l][r];
		}
	}
	return ret%MOD;
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin>>n;
	root = new tnode(0);
	root->update(0,MAXA,0,1);
	for(int i = 1;i<=n;i+=1){
		int v;
		cin>>v;
		add(v-1,1);
		cout<<solve(v)<<'\n';
	/*	cout<<"GDB ";
		for(int i = 1;i<=sz;i+=1){
			cout<<A[i]<<' ';
		}
		cout<<'\n';*/
	}
}

• Subtask 1: 5 / 5
• Subtask 2: 20 / 20
• Subtask 3: 15 / 15
• Subtask 4: 10 / 10
• Subtask 5: 15 / 15
• Subtask 6: 0 / 35