Submission #746498

#	Time	Username	Problem	Language	Result	Execution time	Memory
746498		vjudge1	Fibonacci representations (CEOI18_fib)	C++17	5 / 100	1937 ms	312 KiB

fib

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
int arr[N] , fib[21] , n , mx;

void input(){
	cin >> n;
	for(int i = 0 ; i < n ; i++){
		cin >> arr[i];
		mx = max(mx , arr[i]);
	}
}

void pre(){
	fib[0] = 1;
	fib[1] = 2;
	for(int i = 2 ; i < 21 ; i++)
		fib[i] = fib[i - 1] + fib[i - 2];
}

int cal(int sum){
	int cnt = 0;
	for(int mask = 0 ; mask < (1 << 21) ; mask++){
		int sm = 0;
		for(int i = 0 ; i < 21 ; i++)
			if(mask & (1 << i))
				sm += fib[i];
		cnt += (sm == sum);
	}
	return cnt;
}

void sub1(){
	pre();
	int sum = 0;
	for(int i = 0 ; i < n ; i++){
		sum += fib[arr[i] - 1];
		cout << cal(sum) << ' ';
	}
	cout << '\n';
}

int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

	input();

	if(n <= 15 && mx <= 15){
		sub1();
		return 0;
	}
	return 0;
}

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