oj.uz

Submission #147593

# Submission time Handle Problem Language Result Execution time Memory
147593 2019-08-30T07:59:01 Z SeekingOblivion Telefoni (COCI17_telefoni) C++14
80 / 80
 82 ms 2680 KB 
//#include<fstream>
#include<algorithm>
#include<iostream>
#define fin cin
#define fout cout
using namespace std;
//ifstream fin("date.in");
//ofstream fout("date.out");
int i,n,d;
int v[300010],s[300010];
int main()
{
    fin>>n>>d;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];v[i]+=v[i-1];
        if(i!=1&&v[i-1]-v[max(i-d,1)-1]==0)
            s[i]=s[max(i-d,1)]+1;
        else
            s[i]=s[i-1];
    }
    fout<<s[n];
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 82 ms 2680 KB Output is correct
9 Correct 78 ms 2680 KB Output is correct
10 Correct 78 ms 2680 KB Output is correct