제출 #367922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
367922		ogibogi2004	Lottery (CEOI18_lot)	C++14	100 / 100	880 ms	12396 KiB

lot

#include<bits/stdc++.h>
using namespace std;
const int MAXN=10002;
int n,l,q;
int a[MAXN];
int gg[MAXN];
int p[MAXN][102];
int ans[MAXN][102];
struct query
{
	int k,pos;
	bool operator<(query const& other)const
	{
		return k<other.k;
	}
};
bool cmp(query q1,query q2)
{
	return q1.pos<q2.pos;
}
vector<query>v;
int main()
{
	cin>>n>>l;
	for(int i=1;i<=n;i++)cin>>a[i];
	cin>>q;
	for(int i=0;i<q;i++)
	{
		int k;
		cin>>k;
		v.push_back({k,i});
	}
	sort(v.begin(),v.end());
	memset(gg,-1,sizeof(gg));
	for(int i=0;i<=v[0].k;i++)
	{
		gg[i]=0;
	}
	for(int i=1;i<v.size();i++)
	{
		for(int j=v[i-1].k+1;j<=v[i].k;j++)
		{
			gg[j]=i;
		}
	}
	for(int d=1;d+l<=n;d++)
	{
		int l1=1,r1=l;
		int l2=1+d,r2=l+d;
		int cnt=0;
		for(int j=1;j<=l;j++)
		{
			if(a[j]!=a[j+d])cnt++;
		}
		p[l1][gg[cnt]]++;
		p[l2][gg[cnt]]++;
		for(;;)
		{
			l1++;
			r1++;
			l2++;
			r2++;
			if(r2>n)break;
			if(a[l1-1]!=a[l2-1])cnt--;
			if(a[r1]!=a[r2])cnt++;
			p[l1][gg[cnt]]++;
			p[l2][gg[cnt]]++;
		}
	}
	sort(v.begin(),v.end(),cmp);
	for(int i=1;i<=n;i++)
	{
		ans[i][0]=p[i][0];
	}
	for(int j=1;j<102;j++)
	{
		for(int i=1;i<=n;i++)
		{
			ans[i][j]=p[i][j]+ans[i][j-1];
		}
	}
	for(auto xd:v)
	{
		for(int i=1;i<=n-l+1;i++)
		{
			cout<<ans[i][gg[xd.k]]<<" ";
		}
		cout<<endl;
	}
return 0;
}

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

lot.cpp: In function 'int main()':
lot.cpp:39:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for(int i=1;i<v.size();i++)
      |              ~^~~~~~~~~

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