Submission #644522

#TimeUsernameProblemLanguageResultExecution timeMemory
644522ali72Telefoni (COCI17_telefoni)C++17
80 / 80
13 ms1492 KiB
#include <bits/extc++.h> using namespace std; using namespace __gnu_pbds; #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> void ALI_72(){ int n,d; cin >> n >> d; vector < int > v(n); for(auto& i : v) cin >> i; int ans = 0, point = 0; for(int i = 0;i < n;i++){ if(v[i]){ point = i + d; continue; }else if(i == point){ ans++; point = i + d; } } cout << ans << '\n'; } signed main() { ios_base :: sync_with_stdio(0); cin.tie(0), cout.tie(0); int t = 1; //cin >> t; while(t--){ ALI_72(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...