oj.uz

Submission #121238

# Submission time Handle Problem Language Result Execution time Memory
121238 2019-06-26T08:52:15 Z _7_7_ Fibonacci representations (CEOI18_fib) C++14
0 / 100
 99 ms 1560 KB 
#include <bits/stdc++.h>                                           

#define int long long	
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);                                          
#define forev(i, b, a) for(int i = (b); i >= (a); --i)	    
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define sz(s) (int)s.size()
#define all(x) x.bg, x.en                                                                    
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define rbg rbegin()
#define bg begin()
#define en end()
#define s second
#define f first                                               
	
   
using namespace std;                  
   
   
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb; 
typedef long long ll;  
typedef double db;                            
						               
				
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 265;	
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);  
const int inf = 1e9, N = 2e3 + 11, mod = 1e9 + 7;
const db eps = 1e-12, pi = 3.14159265359; 
const ll INF = 1e18;	




int n, f[30], a[30];
map < int, int > res;


void precalc () {
	f[0] = f[1] = 1;
	forn (i, 1, 20)
		f[i] = f[i - 1] + f[i - 2];
}


main () {
	ios_base :: sync_with_stdio(0);
	cin.tie(0);                                        
	cout.tie(0);
	cin >> n;
	if (n <= 15) {
		precalc();
		forn (mask, 0, (1 << 19) - 1) {
		    int sum = 0;
			forn (j, 0, 19)
				if (mask & (1 << j))
					sum += f[j + 1];
			++res[sum];		
		}


		forn (i, 1, n) {
			cin >> a[i];
			a[i] = f[a[i]] + a[i - 1];
			cout << res[a[i]] << endl;
		}             
	}
	return 0;
}

Compilation message

fib.cpp:56:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 1372 KB Output is correct
2 Correct 93 ms 1412 KB Output is correct
3 Correct 91 ms 1560 KB Output is correct
4 Correct 90 ms 1400 KB Output is correct
5 Correct 94 ms 1372 KB Output is correct
6 Incorrect 90 ms 1528 KB Output isn't correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 1372 KB Output is correct
2 Correct 93 ms 1412 KB Output is correct
3 Correct 91 ms 1560 KB Output is correct
4 Correct 90 ms 1400 KB Output is correct
5 Correct 94 ms 1372 KB Output is correct
6 Incorrect 90 ms 1528 KB Output isn't correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 1372 KB Output is correct
2 Correct 93 ms 1412 KB Output is correct
3 Correct 91 ms 1560 KB Output is correct
4 Correct 90 ms 1400 KB Output is correct
5 Correct 94 ms 1372 KB Output is correct
6 Incorrect 90 ms 1528 KB Output isn't correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 1372 KB Output is correct
2 Correct 93 ms 1412 KB Output is correct
3 Correct 91 ms 1560 KB Output is correct
4 Correct 90 ms 1400 KB Output is correct
5 Correct 94 ms 1372 KB Output is correct
6 Incorrect 90 ms 1528 KB Output isn't correct