Submission #967705

#	Time	Username	Problem	Language	Result	Execution time	Memory
967705		vjudge1	Ice Hockey World Championship (CEOI15_bobek)	C++17	0 / 100	2 ms	348 KiB

bobek

#include <iostream>
#include <vector>

using namespace std;

long long countSubsequences(const vector<int>& arr, int n, long long k) {
    long long result = 0;

    // Iterate through all possible subsequences
    for (int i = 0; i < n; ++i) {
        for (int j = i; j < n; ++j) {
            for (int l = j; l < n; ++l) {
                for (int m = l; m < n; ++m) {
                    long long sum = 0;
                    // Calculate the sum of the current subsequence
                    for (int idx = i; idx <= m; ++idx) {
                        sum += arr[idx];
                    }
                    // Check if the sum is less than or equal to k
                    if (sum <= k) {
                        ++result;
                    }
                }
            }
        }
    }

    return result;
}

int main() {
    int n;
    long long k;
    cin >> n;
    vector<int> arr(n);
    for (int i = 0; i < n; ++i)
        cin >> arr[i];
    cin >> k;

    long long result = countSubsequences(arr, n, k);
    cout << result << endl;

    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10