211342026-01-12 12:39:13szabel26Virágos rét (50 pont)cpp17Wrong answer 42/5019ms1412 KiB
#include <iostream>
#include <vector>
using namespace std;

int n, k, i, db;
vector<int> x, y;

int main()
{
    cin >> n >> k;

    x.resize(n + 1);
    y.push_back(0);
    for (i = 1; i <= n; ++i)
    {
        cin >> x[i];
        if (x[i] == 1)
        {
            ++db;
            y.push_back(i);
        }
    }

    if (db < k)
    {
        cout << 0;
        return 0;
    }
    else if (db == k)
    {
        cout << 1;
        return 0;
    }

    db = 0;
    for (i = 1; i < y.size() - (k - 1); ++i)
    {
        db += y.size() - 1 - (i - 1) - (k - 1);
    }

    cout << db;
}
SubtaskSumTestVerdictTimeMemory
base42/50
1Accepted0/01ms544 KiB
2Accepted0/01ms508 KiB
3Accepted0/018ms920 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms508 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted2/21ms316 KiB
11Accepted3/31ms316 KiB
12Accepted2/21ms392 KiB
13Accepted3/31ms316 KiB
14Accepted2/218ms1412 KiB
15Wrong answer0/218ms1376 KiB
16Accepted3/318ms1032 KiB
17Accepted3/317ms904 KiB
18Wrong answer0/319ms1412 KiB
19Accepted3/317ms812 KiB
20Accepted3/319ms1392 KiB
21Accepted3/318ms1020 KiB
22Wrong answer0/319ms1296 KiB