제출 #684303

#제출 시각아이디문제언어결과실행 시간메모리
684303BreadzRasvjeta (COCI17_rasvjeta)C++17
15 / 50
1 ms296 KiB
#include <bits/stdc++.h> using namespace std; bitset<2001> bs; int main() { int n; cin >> n; int m; cin >> m; int k; cin >> k; vector<int> lights(m); for(int i = 0; i < m; i++) { cin >> lights[i]; for(int j = max(lights[i]-k, 1); j <= min(lights[i]+k, n); j++){bs[j] = 1;} } int ans = 0; for(int i = 1; i <= n; i++) { if(!bs[i]) { ans++; for(int j = max(i-k, 1); j <= min(i+k, n); j++){bs[j] = 1;} } } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...