# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
971028 | RandomUser | Telefoni (COCI17_telefoni) | C++17 | 57 ms | 2132 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |