【BZOJ3243】【UOJ121】【NOI2013】向量内积（随机）

Descrition

http://uoj.ac/problem/121

---

Solution

对于$k=2$，我们可以判断$1\dots i-1$的向量和$i$的点积的和是否与$i-1$同余，如果不，那么$i$一定可以在$1\dots i-1$内找到一个解。

对于$k=3$，我们将其平方一下，那么原本余$2$的数就变成余$1$，就可以判断了。

---

Solution

/************************************************
 * Au: Hany01
 * Date: Aug 9th, 2018
 * Prob: BZOJ3243 NOI2013 向量内积
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
	static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1e5 + 5, maxd = 105;

int Case = 3;
int d, MOD, sum[maxd][maxd], p[maxn], vec[maxn][maxd];

inline int ad(int x, int y) { if ((x += y) >= MOD) return x - MOD; return x; }

inline int Dot(int* A, int* B) {
	static int Ans; Ans = 0;
	rep(i, d) Ans += A[i] * B[i];
	return Ans % MOD;
}

inline int Calc(int p) {
	static int Sum; Sum = 0;
	rep(i, d) rep(j, d)
		Sum += sum[i][j] * vec[p][i] * vec[p][j], sum[i][j] += vec[p][i] * vec[p][j];
	return Sum % MOD;
}

int main()
{
#ifdef hany01
	freopen("bzoj3243.in", "r", stdin);
	freopen("bzoj3243.out", "w", stdout);
#endif

	static int n;

	srand(19260817);

	n = read(), d = read(), MOD = read();
	rep(i, n) {
		rep(j, d) vec[i][j] = read() % MOD;
		p[i] = i;
	}

	while (Case --) {
		random_shuffle(p, p + n);
		rep(i, d) rep(j, d) sum[i][j] = vec[0][i] * vec[0][j];
		For(i, 1, n - 1) {
			if (Calc(p[i]) != i % MOD) {
				For(j, 0, i - 1) if (!(Dot(vec[p[i]], vec[p[j]]) % MOD)) {
					if (p[i] > p[j]) swap(i, j);
					printf("%d %d\n", p[i] + 1, p[j] + 1);
					return 0;
				}
			}
		}
	}
	puts("-1 -1");

	return 0;
}