| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 684303 | Breadz | Rasvjeta (COCI17_rasvjeta) | C++17 | 1 ms | 296 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;
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 time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
