제출 #684350

#제출 시각아이디문제언어결과실행 시간메모리
684350coldyRasvjeta (COCI17_rasvjeta)C++14
50 / 50
1 ms212 KiB
#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 timeMemoryGrader output
Fetching results...