如标题，暴力就给我几分吧，全是WA

样例能过测试点过不了的屑蒟蒻

不求100，求大佬在我这个暴力的程序里挑挑错吧QWQ

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
using namespace std;
const long long Mod=10007;
long long n,m,tmp=1,b1[1000010],i,j,k,ans,h1=1,h2=1;
struct ge
{
	long long bi,num,col;
}a1[1000010];
bool cmp(ge x,ge y)
{
	if(x.col!=y.col)return x.col<y.col;
	else return x.bi<y.bi;
}
int main()
{
	//freopen("sum.in","r",stdin);
	//freopen("sum.out","w",stdout);
	cin>>n>>m;
	for(i=1;i<=n;i++)
	{
		cin>>a1[i].num;
		a1[i].bi=i;
	}
	for(i=1;i<=n;i++)
	{
		cin>>a1[i].col;
	}
	sort(a1+1,a1+n+1,cmp);
	for(i=1;i<h1;i++)if(a1[i].col!=a1[i+1].col)b1[tmp]=i,tmp++;
	for(k=1;k<=m;k++)for(i=b1[k-1]+1;i<b1[k];i++)for(j=i+1;j<=b1[k];j++)ans=ans+(a1[i].bi+a1[j].bi)%Mod*(a1[i].num+a1[j].num)%Mod;
	cout<<ans;
	return 0;
}

淦！