제출 #724254

#제출 시각아이디문제언어결과실행 시간메모리
724254vjudge1Telefoni (COCI17_telefoni)C++17
72 / 80
1072 ms2004 KiB
#include <bits/stdc++.h> #define F first #define S second #define ll long long #define EB emplace_back using namespace std; const int SIZE = 1e5 + 1; const int MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); int n, d; cin >> n >> d; vector<int> M(n + 1); for (int i = 1; i <= n; i ++) { cin >> M[i]; } int x = 0; int cnt = 0; for (int i = 1; i <= n; i ++) { if (M[i] == 0) { if (i - x >= d) { M[i] = 1; cnt ++; } } for (int j = i; j <= n; j += d) { if (M[i] == 1) { x = i; } } } cout << cnt << "\n"; // muestra el cnt return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...