257672026-03-01 20:38:03horvayzsomborVirágos rét (50 pont)cpp17Wrong answer 42/5010ms888 KiB
#include <iostream>
#include <vector>

using namespace std;

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

    vector<char> v(n);

    for(int i = 0; i < n; i++)
    {
        cin >> v[i];
    }

    vector<int> s(n + 1);

    for(int i = n - 1; i >= 0; i--)
    {
        s[i] = s[i + 1];   
        if(v[i] == '1') s[i]++; 
    }

    int ans = 0;

    int cnt = 0;
    int j = 0;

    for(int i = 0; i < n; i++)
    {
        if(v[i] == '1')
        {
            while(j < n && cnt != k)
            {
                if(v[j] == '1') cnt++;
                j++;
            }

            if(cnt == k) ans += s[j - 1];

            cnt--;
        }
    }

    cout << ans;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base42/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted0/010ms820 KiB
4Accepted2/21ms500 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms368 KiB
9Accepted3/31ms316 KiB
10Accepted2/21ms316 KiB
11Accepted3/31ms316 KiB
12Accepted2/22ms316 KiB
13Accepted3/31ms352 KiB
14Accepted2/28ms748 KiB
15Wrong answer0/28ms824 KiB
16Accepted3/39ms876 KiB
17Accepted3/39ms744 KiB
18Wrong answer0/310ms748 KiB
19Accepted3/39ms752 KiB
20Accepted3/39ms888 KiB
21Accepted3/310ms752 KiB
22Wrong answer0/39ms820 KiB