Submission #1026357

#TimeUsernameProblemLanguageResultExecution timeMemory
1026357vjudge1Lottery (CEOI18_lot)C++17
45 / 100
399 ms63324 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long 
int ans[2005][2005];
int a[2000+5];
int n,l;

void solve(){
    for(int q=1;q<=n-l+1;q++){
        for(int w=q+1;w<=n-l+1;w++){
            int bny=0;
            for(int u=1;u<=l;u++){
                if(a[q+u-1]!=a[w+u-1]){
                    bny++;
                }
            }
            for(int r=bny;r<=l;r++){
                ans[q][r]++;
                ans[w][r]++;
            }
        }
    }
}

signed main(){
    cin>>n>>l;
    for(int t=1;t<=n;t++){
        cin>>a[t];
    }
    solve();
    int q;
    cin>>q;
    for(int t=1;t<=q;t++){
        int b;
        cin>>b;
        for(int r=1;r<=n-l+1;r++){
            cout<<ans[r][b]<<" ";
        }
        cout<<endl;
    }
}
#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...