google codejam 2008 round1B

Problem A. Crop Triangles、

大数据运行时间大约为430s

 #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <string>
#include <string.h>
#include <sstream>
#include <cctype>
#include <climits>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <vector>
#include <iterator>
#include <algorithm>
#include <stack>
#define _clr(x,y) memset(x,y,sizeof(x))
#define _inf(x) memset(x,0x3f,sizeof(x))
#define pb push_back
#define mp make_pair
using namespace std;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
typedef long long LL;
int main()
{
	//ios_base::sync_with_stdio(false);cin.tie(0);
	#ifndef ONLINE_JUDGE
		//freopen("A-large-practice.in","r",stdin);
		//freopen("myout.txt","w",stdout);
	#endif
	
	int T;
	cin>>T;
	for(int cas=1;cas<=T;cas++)
	{
		LL ans=0,cnt1[3][3]={0},cnt[3][3]={0};
		LL n,a,b,c,d,x0,y0,m;
		LL x[100000+5],y[100000+5];
		cin>>n>>a>>b>>c>>d>>x0>>y0>>m;
		x[0]=x0;y[0]=y0;
		cnt1[x0%3][y0%3]++;
		for(int i=1;i<n;i++)
		{
			x[i]=(a*x[i-1]+b)%m;
			y[i]=(c*y[i-1]+d)%m;
			cnt1[x[i]%3][y[i]%3]++;
		}
		/*memcpy(cnt,cnt1,sizeof(cnt));
		for(int i=0;i<3;i++)
		{
			for(int j=0;j<3;j++)
			cout<<cnt[i][j]<<" ";
			cout<<endl;
		}*/
		
		for(int i=0;i<n;i++)
		{
			cnt1[x[i]%3][y[i]%3]--;
			memcpy(cnt,cnt1,sizeof(cnt));
			for(int j=i+1;j<n;j++)
			{
				cnt[x[j]%3][y[j]%3]--;
				int dx=(x[i]+x[j])%3,dy=(y[i]+y[j])%3;
				ans+=cnt[(3-dx)%3][(3-dy)%3];
			}
		}
		/*for(int i=0;i<n;i++)
		for(int j=i+1;j<n;j++)
		for(int k=j+1;k<n;k++)
		if((x[i]+x[j]+x[k])%3==0&&(y[i]+y[j]+y[k])%3==0) ans++;*/
		
		cout<<"Case #"<<cas<<": "<<ans<<endl;
	}
	
    return 0;
}