Submission #1087051

#TimeUsernameProblemLanguageResultExecution timeMemory
1087051toast12Telefoni (COCI17_telefoni)C++14
64 / 80
26 ms3412 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, d; cin >> n >> d; vector<int> telephones(n+1); for (int i = 1; i <= n; i++) { cin >> telephones[i]; } int ans = 0; int last = 1; int i = last; while (i < n) { int x = last; for (int j = i; j <= i + d; j++) { if (telephones[j]) x = j; } if (x == last) { ans++; last += d; i = last; } else { i = x; last = x; } } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...