oj.uz

Submission #249181

# Submission time Handle Problem Language Result Execution time Memory
249181 2020-07-14T13:08:21 Z Vimmer Telefoni (COCI17_telefoni) C++14
80 / 80
 16 ms 2048 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100100
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 6> a6;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;




int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, d;

    cin >> n >> d;

    int a[n];

    for (int i = 0; i < n; i++) cin >> a[i];

    int ans = 0, j = 0;

    for (int i = 1; i < n; i++)
    {
        if (a[i] == 1) j = i;

        if (i - j == d) {j = i; ans++;}
    }

    cout << ans << endl;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 16 ms 2048 KB Output is correct
9 Correct 15 ms 2048 KB Output is correct
10 Correct 15 ms 2048 KB Output is correct