제출 #504478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
504478		ToroTN	Lottery (CEOI18_lot)	C++14	100 / 100	1786 ms	8244 KiB

lot

#include<bits/stdc++.h>
using namespace std;
int n,a[10005],m,t,num[105],idx[10005],ans[105][10005],qs[10005];
vector<pair<int,int> > v;
int query(int l,int r)
{
    return qs[r]-qs[l-1];
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        scanf("%d",&num[i]);
        v.push_back({num[i],i});
    }
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
    {
        idx[v[i].first]=i+1;
    }
    for(int i=10000;i>=1;i--)
    {
        if(i>v[v.size()-1].first)
        {
            idx[i]=v.size()+1;
        }else
        {
            if(idx[i]==0)
            {
                idx[i]=idx[i+1];
            }
        }
    }
    idx[0]=1;
    /*for(int i=1;i<=20;i++)
    {
        printf("%d %d\n",i,idx[i]);
    }*/
    for(int i=-n;i<=n;i++)
    {
        if(i!=0)
        {
            //printf("%d\n",i);
            for(int j=1;j<=n;j++)
            {
                if(j+i>=1&&j+i<=n)
                {
                    if(a[j]!=a[j+i])
                    {
                        qs[j]=1;
                    }else
                    {
                        qs[j]=0;
                    }
                }else
                {
                    qs[j]=0;
                }
                qs[j]+=qs[j-1];
            }
            for(int j=1;j<=n;j++)
            {
                if(j+i>=1&&j+i<=n&&j+i+m-1>=1&&j+i+m-1<=n&&j+m-1>=1&&j+m-1<=n)
                {
                    //printf("%d ",j);
                    ++ans[idx[query(j,j+m-1)]][j];
                }
            }
            /*printf("\n");
            for(int j=1;j<=n;j++)
            {
                printf("%d ",ans[1][j]);
            }
            printf("\n");*/
        }
    }
    /*for(int i=1;i<=t;i++)
    {
        for(int j=1;j<=n;j++)
        {
            printf("%d ",ans[i][j]);
        }
        printf("\n");
    }*/
    for(int i=1;i<=t;i++)
    {
        for(int j=1;j<=n-m+1;j++)
        {
            ans[i][j]+=ans[i-1][j];
        }
    }
    for(int i=1;i<=t;i++)
    {
        //printf("%d\n",idx[num[i]]);
        for(int j=1;j<=n-m+1;j++)
        {
            printf("%d ",ans[idx[num[i]]][j]);
        }
        printf("\n");
    }
}

컴파일 시 표준 에러 (stderr) 메시지

lot.cpp: In function 'int main()':
lot.cpp:23:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
lot.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
lot.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         scanf("%d",&a[i]);
      |         ~~~~~^~~~~~~~~~~~
lot.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     scanf("%d",&t);
      |     ~~~~~^~~~~~~~~
lot.cpp:19:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         scanf("%d",&num[i]);
      |         ~~~~~^~~~~~~~~~~~~~

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