Submission #920104

#	Time	Username	Problem	Language	Result	Execution time	Memory
920104		Muhammad_Aneeq	Lottery (CEOI18_lot)	C++17	45 / 100	3039 ms	600 KiB

lot

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
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;
    if (q==1&&qu==0)
    {
        set<int>s;
        int ans[n-l+1]={};
        for (int i=0;i<=n-l;i++)
            s.insert(i);
        while (s.size())
        {
            vector<int>z;
            int f=*begin(s);
            for (auto i:s)
            {
                if (f==i)
                    continue;
                bool w=0;
                for (int k=0;k<l&&!w;k++)
                    if (a[f+k]!=a[i+k])
                        w=1;
                if (w==0)
                    z.push_back(i);
            }
            z.push_back(f);
            for (auto i:z)
            {
                ans[i]=z.size()-1;
                s.erase(i);
            }
        }
        for (auto i:ans)
            cout<<i<<' ';
        cout<<endl;
    }
    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();
}

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