Submission #287583

#	Time	Username	Problem	Language	Result	Execution time	Memory
287583		TadijaSebez	Fibonacci representations (CEOI18_fib)	C++11	15 / 100	4075 ms	1380 KiB

fib

#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;}
const int N=150;
map<int,int> cnt;
void Fix(int a){
	if(cnt[a]&&cnt[a-1]){
		cnt[a]--;
		cnt[a-1]--;
		cnt[a+1]++;
		Fix(a+1);
		Fix(a+2);
	}else if(cnt[a]==2){
		if(a==1){
			cnt[a]-=2;
			cnt[a+1]++;
			Fix(a+1);
			Fix(a+2);
		}else{
			cnt[max(a-2,1)]++;
			cnt[a]--;
			cnt[a+1]++;
			Fix(max(a-2,1));
			Fix(a-1);
			Fix(a+1);
			Fix(a+2);
		}
	}
	for(int i=1;i<N;i++)assert(cnt[i]<2&&(!cnt[i]||!cnt[i-1]));
}
int Solve(){
	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(){
	int n;
	scanf("%i",&n);
	for(int i=1;i<=n;i++){
		int a;
		scanf("%i",&a);
		cnt[a]++;
		Fix(a);
		Fix(a+1);
		printf("%i\n",Solve());
	}
	return 0;
}

Compilation message (stderr)

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

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