oj.uz

Submission #369590

# Submission time Handle Problem Language Result Execution time Memory
369590 2021-02-22T01:14:37 Z TosakaUCW Telefoni (COCI17_telefoni) C++17
80 / 80
 5 ms 2028 KB 
#include <stdio.h>
#include <algorithm>

int read(int x = 0, int f = 0, char ch = getchar())
{
    while ('0' > ch or ch > '9')
        f = ch == '-', ch = getchar();
    while ('0' <= ch and ch <= '9')
        x = x * 10 + (ch ^ 48), ch = getchar();
    return f ? -x : x;
}

const int N = 3e5 + 5;

int n, k, ans;
int a[N];

int main()
{
    // freopen("telefoni.in", "r", stdin), freopen("telefoni.out", "w", stdout);
    n = read(), k = read();
    for (int i = 1, x = 0, sum = 0; i <= n; i++)
    {
        x = a[i] = read(), sum += x;
        if (i > k)
            sum -= a[i - k];
        if (i >= k and sum == 0)
            ans++, a[i] = 1, sum++;
    }
    return printf("%d", ans), 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 376 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 4 ms 2028 KB Output is correct
9 Correct 5 ms 2028 KB Output is correct
10 Correct 4 ms 2028 KB Output is correct