Submission #1325745

#TimeUsernameProblemLanguageResultExecution timeMemory
1325745DanielPr8Lottery (CEOI18_lot)C++20
35 / 100
143 ms580 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvl = vector<vll>;
using pll = pair<ll,ll>;
using vpl = vector<pll>;
using vvp = vector<vpl>;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(),v.end()



int main(){
    ios_base::sync_with_stdio(0);cin.tie(NULL);
    ll n, l, q;
    cin >> n >> l;
    vll ar(n), ask;
    for(ll& i:ar)cin >> i;
    cin >> q;
    for(ll o,i = 0 ; i++ < q; ask.pb(o))cin >> o;
    vll am(n);

    for(ll j = 1; j < n; ++j){
        ll dif=0;
        for(ll i = 0; i+j < n; ++i){
            dif += (ar[i]!=ar[i+j]);
            if(i>=l)dif -= (ar[i-l]!=ar[i+j-l]);
            if(i<l-1 || dif>ask[0])continue;
            am[i-l+1]++;
            am[i+j-l+1]++;
        }
    }

    for(ll p:ask){
        for(ll i = 0; i <= n-l; ++i){
            cout << am[i] << " ";
        }
        cout << "\n";
    }
}
#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...