Submission #525455

#	Time	Username	Problem	Language	Result	Execution time	Memory
525455		ammar2000	Lottery (CEOI18_lot)	C++17	25 / 100	258 ms	65540 KiB

lot

#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,a[SI],Q,l,k;
vector <ll> v[SI];
map <pair <ll,ll > ,ll>  mp;
int main()
{
   fast
   cin>>n>>l;
   for (int i=0;i<n;i++)
    cin>>a[i];
   for (int i=0;i+l-1<n;i++)
     for (int u=0;u<l;u++)
         v[i].pb(a[u+i]);
   for (int i=0;i+l-1<n;i++)
     for (int u=i+1;u+l-1<n;u++)
     {
         ll d=0;
         for (int y=0;y<l;y++)
             if (v[i][y]!=v[u][y])
                d++;
         mp[{i,u}]=mp[{u,i}]=d;
     }
   ll q;
   cin>>q;
   while (q--)
   {
       ll k;
       cin>>k;
       for (int i=0;i+l-1<n;i++)
       {
        ll ans=0;
        for (int u=0;u+l-1<n;u++)
         {
           if (i!=u&&mp[{i,u}]<=k)
                ans++;
         }
       cout  <<ans <<" ";
       }
       cout << "\n";
   }
   return 0;
}

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