NOI2013 UOJ122 向量内积

神题......

还是大神讲得比较清晰~orz

http://dffxtz.logdown.com/posts/197950-noi2013-vector-inner-product

启发题：poj3318

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<utility>
#include<set>
#include<bitset>
#include<vector>
#include<functional>
#include<deque>
#include<cctype>
#include<climits>
#include<complex>
//#include<bits/stdc++.h>适用于CF,UOJ，但不适用于poj
#include<ctime>
 
using namespace std;
 
typedef long long LL;
typedef double DB;
typedef pair<int,int> PII;
typedef complex<DB> CP;
 
#define mmst(a,v) memset(a,v,sizeof(a))
#define mmcy(a,b) memcpy(a,b,sizeof(a))
#define re(i,a,b)  for(i=a;i<=b;i++)
#define red(i,a,b) for(i=a;i>=b;i--)
#define fi first
#define se second
#define m_p(a,b) make_pair(a,b)
#define SF scanf
#define PF printf
#define two(k) (1<<(k))
 
template<class T>inline T sqr(T x){return x*x;}
template<class T>inline void upmin(T &t,T tmp){if(t>tmp)t=tmp;}
template<class T>inline void upmax(T &t,T tmp){if(t<tmp)t=tmp;}
 
const DB EPS=1e-;
inline int sgn(DB x){if(abs(x)<EPS)return ;return(x>)?:-;}
const DB Pi=acos(-1.0);
 
inline int gint()
  {
        int res=;bool neg=;char z;
        for(z=getchar();z!=EOF && z!='-' && !isdigit(z);z=getchar());
        if(z==EOF)return ;
        if(z=='-'){neg=;z=getchar();}
        for(;z!=EOF && isdigit(z);res=res*+z-'',z=getchar());
        return (neg)?-res:res;
    }
inline LL gll()
  {
      LL res=;bool neg=;char z;
        for(z=getchar();z!=EOF && z!='-' && !isdigit(z);z=getchar());
        if(z==EOF)return ;
        if(z=='-'){neg=;z=getchar();}
        for(;z!=EOF && isdigit(z);res=res*+z-'',z=getchar());
        return (neg)?-res:res;
    }
 
const int maxN=;
const int maxDD=;
 
int N,DD,D,K;
int v[maxN+][maxDD+];
 
inline int A1(int i,int j)
  {
      if(K==)
        {
            int t1=(j+DD-)/DD,t2=j-(t1-)*DD;
            return v[i][t1]*v[i][t2];
        }
      return v[i][j];
  }
inline int A2(int i,int j){return A1(j,i);}
 
int F[maxN+],X[maxN+],GX[maxN+],FX[maxN+],A2X[maxN+],A1A2X[maxN+],TX[maxN+];
inline int work()
  {
      int i,j,k,Case;
      if(1LL*N*D<10000000LL) Case=; else Case=;
      while(Case--)
        {
            re(i,,N)X[i]=rand()%;
 
            mmst(GX,);
            re(i,,N)GX[]+=X[i];
            GX[]%=K;
            re(i,,N)GX[i]=GX[];
 
            re(i,,N)FX[i]=F[i]*X[i];
 
            mmst(A2X,);
            re(i,,D)re(j,,N)A2X[i]+=A2(i,j)*X[j];
 
            mmst(A1A2X,);
            re(i,,N)re(j,,D)A1A2X[i]+=A1(i,j)*A2X[j];
            re(i,,N)A1A2X[i]%=K;
 
            re(i,,N)
              {
                  TX[i]=GX[i]-FX[i]-A1A2X[i];
                  TX[i]=(TX[i]%K+K)%K;
                  if(TX[i]!=)
                    {
                        re(j,,N)if(j!=i)
                          {
                              int res=;
                              re(k,,DD)res+=v[i][k]*v[j][k];
                              if(res%K==){PF("%d %d\n",min(i,j),max(i,j));return ;}
                          }
                    }
              }
        }
      return ;
  }
 
int main()
  {
      freopen("meow.in","r",stdin);
      freopen("meow.out","w",stdout);
      srand(time());
      int i,j;
      N=gint();D=gint();K=gint();
      re(i,,N)re(j,,D)v[i][j]=gint()%K;
      DD=D;if(K==)D=D*D;
      re(i,,N)
        {
            F[i]=;
            re(j,,D) F[i]+=A1(i,j)*A2(j,i);
            F[i]%=K;F[i]^=;
        }
      if(!work())PF("-1 -1\n");
      return ;
  }