oj.uz

Submission #971028

# Submission time Handle Problem Language Result Execution time Memory
971028 2024-04-27T20:22:57 Z RandomUser Telefoni (COCI17_telefoni) C++17
80 / 80
 57 ms 2132 KB 
#include <bits/stdc++.h>
using namespace std;

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

    int dp[n+1]; dp[1] = 0;
    multiset<int> ms; ms.insert(0);
    for(int i=1; i<=n; i++) {
        int x; cin >> x;
        if(i == 1) continue;
        dp[i] = *ms.begin() + (x ^ 1);
        ms.insert(dp[i]);
        if(i > d) ms.erase(ms.find(dp[i-d]));
    }

    cout << dp[n] << '\n';
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 57 ms 2132 KB Output is correct
9 Correct 52 ms 2128 KB Output is correct
10 Correct 57 ms 2128 KB Output is correct