Submission #920099

#TimeUsernameProblemLanguageResultExecution timeMemory
920099Muhammad_AneeqLottery (CEOI18_lot)C++17
45 / 100
3034 ms596 KiB
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <algorithm>
using namespace std;
inline void solve()
{   
    int n,l;
    cin>>n>>l;
    int a[n];
    for (auto &i:a)
        cin>>i;
    int q;
    cin>>q;
    int qu[q];
    for (auto& i:qu)
        cin>>i;
    int ans[q][n-l+1]={};
    for (int i=0;i<=n-l;i++)
    {
        for (int j=i+1;j<=n-l;j++)
        {
            int z=0;
            for (int f=0;f<l;f++)
            {
                if (a[i+f]!=a[j+f])
                    z++;
            }
            for (int f=0;f<q;f++)
                if (qu[f]>=z)
                {
                    ans[f][i]++;
                    ans[f][j]++;
                }
        }
    }
    for (int i=0;i<q;i++)
        for (int j=0;j<=n-l;j++)
            cout<<ans[i][j]<<(j==n-l?'\n':' ');
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}
#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...