제출 #201510

#제출 시각아이디문제언어결과실행 시간메모리
201510awlintqaaTelefoni (COCI17_telefoni)C++14
80 / 80
68 ms3276 KiB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #include <bits/stdc++.h> using namespace std; #define sqr 340 #define mid (l+r)/2 #define pb push_back #define ppb pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define ins insert #define era erase #define C continue #define mem(dp,i) memset(dp,i,sizeof(dp)) #define mset multiset typedef long long ll; typedef short int si; typedef long double ld; typedef pair<int,int> pi; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; const ll mod=1e9+7; const ll inf=1e18; const ld pai=acos(-1); ll n,d; ll a[300009]; int main(){ cin>>n>>d; for(int i=0;i<n;i++)cin>>a[i]; ll mx=-d,ans=-1,i=0; while(i<n){ ans++; mx+=d; for(;i<=mx;i++){ if(!a[i])C; mx=max(mx,i+d); } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...