oj.uz

Submission #287920

# Submission time Handle Problem Language Result Execution time Memory
287920 2020-09-01T06:46:57 Z TadijaSebez Fibonacci representations (CEOI18_fib) C++11
50 / 100
 4000 ms 84196 KB 
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
int add(int x,int y){x+=y;return x>=mod?x-mod:x;}
int mul(int x,int y){return (ll)x*y%mod;}
#define matrix vector<vector<int>>
matrix operator * (matrix a,matrix b){
	matrix ans(2,vector<int>(2,0));
	for(int i=0;i<2;++i)
		for(int j=0;j<2;++j)
			for(int k=0;k<2;++k)
				ans[i][j]=add(ans[i][j],mul(a[i][k],b[k][j]));
	return ans;
}
matrix build(int sz){
	return {{1,1},{(sz-1)/2,sz/2}};
}
const int N=100050;
int root;
matrix idx;
mt19937 rng(time(0));
namespace Treap{
	const int M=N*10;
	int ls[M],rs[M],tsz,pri[M],key[M];
	matrix sum[M],my[M];
	void pull(int c){sum[c]=sum[rs[c]]*my[c]*sum[ls[c]];}
	int Make(int a,matrix x){tsz++;assert(tsz<M);my[tsz]=sum[tsz]=x;key[tsz]=a;pri[tsz]=rng();return tsz;}
	void rot_l(int&c){int a=rs[c],b=ls[a];rs[c]=b;ls[a]=c;pull(c);pull(a);c=a;}
	void rot_r(int&c){int a=ls[c],b=rs[a];ls[c]=b;rs[a]=c;pull(c);pull(a);c=a;}
	void Ins(int&c,int a,matrix x){
		if(!c)c=Make(a,x);
		else if(key[c]==a)my[c]=x,pull(c);
		else if(key[c]<a){
			Ins(rs[c],a,x);
			if(pri[rs[c]]>pri[c])rot_l(c);
			else pull(c);
		}else{
			Ins(ls[c],a,x);
			if(pri[ls[c]]>pri[c])rot_r(c);
			else pull(c);
		}
	}
	void Cng(int&c,int a,matrix x){
		//if(!c)return;
		if(key[c]==a)my[c]=x,pull(c);
		else if(key[c]<a)Cng(rs[c],a,x),pull(c);
		else Cng(ls[c],a,x),pull(c);
	}
}
/*const int M=30*N*3;
const int lim=1e9+1000;
int ls[M],rs[M],tsz,root;
matrix idx,seg[M];
void Set(int&c,int ss,int se,int qi,matrix m){
	if(!c)c=++tsz,seg[c]=idx;
	if(ss==se){seg[c]=m;return;}
	int mid=ss+se>>1;
	if(qi<=mid)Set(ls[c],ss,mid,qi,m);
	else Set(rs[c],mid+1,se,qi,m);
	seg[c]=seg[rs[c]]*seg[ls[c]];
}*/
set<int> f;
void Add(int a){
	f.insert(a);
	auto it=f.find(a);
	//Set(root,1,lim,a,build(a-*prev(it)));
	Treap::Ins(root,a,build(a-*prev(it)));
	if(next(it)!=f.end()){
		//Set(root,1,lim,*next(it),build(*next(it)-a));
		Treap::Cng(root,*next(it),build(*next(it)-a));
	}
}
void Del(int a){
	auto it=f.find(a);
	//Set(root,1,lim,a,idx);
	Treap::Cng(root,a,idx);
	if(next(it)!=f.end()){
		//Set(root,1,lim,*next(it),build(*next(it)-*prev(it)));
		Treap::Cng(root,*next(it),build(*next(it)-*prev(it)));
	}
	f.erase(it);
}
unordered_map<int,int> cnt,cng;
void Inc(int a){
	assert(a!=0);
	cnt[a]++;
	if(cnt[a]==1)cng[a]++;
}
void Dec(int a){
	assert(a!=0);
	cnt[a]--;
	if(cnt[a]==0){
        cnt.erase(a);
        cng[a]++;
    }
}
void Fix(int a){
	if(cnt[a]&&cnt[a-1]){
		Dec(a);
		Dec(a-1);
		Inc(a+1);
		Fix(a+1);
		Fix(a+2);
	}else if(cnt[a]==2){
		if(a==1){
			Dec(a);Dec(a);
			Inc(a+1);
			Fix(a+1);
			Fix(a+2);
		}else{
			Inc(max(a-2,1));
			Dec(a);Dec(a);
			Inc(a+1);
			Fix(max(a-2,1));
			Fix(max(a-2,1)+1);
			Fix(a+1);
			Fix(a+2);
		}
	}
}
int Solve(){
	matrix m=Treap::sum[root];
	return add(m[0][0],m[1][0]);
	/*int dp[2]={1,0},las=0;
	for(auto it:cnt){
		int i=it.first;
		if(!cnt[i])continue;
		int d0=add(dp[0],dp[1]);
		int sz=i-las-1;
		int d1=add(mul(dp[0],sz/2),mul(dp[1],(sz+1)/2));
		las=i;dp[0]=d0;dp[1]=d1;
	}
	return add(dp[0],dp[1]);*/
}
int main(){
	f.insert(0);
	idx={{1,0},{0,1}};
	Treap::sum[0]=idx;
	int n;
	scanf("%i",&n);
	for(int i=1;i<=n;i++){
		int a;
		scanf("%i",&a);
		cng.clear();
		Inc(a);
		Fix(a);
		Fix(a+1);
		for(auto it:cng)if(it.second&1){
			if(cnt[it.first]==0)Del(it.first);
			else Add(it.first);
		}
		printf("%i\n",Solve());
	}
	return 0;
}

