211392026-01-12 12:45:06szabel26Virágos rét (50 pont)cpp17Accepted 50/5020ms2332 KiB
#include <iostream>
#include <vector>
using namespace std;

long long n, k, i, db;
vector<long long> 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 (n==k)
    {
        cout<<1;
        return 0;
    }

    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
base50/50
1Accepted0/01ms500 KiB
2Accepted0/01ms316 KiB
3Accepted0/018ms1332 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms384 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms512 KiB
9Accepted3/31ms316 KiB
10Accepted2/21ms364 KiB
11Accepted3/31ms316 KiB
12Accepted2/21ms316 KiB
13Accepted3/31ms316 KiB
14Accepted2/218ms2112 KiB
15Accepted2/219ms2220 KiB
16Accepted3/318ms1712 KiB
17Accepted3/317ms1472 KiB
18Accepted3/319ms2224 KiB
19Accepted3/318ms1260 KiB
20Accepted3/319ms2332 KiB
21Accepted3/319ms1692 KiB
22Accepted3/320ms2220 KiB