Submission #1028873

#	Time	Username	Problem	Language	Result	Execution time	Memory
1028873		dimasnbayu	Lottery (CEOI18_lot)	C++14	45 / 100	382 ms	50660 KiB

lot

#include<bits/stdc++.h>
using namespace std;
const int MAX_N=10000+5;
int arr[MAX_N];
short much[MAX_N][MAX_N];
int main(){
    int n,l; cin>>n>>l;
    for(int i=1;i<=n;i++) cin>>arr[i];
    for(int i=1;i<=n-l+1;i++){
        for(int j=i+1;j<=n-l+1;j++){
            int cnt=0;
            for(int k=0;k<l;k++){
                if(arr[i+k]!=arr[j+k]) cnt++;
            }
            much[i][cnt]++;
            much[j][cnt]++;
        }
    }
    for(int i=1;i<=n-l+1;i++){
        for(int j=0;j<=l;j++){
            // cout<<much[i][j]<<" ";
            much[i][j]+=much[i][j-1];
        }
        // cout<<endl;
    }
    int q; cin>>q;
    while(q--){
        int x; cin>>x;
        for(int i=1;i<=n-l+1;i++) cout<<much[i][x]<<" ";
        cout<<endl;
    }
}

• Subtask 1: 25 / 25
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20