# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1055279 | fryingduc | Telefoni (COCI17_telefoni) | C++17 | 8 ms | 2144 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.
/* #pragma GCC optimize("Ofast,unroll-loops") */
#include "bits/stdc++.h"
using namespace std;
#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif
/* #define int long long */
const int mod = 300'007;
int n, d, a[mod];
void solve(){
cin >> n >> d;
for(int i = 1; i <= n; i++) cin >> a[i];
int ans = 0, last_one = 1;
for(int i = 2; i <= n; i++){
if(i - last_one >= d){
if(a[i] == 0) ans++;
a[i] = 1;
}
if(a[i] == 1) last_one = i;
}
cout << ans;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |