Submission #1142290

#TimeUsernameProblemLanguageResultExecution timeMemory
114229012345678Lottery (CEOI18_lot)C++17
35 / 100
114 ms520 KiB
#include <bits/stdc++.h>

using namespace std;

const int nx=1e4+5;

int n, l, a[nx], res[nx], q, x;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>l;
    for (int i=1; i<=n; i++) cin>>a[i];
    cin>>q>>x;
    for (int j=2; j+l-1<=n; j++)
    {
        int cur=0, sti=2, stj=j+1;
        for (int i=0; i<l; i++) cur+=(a[i+1]!=a[j+i]);
        if (cur<=x) res[1]++, res[j]++;
        while (stj+l-1<=n)
        {
            cur-=(a[sti-1]!=a[stj-1]);
            cur+=(a[sti+l-1]!=a[stj+l-1]);
            if (cur<=x) res[sti]++, res[stj]++;
            sti++, stj++;
        }
    }
    for (int i=1; i+l-1<=n; i++) cout<<res[i]<<' ';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...