hdu多校day2-1006The Oculus-二重哈希

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn =2e6+1000;
const ll mod1 = 1e9+7;
const ll mod2 = 1e9+9;
const int base = 131;
int len_a,len_b,len_c;
ll ans1_a,ans2_a,ans1_b,ans2_b,ans1_c,ans2_c,ans1_pre,ans2_pre;
ll a[maxn],b[maxn],c[maxn],fibo1[maxn],fibo2[maxn];
map <ll,ll> mp;
inline int get_num(){
    char ch;
    int num=0;
    ch=getchar();
    while(ch<'0'||ch>'9'){ch=getchar();}
    while(ch>='0'&&ch<='9'){num=(num<<3)+(num<<1)+ch-'0';ch=getchar();}
    return num;
}

void init(){
    fibo1[1] = 1;fibo2[1] = 1;
    fibo1[2] = 2;fibo2[2] = 2;
    mp[fibo1[1]*mod2+fibo2[1]] = 1;
    mp[fibo1[2]*mod2+fibo2[2]] = 2;
    for (int i=3;i<maxn;i++)
        fibo1[i] = (fibo1[i-1]+fibo1[i-2])%mod1,
        fibo2[i] = (fibo2[i-1]+fibo2[i-2])%mod2,
        mp[fibo1[i]*mod2+fibo2[i]] = i;
}

int main(){
    int t;
    t = get_num();
    init();
    while (t--){
        ans1_a=ans1_b=ans2_a=ans2_b=ans1_c=ans2_c=0;
        len_a = get_num();
        for(int i=1;i<=len_a;i++) {
            a[i] = get_num();
            if (a[i]) ans1_a = (ans1_a+fibo1[i])%mod1,ans2_a = (ans2_a+fibo2[i])%mod2;
        }
        len_b = get_num();
        for(int i=1;i<=len_b;i++) {
            b[i] = get_num();
            if (b[i]) ans1_b = (ans1_b+fibo1[i])%mod1,ans2_b = (ans2_b+fibo2[i])%mod2;
        }
        len_c = get_num();
        for(int i=1;i<=len_c;i++) {
            c[i] = get_num();
            if (c[i]) ans1_c = (ans1_c+fibo1[i])%mod1,ans2_c = (ans2_c+fibo2[i])%mod2;
        }
        ans1_pre = (ans1_a*ans1_b)%mod1,ans2_pre = (ans2_a*ans2_b)%mod2;
		//一开始就是错在这里
        ll lsl1 = (ans1_pre-ans1_c+mod1)%mod1,lsl2=(ans2_pre-ans2_c+mod2)%mod2;
        printf("%d\n",mp[lsl1*mod2+lsl2]); //<< ' ' << mp2[ans2_pre-ans2_c] << endl;
    }
}