207152026-01-08 18:12:27KoszorusBlankaVirágos rét (50 pont)cpp17Time limit exceeded 30/50298ms796 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;
    int db1 = 0;
    vector <int> R(N+1);
    for (int i = 1; i <= N; i++) {
        cin >> R[i];
        if (R[i]==1) { db1++; }
    }

    if (db1 < K) { cout << 0; }else if (db1 == K) { cout << 1; }else {
        int ossz = 0;
        for (int i = 1; i <= N; i++) {
            if (R[i]==1) {
                int db = 1;
                for (int j = i+1; j <= N; j++) {
                    if (R[j] == 1) {
                        db++;
                        if (db >= K) { ossz++; }

                    }
                }
            }
        }
        cout << ossz;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base30/50
1Accepted0/01ms316 KiB
2Accepted0/01ms508 KiB
3Time limit exceeded0/0282ms580 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted2/21ms316 KiB
11Accepted3/32ms316 KiB
12Accepted2/21ms316 KiB
13Accepted3/31ms316 KiB
14Accepted2/217ms564 KiB
15Time limit exceeded0/2289ms568 KiB
16Time limit exceeded0/3289ms748 KiB
17Time limit exceeded0/3280ms564 KiB
18Time limit exceeded0/3284ms564 KiB
19Accepted3/371ms796 KiB
20Time limit exceeded0/3282ms564 KiB
21Time limit exceeded0/3298ms564 KiB
22Time limit exceeded0/3289ms564 KiB