Submission #401014

#	Time	Username	Problem	Language	Result	Execution time	Memory
401014		KoD	Fibonacci representations (CEOI18_fib)	C++17	0 / 100	1 ms	288 KiB

fib

#include <bits/stdc++.h>

template <class T>
using Vec = std::vector<T>;

using ll = long long;

int main() {
    int N;
    std::cin >> N;
    Vec<int> A;
    for (int steps = 0; steps < N; ++steps) {
        { 
            int x;
            std::cin >> x;
            A.push_back(x);  
        }
        std::sort(A.begin(), A.end());
        std::array<ll, 2> dp{};
        dp[0] = 1;
        int last = 0;
        for (const auto x: A) {
            const auto dif = x - last;
            std::array<ll, 2> next{};
            for (int i = 0; i < 2; ++i) {
                next[0] += dp[i];
                next[1] += dp[i] * ((dif - 1 + i) / 2);
            }
            dp = std::move(next);
            last = x;
        }
        std::cout << dp[0] + dp[1] << '\n';
    }
    return 0;
}

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