oj.uz

Submission #121228

# Submission time Handle Problem Language Result Execution time Memory
121228 2019-06-26T08:36:07 Z RockyB Fibonacci representations (CEOI18_fib) C++17
5 / 100
 3126 ms 262144 KB 
/// In The Name Of God

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n;
int sz;
ll a[N], f[N];

map <ll, int> dp[200];
int calc(ll x, int l = 1) {
	if (!x) return 1;
	if (dp[l].count(x)) return dp[l][x];
	int res = 0;
	rep(i, l, sz) {
		if (f[i] <= x) {
			res += calc(x - f[i], i + 1);
			res %= mod;
		}
	}
	return dp[l][x] = res;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n;
	rep(i, 1, n) {
		cin >> a[i];
	}
	f[1] = 1;
	f[2] = 2;
	sz = 2;
	while (sz < 100) {
		++sz;
		f[sz] = f[sz - 1] + f[sz - 2];
	}
	rep(i, 1, n) {
		a[i] = f[a[i]];
		a[i] += a[i - 1];
	}

	rep(i, 1, n) {
		cout << calc(a[i]) << nl;
	}
	ioi
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 109 ms 11484 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 15 ms 2432 KB Output is correct
6 Correct 728 ms 50864 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 109 ms 11484 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 15 ms 2432 KB Output is correct
6 Correct 728 ms 50864 KB Output is correct
7 Correct 20 ms 2432 KB Output is correct
8 Runtime error 3104 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 3126 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 109 ms 11484 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 15 ms 2432 KB Output is correct
6 Correct 728 ms 50864 KB Output is correct
7 Correct 20 ms 2432 KB Output is correct
8 Runtime error 3104 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 109 ms 11484 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 15 ms 2432 KB Output is correct
6 Correct 728 ms 50864 KB Output is correct
7 Correct 20 ms 2432 KB Output is correct
8 Runtime error 3104 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -