# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
684350 | coldy | Rasvjeta (COCI17_rasvjeta) | C++14 | 1 ms | 212 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 <iostream>
#include <set>
using namespace std;
int main(){
int n, m, k;
cin>>n>>m>>k;
bool lit[n + 1];
for(int i = 1; i <= n; i++)lit[i] = 0;
set <int> unlit;
for(int i = 0; i < m; i++){
int pos; cin>>pos;
int start = max(pos - k, 1), end = min(pos + k, n);
//cout<<start<<" "<<end<<endl;
for(; start <= end; start++)lit[start] = 1;
}
// for(int i = 1; i <= n; i++){
// cout<<lit[i]<<" ";
// }
int ans = 0;
for(int i = 1; i <= n; i++){
if(!lit[i]){
ans++;
int pos = min(i + k, n);
int l = pos - 1, r = pos + 1;
lit[pos] = 1;
for(; l >= pos - k && l >= 1; l--)lit[l] = 1;
for(; r <= n && r <= pos + k; r++)lit[r] = 1;
}
}cout<<ans<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |