Submission #118377

#	Time	Username	Problem	Language	Result	Execution time	Memory
118377		davitmarg	Lottery (CEOI18_lot)	C++17	45 / 100	524 ms	14080 KiB

lot

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

int n,l,a[10004],cnt[2003][2003],Q,k;
int main()
{
    cin>>n>>l;
    for(int i=1;i<=n;i++)
        scanf("%d",a+i);


    cin>>Q;
    if(Q!=1)
    {
        for(int i=1;i<=n-l+1;i++)
            for(int j=i+1;j<=n-l+1;j++)
                for(int p=0;p<l;p++)
                    cnt[i][j]+=(a[i+p]!=a[j+p]);
    }
    for(int QQ=0;QQ<Q;QQ++)
    {
        scanf("%d",&k);
        vector<int> ans(n-l+3);
        if(Q!=1)
        {
            for(int i=1;i<=n-l+1;i++)
                for(int j=i+1;j<=n-l+1;j++)
                {
                    ans[i]+=(cnt[i][j]<=k);
                    ans[j]+=(cnt[i][j]<=k);
                }
        }
        else
        {
        for(int i=1;i<=n-l+1;i++)
            for(int j=i+1;j<=n-l+1;j++)
            {
                int c=0;
                for(int p=0;p<l;p++)
                    c+=(a[i+p]!=a[j+p]);
                ans[i]+=(cnt[i][j]<=k);
                ans[j]+=(cnt[i][j]<=k);
            }
        }
        for(int i=1;i<=n-l+1;i++)
            printf("%d ",ans[i]);
        printf("\n");
    }

	return 0;
}


/*


*/

Compilation message (stderr)

lot.cpp: In function 'int main()':
lot.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",a+i);
         ~~~~~^~~~~~~~~~
lot.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&k);
         ~~~~~^~~~~~~~~

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