Compilation message

fib.cpp: In function 'int main()':
fib.cpp:142:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  142 |  scanf("%i",&n);
      |  ~~~~~^~~~~~~~~
fib.cpp:145:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  145 |   scanf("%i",&a);
      |   ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47360 KB Output is correct
2 Correct 36 ms 47360 KB Output is correct
3 Correct 36 ms 47360 KB Output is correct
4 Correct 36 ms 47352 KB Output is correct
5 Correct 42 ms 47352 KB Output is correct
6 Correct 36 ms 47352 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47360 KB Output is correct
2 Correct 36 ms 47360 KB Output is correct
3 Correct 36 ms 47360 KB Output is correct
4 Correct 36 ms 47352 KB Output is correct
5 Correct 42 ms 47352 KB Output is correct
6 Correct 36 ms 47352 KB Output is correct
7 Correct 37 ms 47400 KB Output is correct
8 Correct 39 ms 47360 KB Output is correct
9 Correct 41 ms 47352 KB Output is correct
10 Correct 39 ms 47360 KB Output is correct
11 Correct 39 ms 47360 KB Output is correct
12 Correct 38 ms 47360 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47352 KB Output is correct
2 Correct 37 ms 47440 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47360 KB Output is correct
2 Correct 36 ms 47360 KB Output is correct
3 Correct 36 ms 47360 KB Output is correct
4 Correct 36 ms 47352 KB Output is correct
5 Correct 42 ms 47352 KB Output is correct
6 Correct 36 ms 47352 KB Output is correct
7 Correct 37 ms 47400 KB Output is correct
8 Correct 39 ms 47360 KB Output is correct
9 Correct 41 ms 47352 KB Output is correct
10 Correct 39 ms 47360 KB Output is correct
11 Correct 39 ms 47360 KB Output is correct
12 Correct 38 ms 47360 KB Output is correct
13 Correct 36 ms 47352 KB Output is correct
14 Correct 37 ms 47440 KB Output is correct
15 Correct 44 ms 47360 KB Output is correct
16 Correct 39 ms 47360 KB Output is correct
17 Correct 37 ms 47352 KB Output is correct
18 Correct 37 ms 47360 KB Output is correct
19 Correct 40 ms 47360 KB Output is correct
20 Correct 93 ms 47360 KB Output is correct
21 Correct 76 ms 47480 KB Output is correct
22 Correct 54 ms 47436 KB Output is correct
23 Correct 49 ms 47352 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 47352 KB Output is correct
2 Execution timed out 4072 ms 84196 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47360 KB Output is correct
2 Correct 36 ms 47360 KB Output is correct
3 Correct 36 ms 47360 KB Output is correct
4 Correct 36 ms 47352 KB Output is correct
5 Correct 42 ms 47352 KB Output is correct
6 Correct 36 ms 47352 KB Output is correct
7 Correct 37 ms 47400 KB Output is correct
8 Correct 39 ms 47360 KB Output is correct
9 Correct 41 ms 47352 KB Output is correct
10 Correct 39 ms 47360 KB Output is correct
11 Correct 39 ms 47360 KB Output is correct
12 Correct 38 ms 47360 KB Output is correct
13 Correct 36 ms 47352 KB Output is correct
14 Correct 37 ms 47440 KB Output is correct
15 Correct 44 ms 47360 KB Output is correct
16 Correct 39 ms 47360 KB Output is correct
17 Correct 37 ms 47352 KB Output is correct
18 Correct 37 ms 47360 KB Output is correct
19 Correct 40 ms 47360 KB Output is correct
20 Correct 93 ms 47360 KB Output is correct
21 Correct 76 ms 47480 KB Output is correct
22 Correct 54 ms 47436 KB Output is correct
23 Correct 49 ms 47352 KB Output is correct
24 Correct 38 ms 47352 KB Output is correct
25 Execution timed out 4072 ms 84196 KB Time limit exceeded
26 Halted 0 ms 0 KB -