# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236718 | VEGAnn | Rasvjeta (COCI17_rasvjeta) | C++14 | 5 ms | 384 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;
const int N = 1010;
bool mrk[N];
int n, m, k, ans = 0;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < m; i++){
int x; cin >> x;
for (int j = max(1, x - k); j <= min(n, x + k); j++)
mrk[j] = 1;
}
for (int i = 1; i <= n; i++){
if (mrk[i]) continue;
ans++;
for (int j = i; j <= min(n, i + k + k); j++)
mrk[j] = 1;
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |